SBGSMC DATA AMATESTS  SBGSMC   DATA   AMATESTS  {:[" SBGSMC "],[" DATA "],[" AMATESTS "]:}\begin{gathered} \text { SBGSMC } \\ \text { DATA } \\ \text { AMATESTS } \end{gathered} SBGSMC  DATA  AMATESTS 
Imessing :
Vointere:  Vointere:  " Vointere: "\text { Vointere: } Vointere: 
Hivess-INSAMIONS MACBOPHMSUS  Hivess-INSAMIONS   MACBOPHMSUS  {:[" Hivess-INSAMIONS "],[" MACBOPHMSUS "]:}\begin{aligned} & \text { Hivess-INSAMIONS } \\ & \text { MACBOPHMSUS } \end{aligned} Hivess-INSAMIONS  MACBOPHMSUS 
SOCIETH OI BNPIORATION GZORTUTECTSTS
Series: Investigations in Geophysics, Volume I Michael R. Cooper, Series Editor

SEISMIC DATA ANALYSIS

Processing, Inversion, and Interpretation of Seismic Data

ÖZ YILMAZ

Volume I

Stephen M. Doherty, Editor
Society of Exploration Geophysicists
Post Office Box 702740, Tulsa, OK 74170-2740
Library of Congress Cataloging-in-Publication Data
Yilmaz, Ozdogan.
Seismic data analysis: processing, inversion, and interpretation of seismic data / O z ¨ Y i l m a z O z ¨ Y i l m a z Oz^(¨)Yilmaz\ddot{\mathrm{Oz}} \mathrm{Yilmaz}Oz¨Yilmaz; Stephen M. Doherty, editor. p. cm (Investigations in geophysies; no. 10)
Rev, ed. of: Seismic data processing. 1987.
Includes bibliographical references and index.
  1. Seismic prospecting Data processing. I. Doherty, Stephen M. II. Yilmaz, Özdogan. Seismic data processing. III. Title, IV. Series.
TN269.Y55 2001
622 .1592 622 .1592 622^(').1592622^{\prime} .1592622.1592-dc21
00 033846 00 033846 00-03384600-03384600033846
ISBN 0-931830-46- X X XXX (Series)
ISBN 1-56080-094-1 (Set)
ISBN 1-56080-098-4 (Volume I)
ISBN 1-56080-099-2 (Volume II)
(C)2001 Society of Exploration Geophysicists.
All rights reserved. This book in two volumes or parts hereof may not be reproduced in any form whatsoever without prior permission in writing from the publisher.
First Edition Published in 1987 with the title
Sewmtc Data Processing and
Second Edition Published in 2001 by
Society of Exploration Geophysicists
P. O. Box 702740
Tulsa, OK 74170-2740
USA
Printed in the United States of America
To Mother In Memoriam
TABLE OF CONTENTS
PREFACE TO THE FIRST EDITION
PREFACE
Volume I
INTRODUCTION
Processing of Seismic Data, 4
Inversion of Seismic Data, 10
Interpretation of Seismic Data, 18
From Seismic Exploration to Sejsmic Monitoring, 22

Chapter 1
FUNDAMENTALS OF SIGNAL PROCESSING

1.0 Introduction, 25
1.1 The 1-D Fourier Transform, 26
Analog versus Digital Signal, 28
Frequency Aliasing, 30
Phase Considerations, 34
Time-Domain Operations, 36
Convolution, 38
Crosscorrelation and Autocorrelation, 39
Vibroseis Correlation, 41
Frequency Filtering, 41
Practical Aspects of Frequency Filtering, 44
Bandwidth and Vertical Resolution, 46
Time-Variant Filtering, 48
1.2 The 2-D Fourier Transform, 48
Spatial Aliasing, 51
1.3 Worldwide Assortment of Shot Records, 67
Wave Types, 70
1.4 Gain Applications, 81
Geometric Spreading Correction, 81
Programmed Gain Control, 85
RMS Amplitude AGC, 85
Instantaneous AGC, 87
Relative Trace Balancing, 89
1,5 Basic Data Processing Sequence, 90
Preprocessing, 91
Deconvolution, 92
CMP Sorting, 93
Velocity Analysis, 93
Normal-Moveout Correction, 94
Multiple Attenuation, 94
Dip-Moveout Correction, 94
CMP Stacking, 95
Poststack Processing, 95
Migration, 95
Residual Statics Corrections, 122
Quality Control in Processing, 122
Parsimony in Processing, 124
Exercises, 150
Appendix A: A Mathematical Review of the Fourier Transform, 153
A. 1 The 1-D Fourier Transform, 153
A. 2 The z z zzz-Transform, 155
A. 3 The 2-D Fourier Transform, 156
References, 156

Chapter 2
DECONVOLUTION

2.0 Introduction, 159
2.1 The Convolutional Model, 162
The Convolutional Model in the Time Domain, 167
The Convolutional Model in the Frequency Domain, 170
2.2 Inverse Filtering, 171
The Inverse of the Source Wavelet, 172
Least-Squares Inverse Filtering, 173
Minimum Phase, 175
2.3 Optimum Wiener Filters, 179
Spiking Deconvolution, 180
Prewhitening, 181
Wavelet Processing by Shaping Filters, 183
Predictive Deconvolution, 185
2.4 Predictive Deconvolution in Practice, 190
Operator Length, 190
Prediction Lag, 193
Percent Prewhitening, 203
Effect of Random Noise on Deconvolution, 207
Multiple Attenuation, 209
2.5 Field Data Examples, 211
Prestack Deconvolution, 213
Signature Deconvolution, 217
Vibroseis Deconvolution, 219
Poststack Deconvolution, 222
2.6 The Problem of Nonstationarity, 222
Time-Variant Deconvolution, 227
Time-Variant Spectral Whitening, 231
Frequency-Domain Deconvolution, 233
Inverse Q Q QQQ Filtering, 234
Deconvolution Strategies, 241
Exercises, 247
Appendix B: Mathematical Foundation of Deconvolution, 249
B. 1 Synthetic Seismogram, 249
B. 2 The Inverse of the Source Wavelet, 251
B. 3 The Inverse Filter, 252
B. 4 Frequency-Domain Deconvolution, 253
B. 5 Optimum Wiener Filters, 255
B. 6 Spiking Deconvolution, 258
B. 7 Predictive Deconvolution, 260
B. 8 Surface-Consistent Deconvolution, 262
B. 9 Inverse Q Q QQQ Filtering, 266
References, 270

Chapter 3
VELOCITY ANALYSIS AND STATICS CORRECTIONS

3.0 Introduction, 271
3.1 Normal Moveout, 274
NMO for a Flat Reflector, 274
NMO in a Horizontally Stratified Earth, 280
Fourth-Order Moveout, 280
NMO Stretching, 283
NMO for a Dipping Reflector, 285
NMO for Several Layers with Arbitrary Dips, 287
Moveout Velocity versus Stacking Velocity, 288
3.2 Velocity Analysis, 288
The Velocity Spectrum, 292
Measure of Coherency, 295
Factors Affecting Velocity Estimates, 302
Interactive Velocity Analysis, 311
Horizon Velocity Analysis, 312
Coherency Attribute Stacks, 318
3.3 Residual Statics Corrections, 324
Residual Statics Estimation by Traveltime Decomposition, 336
Residual Statics Estimation by Stack-Power Maximization, 344
Traveltime Decomposition in Practice, 345
Maximum Allowable Shift, 346
Correlation Window, 361
Other Considerations, 362
Stack-Power Maximization in Practice, 365
3.4 Refraction Statics Corrections, 370
First Breaks, 374
Field Statics Corrections, 375
Flat Refractor, 375
Dipping Refractor, 377
The Plus-Minus Method, 377
The Generalized Reciprocal Method, 379
The Least-Squares Method, 379
Processing Sequence for Statics Corrections, 381
Model Experiments, 382
Field Data Examples, 395
Exercises, 432
Appendix C: Topics in Moveout and Statics Corrections, 437
C. 1 The Shifted Hyperbola, 437
C. 2 Moveout Stretch, 439
C. 3 Equations for a Dipping Refector, 441
C. 4 Traveltime Decomposition for Residual Statics Estimation, 442
C. 5 Depth Estimation from Refracted Arrivals, 444
C. 6 Equations for a Dipping Refractor, 445
C. 7 The Plus-Minus Times, ..... 447
C. 8 Generalized Linear Inversion of Refracted Arrivals, ..... 448
C. 9 Refraction Traveltine Tomography, ..... 453
C. 10 L 1 10 L 1 10L_(1)10 L_{1}10L1-Norm Refraction Statics 1 1 _(1){ }_{1}1 ..... 456
References, 460
Chapter 4
MIGRATION
4.0 Introduction, 463
Exploding Reflectors, 467
Migration Strategies, 470
Migration Algorithms, 471
Migration Parameters, 474
Aspects of Input data, 475
Migration Velocities, 475
4.1 Migration Principles, 476
Kirchhoff Migration, 481
Diffraction Summation, 484
Amplitude and Phase Factors, 485
Kirchhoff Summation, 4 8 5 4 8 5 485\mathbf{4 8 5}485
Finite-Difference Migration, 486
Downward Continuation, 486
Differencing Schemes, 488
Rational Approximations for Implicit Schemes, 489
Reverse Time Migration, 491
Frequency-Space Implicit Schemes, 492
Frequency-Space Explicit Schemes, 493
Frequency-Wavenumber Migration, 494
Phase-Shift Migration, 498
Stolt Migration, 500
Summary of Domains of Migration Algorithms, 501
4.2 Kirchhoff Migration in Practice, 502
Aperture Width, 502
Maximum Dip to Migrate, 509
Velocity Errors, 509
4.3 Finite-Difference Migration in Practice, 520
Depth Step Size, 521
Velocity Errors, 525
Cascaded Migration, 525
Reverse Time Migration, 530
4.4 Frequency-Space Migration in Practice, 530
Steep-Dip Implicit Methods, 535
Depth Step Size, 537
Velocity Errors, 544
Steep-Dip Explicit Methods, 549
Dip Limits of Extrapolation Filters, 549
Velocity Errors, 552
4.5 Frequency-Wavenumber Migration in Practice, 559
Maximum Dip to Migrate, 559
Depth Step Size, 566
Velocity Errors, 567
Stolt Stretch Factor, 572
Wraparound, 575
Residual Migration, 575
4.6 Further Aspects of Migration in Practice, 579
Migration and Spatial Aliasing, 581
Migration and Random Noise, 619
Migration and Line Length, 621
Migration from Topography, 626
Exercises, 626
Appendix D: Mathematical Foundation of Migration, 628
D. 1 Wavefield Extrapolation and Migration, 628
D. 2 Stationary Phase Approximations, 638
D. 3 The Parabolic Approximation, 639
D. 4 Frequency-Space Implicit Schemes, 641
D. 5 Stable Explicit Extrapolation, 644
D. 6 Optimum Depth Step, 646
D. 7 Frequency-Wavenumber Migration, 649
D. 8 Residual Migration, 651
References, 652

Chapter 5
DIP-MOVEOUT CORRECTION AND PRESTACK MIGRATION

5.0 Introduction, 655

Salt-Flank Reflections, 657
Fault-Plane Reflections, 657
DMO and Stacking Velocities, 657
Turning-Wave Refiections, 665
5.1 Principles of Dip-Moveout Correction, 668
Prestack Partial Migration, 670
Frequency-Wavenumber DMO Correction, 672
Log-Stretch DMO Correction, 677
Integral DMO Correction, 679
Velocity Errors, 681
Variable Velocity, 684
Turning-Wave Migration, 685
5.2 Dip-Moveout Correction in Practice, 692
Salt Flanks, 692
Fault Planes, 693
DMO and Mutiples, 705
DMO and Coherent Linear Noise, 716
Other Considerations, 716
Aspects of DMO Correction A Summary, 722
5.3 Prestack Time Migration, 725
DMO Correction and Common-Offset Migration, 728
Salt Flanks, 729
Fault Planes, 742
Common-Reflection-Point versus Common-Refection-Surface Stacking, 769
5.4 Migration Velocity Analysis, 775
Prestack Stolt Migration, 776
Common-Offset Migration of DMO-Corrected Data, 777
Prestack Kirchhoff Migration, 788
Velocity Analysis Using Common-Reflection-Point Gathers, 788
Focusing Analysis, 798
Fowler's Velocity-Independent Prestack Migration, 803
Exercises, 815
Appendix E: Topics in Dip-Moveout Correction and Prestack Time Migration, 817
E. 1 Reflection Point Dispersal, 817
E. 2 Equations for DMO Correction, 820
E. 3 Log-Stretch DMO Correction, 823
E. 4 The DMO Ellipse, 826
E. 5 Nonzero-Ofset Traveltime Equation, 827
E. 6 Prestack Frequency-Wavenumber Migration, 831
E. 7 Velocity Analysis by Wavefield Extrapolation, 833
References, 834

Chapter 6
NOISE AND MULTIPLE ATTENUATION

6.0 Introduction, 837
Coherent Linear Noise, 838
Treatment of Coherent Linear Noise by Conventional Processing, 840
Reverberations and Multiples, 843
Treatment of Reverberations and Multiples by Conventional Processing, 857
Spatially Random Noise, 876
6.1 Multiple Attenuation in the CMP Domain, 877
Periodicity of Multiples, 877
Velocity Discrimination Between Primaries and Multiples, 887
Karhunen-Loeve Transform, 887
Modeing of Multiples, 896
6.2 Frequency-Wavenumber Filtering, 898
Random Noise and Frequency-Wavenumber Filtering, 904
Statics Corrections and Frequency-Wavenumber Filtering, 905
Dip Filtering of Coherent Linear Noise, 905
Frequency-Wavenumber Multiple Attenuation, 907
6.3 The Slant-Stack Transform, 920
Physical Aspects of Slant Stacking, 920
Slant-Stack Transformation, 923
Practical Aspects of Slant Stacking, 924
Slant-Stack Parameters, 928
Time-Variant Dip Filtering, 931
Slant-Stack Multiple Attenuation, 932
6.4 The Radon Transform, 938
Velocity-Stack Transformation, 942
The Discrete Radon Transform, 943
The Parabolic Radon Transform, 944
Practical Considerations, 945
Impulse Response of the Velocity-Stack Operator, 948
Field Data Examples, 948
Radon-Transform Multiple Attenuation, 953
6.5 Linear Uncorrelated Noise Attenuation, 960
Design of Spatial Prediction Filters, 966
Field Data Examples, 966
Exercises, 976
Appendix F: Multichannel Filtering Techniques for Noise and Multiple Attenuation, 97T
F. 1 Analysis of Guided Waves, 977
F. 2 Wavefield Extrapolation in the τ p τ p tau-p\tau-pτp Domain, 980
F. 3 Mathematical Foundation of the Discrete Radon Transform, 982
F. 4 Free-Surface Multiple Attenuation, 989
F. 5 Water-Bottom Multiple Attenuation, 992
F. 6 Spatial Prediction Filter, 995
References, 998
INDEX, xXv

Volume II
Chapter 7
3-D SEISMIC EXPLORATION

7.0 Introduction, 1001

The Need for Imaging in Three Dimensions, 1003
7.1 3-D Survey Design and Acquisition, 1010
Migration Aperture, 1010
Spatial Sampling, 1017
Other Considerations, 1018
Marine Acquisition Geometry, 1018
Cable Feathering, 1019
3-D Binning, 1019
Crossline Smearing, 1020
Strike versus Dip Shooting, 1027
Land Acquisition Geometry, 1028
7.2 Processing of 3-D Seismic Data, 1030
3-D Refraction Statics Corrections, 1036
Azimuth Dependence of Moveout Velocities, 1036
3-D Dip-Moveout Correction, 1046
Inversion to Zero Offset, 1048
Aspects of 3-D DMO Correction A Summary, 1050
Velocity Analysis, 1050
3-D Residual Statics Corrections, 1050
3-D Migration, 1051
Trace Interpolation, 1065
7.3 3-D Poststack Migration, 1073
Separation versus Splitting, 1073
Inpulse Response of the One-Pass Implicit Finite-Difference 3-D Migration, 1074
Two-Pass versus One-Pass Implicit Finite-Difference 3-D Migration in Practice, 1076
Explicit Schennes Combined with the McClellan Transform, 1082
The Phase-Shift-Plus-Correction Method, 1088
7.4 3-D Prestack Time Migration, 1099
3-D DMO Correction Combined with 3-D Common-Offset Migration, 1112
Crossline Migration, 1129
3-D Migration Velocity Analysis, 1131
Aspects of 3-D Prestack Time Migration - A Summary, I137
7.5 Interpretation of 3-D Seismic Data, 1156
Time Slices, 1156
3-D Visualization, 1156
Removal of Opacity, 1158
Seed Detection, 1159
Structural Interpretation, 1161
Stratigraphic Interpretation, I171
Exercises, 1195
Appendix G: Mathematical Foundation of 3-D Migration, 1198
G. 1 Implicit Methods, 1198
G. 2 Explicit Methods, 1200
G. 3 3-D Phase-Shift Migration, 1203
G. 4 3-D Stolt Migration, 1204
G. 5 Trace Interpolation, 1204
G. 6 3-D Nonzero-Offset Traveltime Equation, 1208
References, 1209

Chapter 8
EARTH IMAGING IN DEPTH

8.0 Introduction, 1213
Lateral Velocity Variations, 1222

8.1 Layer Replacement, 1226
Wave-Equation Datuming, 1229
Poststack Layer Replacement, 1230
Prestack Layer Replacement, I231
Field Data Example, 1237
8.2 2-D Poststack Depth Migration, 1238
Image Rays and Lateral Velocity Variations, 1238
Time versus Depth Migration, 1244
Iterative Depth Migration, 1247
Iteration with Zero-Offset Data, 1250
Iteration with CMP-Stacked Data, 1258
Iteration with Prestack Data, 1265
Iteration in Practice, 1265
8.3 2-D Prestack Depth Migration, 1273
Shot-Geophone Migration, 1274
Shot-Profile Migration, 1280
Sensitivity of Image Accuracy to Velocity Errors, 1280
Field Data Examples, 1295
8.4 3-D Poststack Depth Migration, 1304
3-D Poststack Time versus Depth Migration, 1304
Two-Pass versus One-Pass 3-D Poststack Depth Migration, 1313
Implicit versus Explicit 3-D Poststack Depth Migration, 1314
3-D Poststack Datuming, 1321
8.5 3-D Prestack Depth Migration, 1321
Kirchhoff Summation, 1324
Calculation of Traveltimes, 1324
The Eikonal Equation, 1325
Fermat's Principle, 1331
Summation Strategies, 1331
Migration Aperture, 1333
Operator Antialiasing, 1333
3-D Common-Ofiset Depth Migration, 1335
Exercises, 1342
Appendix H: Diffraction and Ray Theory for Wave Propagation, 1342
H. 1 The Kirchhoff Integral, 1342
H. 2 The Eikonal Equation, 1346
H. 3 Finite-Difference Solution to the Eikonal Equation, 1349
References, 1351

Chapter 9
EARTH MODELING IN DEPTH

9.0 Introduction, ..... 1353
Inversion Methods for Data Modeling, 135
Inversion Procedures for Earth Modeling, 1356
Velocity-Depth Ambiguity, ..... 1357
Model Representation and Visualization, ..... 1360
9.1 Models with Horizontal Layers, ..... 1365
Dix Conversion, ..... 1365
Coherency Inversion, ..... 1369
Near-Surface Layer with Laterally Varying Velocities, ..... 1382
9.2 Model with Low-Relief Structure, 138
Stacking Velocity Inversion, 1392
Coherency Inversion, 1404
Velocity Resolution, 1404
9.3 Model with Complex Overburden Structure, 1404
Image-Gathers, 1406
Constant Half-Space Velocity Analysis, ..... 1415
9.4 Model Building, 1415
Time-to-Depth Conversion, I416
Time Structure Maps, ..... 1416
Interval Velocity Maps, ..... 1417
Depth Structure Maps, 142
Calibration to Well Tops, ..... 1426
Layer-by-Layer Inversion, ..... 1433
Structure-Independent Inversion, 1 ..... 1450
9.5 Model Updating, ..... 1450
Residual Moveout Analysis, 1462
Reflection Traveltime Tomography, 1469
Limitations in Resolving Velocity-Depth Ambiguity by Tomography, 1479
Turning-Ray Tomography, 1512
Exercises, 1524
Appendix J: Data Modeling by Inversion, 1525
J. 1 The Generalized Linear Inversion, 1525
J. 2 The GLI Formalisn of Deconvolution, 1526
J. 3 Applications of the GLI Technique, 1530
J. 4 Dix Conversion, 1534
J. 5 Map Processing, 1539
J. 6 Reflection Traveltime Tomography, 1545
J.7 Threshold for Velocity-Depth Ambiguity, 1553
References, 1554
Chapter 10
STRUCTURAL INVERSION
10.0 Introduction, 1557
10.1 Subsalt Imaging in the North Sea, ..... 1558
Estimation of the Overburden Model, 1562
Estimation of the Substratum Model, 1562
Model Verification, 1563
10.2 Subsalt Imaging in the Gulf of Mexico, 1574
Layered Earth Model Estimation, 1574
Structure-Independent Model Estimation, 1577
10.3 Imaging Beneath Irregular Water Bottom in the Northwest Shelf of Australia, 1597
Earth Modeling and Innaging in Depth, I597
10.4 Imaging Beneath Volcanics in the West of Shetlands of the Atlantic Margin, 1597 Earth Modeling and Imaging in Depth, 1607
10.5 Imaging Beneath Shallow Gas Anomalies in the Gulf of Thailand, 1620 Earth Modeling and Imaging in Depth, 1620
10.6 3-D Structural Inversion Applied to Seismic Data from the Southern North Sea, 1626 Estimation of the Overburden Model, 1626
Model Representation by Tessellation, 1630
3-D Coherency Inversion, 1630
3-D Poststack Depth Migration, 1637
Estimation of the Substratum Model, 1638
10.7 3-D Structural Inversion Applied to Seismic Data from the Central North Sea, 1651
3-D Coherency Inversion Combined with 3-D Poststack Depth Migration, 1665
3-D Stacking Velocity Inversion Combined with 3-D Image-Ray Depth Conversion, 1674
10.8 3-D Structural Inversion Applied to Seismic Data from Offshore Indonesia, 1674
Model Building, 1678
Model Updating, 1678
Imaging in Depth, 1690
Volume-Based Interpretation, 1690
10.9 3-D Structural Inversion Applied to Seismic Data from the Northeast China, 1703
3-D DMO Processing, 1720
3-D Prestack Time Migration, 1720
From RMS to Interval Velocities, 1742
Structural Inversion, 1742
Structural and Stratigraphic Interpretation, 1744
Exercises, 1778
Appendix K: Seismic Modeling, 1779
K. 1 Zero-Ofset Traveltime Modeling 1779
K. 2 Zero-Offset Wavefield Modeling, 1781
K. 3 Nonzero-Offset Wavefield Modeling, 1781
K. 4 Elastic Wavefield Modeling, 1790
References, 1792

Chapter 11 RESERVOIR GEOPHYSICS

11.0 Introduction, 1793
Elastic Waves and Rock Properties, 1794
11.1 Seismic Resolution, 1801
Vertical Resolution, 1801
Lateral Resolution, 1803
11.2 Analysis of Amplitude Variation with Offset, 1807
Reflection and Refraction, 1808
Reflector Curvature, 1813
AVO Equations, 1816
Processing Sequence for AVO Analysis, 1839
Derivation of AVO Attributes by Prestack Amplitude Inversion, 1851
Interpretation of AVO Attributes, 1862
3-D AVO Analysis, 1863
11.3 Acoustic Impedance Estimation, 1863
Synthetic Sonic Logs, 1864
Processing Sequence for Acoustic Impedance Estimation, 1865
Derivation of Acoustic Impedance Attribute, 1866
3-D Acoustic Impedance Estimation, 1872
Instantaneous Attributes, 1896
11.4 Vertical Seisinic Profiling, 1907
VSP Acquisition Geometry, 1907
Processing of VSP Data, 1907
VSP-CDP Transform, 1908
11.5 4-D Seismic Method, 1911
Processing of 4-D Seismic Data, 1912
Seismic Reservoir Monitoring, 1913
11.6 4-C Seismic Method, 1915
Recording of 4-C Seismic Data, 1919
Gaiser's Coupling Analysis of Geophone Data, 1922
Processing of PP Data, 1926
Rotation of Horizontal Geophone Components, 1926
Common-Conversion-Point Binning, 1933
Velocity Analysis of PS Data, 1946
Dip-Moveout Correction of PS Data, 1959
Migration of PS Data, 1961
11.7 Seismic Anisotropy, 1961
Anisotropic Velocity Analysis, 1965
Anisotropic Dip-Moveout Gorrection, 1968
Anisotropic Migration, 1980
Effect of Anisotropy on AVO, 1998
Shear-Wave Splitting in Anisotropic Media, 1999
Exercises, 2000
Appendix L: Mathematical Foundation of Elastic Wave Propagation, 2001
L. 1 Stress-Strain Relation, 2001
L. 2 Elastic Wave Equation, 2007
L. 3 Seisnic Wave Types - Body Waves and Surface Waves, 2008
L. 4 Wave Propagation Phenomena Diffraction, Reflection, and Refraction, 2012
L. 5 The Zoeppritz Equations, 2014
L. 6 Prestack Amplitude Inversion, 2019
References, 2024
INDEX, XXV

PREFACE TO THE FIRST EDITION

The seismic method plays a prominent role in the search for hydrocarbons. Seismic exploration consists of three main stages: data acquisition, processing, and interpretation. This book is intended to help the seismic analyst understand the fundamentals of the techniques used in processing seismic data. In particular, emphasis is given to the practical aspects of data analysis.
Topics in this book are treated in two phases. First, each process is described from a physical viewpoint, with less emphasis on mathematical development. In doing so, geometric means are used extensively to help the reader gain the physical insight into the different processes. Second, the geophysical parameters that affect the fidelity of the resulting output from each process are critically examined via an extensive series of synthetic and real data examples. For the student of reflection seismology and new entrants to the seismic industry, this book tries to provide insights into the practical aspects of the application of the theory of time series and waves. For experienced seismic explorationists, this book should serve as a refresher and handy reference. However, it is not just meant for the seismic analyst. Explorationists who would like to gain a practical background in seismic data processing without any mathematical burden also should benefit from it. Nevertheless, for the more theoretically inclined, a mathematical treatise on the main subjects is provided in the appendixes.
The seismic analyst is confronted daily with the important tasks of:
(1) selecting a proper sequence of processing steps appropriate for the field data under consideration,
(2) selecting an appropriate set of parameters for each processing step, and
(3) evaluating the resulting output from each processing step, then diagnosing any problems caused by improper parameter selection.
There is a well-established sequence for standard seimic data processing. The three principal processes deconvolution, stacking, and migration make up the foundation of routine processing. There also are some auxiliary processes that help improve the effectiveness of the principle processes. Questions often arise as to the kind of auxiliary processes that should be used and when they should be applied. For example, if shot records contain an abundance of source-generated coherent noise, then dip filtering may be valuable before deconvolution. Beam steering may be necessary to improve the signal-to-noise ratio while reducing the number of channels in processing by a factor of as much as four. Residual statics corrections often are required for improving velocity estimation and stacking. In a daily production environment, many questions arise concerning the optimal parameter selection for each process. Some of the most repeatedly asked questions are: What is a good length for the deconvolution operator? What should the prediction lag be? What should the design gate for the operator be? How should the correlation window be chosen in residual statics computations? What kind of aperture width should one select in Kirchoff migration? What is the optimum depth step size in finite-difference migration? Many more questions could be included in this list of questions. To help answer these questions, a large number of examples using both field and synthetic data and describing a wide range of processing parameters are provided.
Since the old adage "a picture is worth a thousand words" is especially apt in a discussion of seismic data processing, figures make up the major portion of this textbook. In preparing some of the figures, I received great assistance from my colleagues at Western Geophysical Company. Thanks are due to Darran Lucas, Mike Cox, Greg Godkin, Dave Nichols, Tania Bachus, Tomaso Gabrieli, Dave Hill, and Raphael Tortosa.
Thanks also are due to the oil companies and contractors for supplying data and some figures for which specific acknowledgment is made in the figure captions. I express my deep appreciation to: Soraya Brombacher, Mark Wilson, Wayne Johnson, Mike Jungnickel, and Pam Jakubowicz for the artwork on most of the figures. I also extend my appreciation to Meg LaVergne, who put the final touches on many figures and computerdrafted the flow diagrans. Thanks also to the members of the playback group at Western's London Digital Center: Stephen Blick, John Byrne, Mike Byrne, Chris Godsave, Steven Grace, and Tony Leventis. Sally Humphreys, Jan Mitchell, and Vivian Millson helped key the text into the word processor.
I acknowledge with great appreciation the review work done by Jon Claerbout, Sven Treitel, John Sherwood, Fred Hilterman, and Greg Godkin. I also thank the following individuals who participated in reviewing parts of the earlier drafts: Ron Chambers, Aftab
Alam, Bruce Cassell, Karl Millahn, Tony Kudrna, Dave Brown, Darko Tufekcic, Pete Bibby, John Ferguson, Mark Doyle, Wendell Wiggins, Jeff Resnick, Walt Lynn, Bill Dragoset, Mai Yang, Patrick Ng, Steve Cole, Larry Scott, Ken Larner, and Helmut Jakubowicz. Special thanks are due to Diane Parker, who did an outstanding job of editing for style, proofreading, and preparing the camera-ready copy of the book. Thanks to Lynn Griffin for helping to bring the text up to the SEG standards of publication. Special thanks also are due to my editor, Steve Doherty, for his excellent and comprehensive review, I also appreciate his valuable recommendations in revising the text and the help he provided in bringing clarity to the text. I extend my deepest and wholehearted appreciation to my wife, Hulya, for her everlasting encouragement. And finally, thanks are due to Western Geophysical Company of America for the support provided to me in writing this textbook.

PREFACE

The first edition, entitled Seismuc Data Processing, was published in 1987 by the Society of Exploration Geophysicists. Thereafter, I began to work on the second edition almost immediately. My objective was to capture continuously the new developments that were taking place in the seismic industry. The second edition is the culmination of this continuous update over the past ten years. The updating process was based on exhaustive model- and real-data experiments with the results of the research and development work of my own and many others. I have also drawn an extensive and demonstrative set of real-data examples from the numerous case studies that I conducted during the course of the update. Another source of update was of course the prolific literature on exploration seismology.
This second edition embodies the broad scope of seismic data analysis - processing, inversion, and interpretation of seismic data. I shall give a brief summary of the most important new developments in seismic data analysis during the past 15 years. To begin with, the 3-D seismic method took a centrally dominant position in the exploration and development of oil and gas fields. Algorithms for 3-D seismic data processing, including 3-D dip-moveout correction, 3-D refraction and residual statics corrections, and 3-D migration have now become an integral part of the applications library of the seismic data processing systems in use today. Additionally, noise attenuation based on prediction filtering is now applied routinely to seismic data. Techniques for multiple attenustion based on the Radon transform and wave extrapolation have been successfully demonstrated on field data.
Shortly after 3-D migration, we also began to image the subsurface before stacking. Efficient workfiows for 3 -D prestack time migration are in use today not only to image the subsurface more accurately in the presence of conflicting dips with different stacking velocities but also to generate common-reflection-point gathers that can be used to perform prestack amplitude inversion and thus obtain attributes associated with amplitude variations with offset. 3 -D prestack time migration also paves the way for estimating a 3 D r m s 3 D r m s 3-Drms3-\mathrm{D} \mathrm{rms}3Drms velocity field that can be used to perform Dix conversion and thus obtain a 3-D interval velocity field.
Concurrent with prestack imaging, we began to image the subsurface also in depth to account for strong lateral velocity variations. During the last decade, years of effort in research and development conducted in previous decades have led to practical inversion methods for earth modeling and imaging in depth. Using appropriate inversion methods, we derive a seismic representation of an earth model in depth, described by two sets of parameters layer velocities and reflector geometries, for low-relief, complex, and complex overburden structures. The power of 3-D visualization has given us the ability to create an earth model in depth with the accuracy needed to image in depth, and that within an efficient work schedule. Additionally, the rapid growth in computer power has enabled us to generate an earth image in depth from 3-D prestack depth migration of large data volumes, again within acceptable work schedules.
To get the most out of the image volumes derived from 3-D prestack time and depth migrations, we now make extensive use of 3 D 3 D 3-D3-D3D visualization in seismic interpretation. Using a volume-based interpretation strategy, not only do we pick time or depth horizons to delineate the structural model of the subsurface, but we also make use of the seismic amplitudes to infer the depositional model of the subsurface.
The road ahead for exploration seismology includes three main topics 4-D seismic method, 4-C seismic method, and anisotropy, all aimed at seismic characterization of oil and gas reservoirs and eventually monitoring their depletions. By recording 3-D seismic data over the field that is being developed and produced at appropriate time intervals, we may detect changes in the reservoir conditions, such as fluid saturation and
pore pressure. Such changes may be related to changes in the seismic amplitudes from one 3-D survey to the next. Time-lapse 3-D seismic monitoring of reservoirs is referred to as the 4-D seismic method. The fourth dimension represents the calendar time over which the reservoir is being monitored. Potential applications of the 4-D seismic method include monitoring the spatial extent of the steam front following in-situ combustion or steam injection used for thermal recovery, monitoring the spatial extent of the injected water front used for secondary recovery, imaging bypassed oil, determining flow properties of sealing or leaking faults, and detecting changes in oil-water contact.
Some reservoirs can be identified and monitored better by using shear-wave data. For instance, acoustic impedance contrast at the top-reservoir boundary may be too small to detect, whereas shear-wave impedance contrast may be sufficiently large to detect. By recording multicomponent data at the ocean bottom, P P PPP-wave and S S SSS-wave images can be derived. Commonly, four data components are recorded the pressure wave-field and inline, crossline, and vertical components of particle velocity. Thus, the multicomponent seismic data recording and analysis is often referred to as the 4 C C CCC seismic method. Potential applications of the 4-C sejsmic method include imaging beneath gas plumes, salt domes, and basalts, delineating reservoir boundaries with a higher S S SSS-wave impedance contrast than P P PPP-wave impedance contrast, differentiating sand from shale, detection of fluid phase change from oil-bearing to water-bearing sands detection of vertical fracture orientation, mapping hydrocarbon saturation, and mapping oil-water contact.
Until recently, exploration sejsmology at large has been based on the assumption of an isotropic medium, albeit we have been cognizant of anisotropic behavior of reservoir rocks. Seismic anisotropy often is associated with directional variations in velocities. For instance, in a vertically fractured limestone reservoir, velocity in the fracture direction is lower than velocity in the direction perpendicular to the plane of fracturing, giving rise to azimuthal anisotropy. Another directional variation of velocities involves horizontal layering and fracturing of rocks parallel to the layering. In this case, velocity in the horizontal direction is higher than the vertical direction, giving rise to transverse isotropy.
In addition to a continuing effort to improve the existing 3-D time- and depth-domain applications, current research and development in seismic data analysis is focused on time- and depth-domain analysis of 4-D and 4-C seismic data while accounting for anisotropy.
Topics in this book are organized to reflect the increasing degree of complexity in the data analysis and the progress made in exploration seismology. Volume
I is devoted to 2 D 2 D 2-D2-\mathrm{D}2D conventional processing based on the three principle processes deconvolution, stacking, and migration. Volume I is devoted to topics beyond 2-D conventional processing 3-D seismic exploration, seismic inversion for earth modeling and imaging in depth, 4-D seismic method, 4-C seismic method, and anisotropy. Each chapter is accompanied by an appendix that includes a mathematical treatise of selected topics from the chapter itself. As such, practical aspects of seismic data analysis are treated within the chapters themselves without the burden of the theoretical details.
When used as a textbook in a university, I recommend Volume I for a first-semester senior-level course and Volume II for a second-semester senior-level course or a first-year graduate course. Optionally, you may consider an additional one-semester senior- or graduatelevel course on the applied theory of exploration seismology besed on primarily the appendixes.
If you are a seismic analyst using this book as a reference, you can study the practical aspects of seismic data analysis in relation to the projects you are conducting to get helpful hints on the algorithms and workflows. If you are a research geophysicist using this book as a reference, you can study the practical aspects of a specific application of interest to get helpful hints on what assumptions can be made in relation to that application. Also, you can study the appendixes to initiate yourself into the basic theory on the subject of your interest.
I have a passion for the seismic method that I have maintained throughout my career. While the source of this passion is indisputably my teacher and life-long friend, Jon Claerbout, I have been very fortunate to have worked with some of the most talented individuals who have fueled my enthusiasm for exploration seismology. Most appropriately, I wish to express here my heartful gratitudes to each of these individuals.
To begin with, I am deeply grateful to Steve Doherty, my technical editor and life-long friend, for his incisive, meticulous, and prompt editing of this entire work. Steve's editing brought clarity and precision to the text. He was also the editor of the first edition; on that occasion and now, he gracefully shared the experience with me. Thank you, Steve, for your dedication and effort. As part of the technical editing, I also received great assistance from Zhiming L i L i Li\mathrm{Li}Li, who edited Appendices A through J, Joe Stefani who edited Appendix L, and John Toldi who edited Chapter 11. I thank ail of you wholeheartedly for your careful editing of the text t z t z t_(z)\mathrm{t}_{\mathrm{z}}tz debugging the equations, and introducing clarity to derivations.
Next, I wish to express my sincere gratitude to Judy Hastings, my technical copy editor, for her impressively consistent editing of the entire manuscript
and her diligence in keeping me on schedule. Thank you, Judy, also for your graceful handling of my frustrations with thes and as. I wish to extend my thanks to Ted Bakamjian, Publications Manager of SEG, for his sup port and excellent coordination of the tasks involved in the publication process.
Now I wish to extend my special thanks to Cyril Gregory, Irfan Tanritanir, Ferudun Kilic, Orhan Yilmaz, Fugen Zhou, Ma Xae Ling, and Huseyin Ozdemir, who helped me with several of the case studies, and model- and real-data experiments. Specifically, Cyril helped me create the case studies for my 1996 SEG Distinguished Lecture Tour; these case studies are included in Chapter 10. Cyril has been involved in many of the projects over the past ten years associated with this work. Irfan, Ferudun, and Fugen all worked with me on several case studies which are also included in Chapter 10. Orhan did the processing of the 4-C data presented in Chapter 11. I feel very fortunate to have had such exceptionally talented individuals helping me to bear the burden.
I wish to extend my special thanks to David Lumley, 4th Wave Imaging, and Chevron for contributing examples to the section on 4-D seismic method. I wish to express my sincere appreciation to Moshe Reshef for creating some of the synthetic data sets I used in my experiments described in Chapters 3 and 8 . Likewise, I extend my sincere gratitude to Evgeny Landa for cre- ating the synthetic data sets I used in my experiments described in Chapter 9. Extending the list, I express my thanks to Ed Crase, Chris Taylor, Dave Nichols, Duane Dopkin, Gerald Kidd, Rob Bond, Cerys Biancardi, Davud Babayev, and Lee Bell for providing examples or helping me create them. I am sure that I am unable to recall many of the names associated with the update going back ten years; I thank all of you most sincerely.
I am very grateful to Chevron, Mobil, Britannia, Talisman, Husky Oil, BP-Amoco, Shell, AGIP, Total, BHP, Gulf Canada, ONGC, Shengli Oil Field of CNPC, Saudi Aramco, and many other companies who may or may not have preferred to be anonymous for providing field dat a that enabled me to conduct my experiments.
I wish to sincerely thank Damir Skerl and Western Geophysical, Rutt Bridges and Landmark, Schlumberger Geco-Prakla, Walt Lynn and PGS, and especially Eldad Weiss and Paradigm Geophysical for their most invaluable support and encouragement in my quest to complete this work.
And now the last word, but a special tribute to my wife, Hulya, and my son, Esen. I am wholeheartedly grateful to you both for your enduring love and support. This work undoubtedly demanded sacrifice; and it was definitely a sacrifice on your part. You demanded very little of me, and you gave the whole of your love to me. I shall cherish it all my life.

INTRODUCTION

- Processing of Seismic Data - Inversion of Seismic Data - Interpretation of Seismic Data

  • From Seismic Exploration to Seismic Monitoring
The Classtcal Greeks had a love for wisdom It came down to us as philo sophta.
And I have a passion for the seismic method Let this be an ode to philo setsmos. O O OOO how sweet it is Listening to the echos from the earth.
The seismic method has three principal applications:
(a) Delineation of near-surface geology for engineering studies, and coal and mineral exploration within a depth of up to 1 k m 1 k m 1km1 \mathrm{~km}1 km : The seismic method applied to the near-surface studies is known as engineerng seismology.
(b) Hydrocarbon exploration and development within a depth of up to 10 k m 10 k m 10km10 \mathrm{~km}10 km : The seismic method applied to the exploration and development of oil and gas fields is known as exploration seismology.
(c) Investigation of the earth's crustal structure within a depth of up to 100 k m 100 k m 100km100 \mathrm{~km}100 km : The seismic method applied to the crustal and earthquake studies is known as earthquake sersmology.
This book is devoted to application of the reflection seismic method to the exploration and development of oil and gas fields.
Conventional processing of reflection seismic data yields an earth image represented by a seismic section which usually is displayed in time. Figure I-1 shows a seismic section from the Gulf of Mexico, nearly 40 k m 40 k m 40km40 \mathrm{~km}40 km in length. Approximate depth scale indicates a sedimentary section of interbedded sands and shales down to 8 k m k m km\mathrm{km}km. Note from this earth image a salt sill embedded in the sedimentary sequence. This allocthonous salt sill has a rugose top and a relatively smooth base. Note the folding and faulting of the sedimentary section above the salt.
The reflection seisnic method has been used to delineate near-surface geology for the purpose of coal and mineral exploration and engineering studies, especially in recent years with increasing acceptance. Figure I-2a shows a seismic section along a 500 m 500 m 500-m500-\mathrm{m}500m traverse across a bedrock valley with steep flanks. The lithologic column based on borehole data indicates a sedimentary sequence of clay, sand, and gravel deposited within the valley. The bedrock is approximately 15 m 15 m 15m15 \mathrm{~m}15 m below the surface at the fringes of the valley and 65 m 65 m 65m65 \mathrm{~m}65 m below the surface at the bottom of the valley. The strong reflection at the sediment-bedrock boundary is a result of the contrast between the low-velocity sediments above and the high-velocity Precambrian quartz pegmatite below.
The reflection seismic method also has been used to delineate the crustal structure down to the Moho

(a)
(b)
FIG. 1-2. (a) A shallow reflection seismic section from Ontario (Pullan and Hunter, 1990), and (b) a deep reflection selsmic section from southeast Turkey (Yilmaz, 1976).
discontinuity and below. Figure I-2b shows a seismic section recorded on land along a 15 k m 15 k m 15-km15-\mathrm{km}15km traverse. Based on regional control, it is known that the section consists of sediments down to about 4 k m 4 k m 4km4 \mathrm{~km}4 km. The reflection event at 6.5 7 s 6.5 7 s 6.5-7s6.5-7 \mathrm{~s}6.57 s, which corresponds to a depth range of 15 20 15 20 15-2015-201520 k m k m km\mathrm{km}km, can be postulated as the crystalline basement. The group of reflections between 8-10 s, which corresponds to a depth range of 25 35 k m 25 35 k m 25-35km25-35 \mathrm{~km}2535 km, represents a transition zone in the lower crust most likely, the Moho discontinuity, itself.
Common-midpoint (CMP) recording is the most widely used seismic data acquisition technique. By providing redundancy, measured as the fold of coverage in the seismic experiment, it improves signal quality. Figure I-3 shows seismic data collected along the same traverse in 1965 with single-fold coverage and in 1995 with twelve-fold coverage. These two different vintages of data have been subjected to different treatments in processing; nevertheless, the fold of coverage has caused the most difference in the signal level of the final sections.
Seismic data processing strategies and results are strongly affected by field acquisition parameters. Additionally, surface conditions have a significant, impact on the quality of data collected in the field. Part of the seismic section shown in Figure I-4 between midpoints A A AAA and B B BBB is over an area covered with karstic limestone. Note the continuous reflections between 2 and 3 s outside the limestone-covered zone. These reflections abruptly disappear under the problem zone in the middle. The lack of events is not the result of a subsurface void of reflectors. Rather, it is caused by a low signal-tonoise (S/N) ratio resulting from energy scattering and absorption in the highly porous surface limestone.
Surface conditions also have an infuence on how much energy from a given source type can penetrate into the subsurface. Figure I-5 shows a seismic section along a traverse over a karstic topography with a highly weathered near-surface. In data acquisition, surface charges have been used to the right of midpoint A A AAA, and charges have been placed in holes to the left of midpoint A A AAA. In the absence of source coupling using surface charges, there is very little energy that can penetrate into the subsurface through the weathered near-surface layer. As a result, note the lack of coherent reflections to the right of midpoint A A AAA. On the other hand, improved source coupling using downhole charges has resulted in better penetration of the energy into the subsurface in the remainder of the section.
Besides surface conditions, environmental and demographic restrictions can have a significant impact on field data quality. The part of the seismic section shown in Figure I-6 between midpoints A and B is through a village. In the village, the vibroseis source was not operated with full power. Hence, not enough energy penetrated into the earth. Although surface conditions were similar along the entire line, the risk of property damage resulted in poor signal quality in the middle portion of the line.
Other factors, such as weather conditions, care taken dusing recording, and the condition of the recording equipment, also influence data quality. Almost always, seismic data are collected often in less-than-ideal conditions. Hence, we can only hope to attenuate the noise and enhance the signal in processing to the extent allowed by the quality of the data acquisition.
In addition to field acquisition parameters, seisrnic data processing results also depend on the techniques used in processing. A conventional processing sequence almost always includes the three principal processes deconvolution, CMP stacking, and migration.

Processing of Seismic data

We begin with a review of the fundamentals of digital signal processing in Chapter 1. Seismic data recorded in digital form by each channel of the recording instrument are represented by a time series. Processing algorithms are designed for and applied to either singlechannel time series, individually, or multichannel time series. The Fourier transform constitutes the foundation of much of the digital signal processing applied to seismic data. Aside from sections on the one- and twodimensional Fourier transforms and their applications, Chapter 1 also includes a section on a worldwide assortment of recorded seismic data. By referring to the field data examples, we examine characteristics of the seismic signal primary reflections from layer boundaries and random and coherent noise such as multiple reflections, reverberations, linear noise associated with guided waves and point scatterers. Chapter 1 concludes with a section on the basic processing sequence and guidelines for quality control in processing.
The next three chapters are devoted to the three principal processes deconvolution, CMP stacking, and migration. We study deconvolution in Chapter 2. Deconvolution often improves temporal resolution by collapsing the seismic wavelet to approximately a spike and suppressing reverberations on some field data (Figure I-7). The problem with deconvolution is that the accuracy of its output may not always be self-evident unless it can be compared with well data. The main reason for this is that our model for deconvolution is nondeterministic in character.
We study the second principal process, CMP stacking in Chapter 3 with the accompanying subjects on velocity analysis, normal-moveout (NMO), and statics
FIG. I-3. (a) A single-fold section obtained in 1965, and (b) a twelve-fold section obtained in 1995 along the same line traverse. (Data courtesy Turkish Petroleum Corp.)
FIG. 1-4. The poor signal between midpoints A A A\mathrm{A}A and B B B\mathrm{B}B on this seismic section is caused by a karstic limestone on the surface.
FIG. I-5. The lack of coherent reflections to the right of midpoint A A AAA on this seismic section results from the surface charges used during recording. By using charges placed in holes below the karstic limestone in the near surface, signal penetration has been improved to the left of midpoint A)
FIG. I-6. A village is situated between midpoints A A AAA and B B BBB. The poor signal in that zone of the selsmic section is caused by operating the vibroseis source at low power.
corrections. Common-midpoint stacking is the most tobust of the three principal processes. By using redundancy in CMP recording, stacking can attenuate uncorrelated noise significantly, thereby increasing the S / N S / N S//N\mathrm{S} / \mathrm{N}S/N ratio (Figure I-3). It also can attenuate a large part of the coherent noise in the data, such as guided waves and multiples.
The normal moveout (NMO) correction before stacking is done using the primary velocity function. Because multiples have larger moveout than primaries, they are undercorrected and, hence, attenuated during stacking (Figure I-8).
The main problem with CMP stacking is that it is based on the hyperbolic moveout assumption. Although it may be violated in areas with severe structural complexities, seismic data acquired in many parts of the world seem to satisfy this assumption reasonably well.
Data acquired on land must be corrected for elevation differences at shot and receiver locations and traveltime distortions caused by a near-surface weathering layer. The corrections usually are in the form of vertical traveltime shifts to a flat datum level (statics corrections). Because of uncertainties in near-surface model estimation, there always remains some residual statics which need to be removed from data before stacking (Figure I-9).
Finally, we study the third principal process, migration, in Chapter 4. Migration collapses diffractions and moves dipping events to their supposedly true subsurface locations (Figure I-10). In other words, migration is an imaging process. Because it is based on the wave equation, migration also is a deterministic process. The migration output often is self-evident you can tell whether the output is migrated properly. When the output is not self-evident, this uncertainty often can be traced to the imprecision of the velocity information available for input to the migration program. Other factors that influence migration results include type of input data two-dimensional (2-D) or three-dimensional (3-D), migration strategies - time or depth, post- or prestack, and algorithms and associated parameters. Two-dimensional migration does not correctly position events with 3 -D orientation in the subsurface. Note the accurate imaging of the erosional unconformity (event A) in Figure I-10. However, this event is intercepted by event B which is most likely associated with the same unconformity, only that it is out-of-the-plane of recording along the line traverse.
Events with conflicting dips require an additional step dip-moveout (DMO) correction, prior to CMP stacking (Figure I-11). Dip-moveout correction is the
FIG. I-7. A selsmic section whthout (top) and with (botton) deconvolution. Note the improved vertical resolution on the deconvolved section as a result of wavelet compression and removal of reverberations. (Data courtesy Enterprise Oil.)
subject for Chapter 5. Conflicting dips with different stacking velocities often are associated with fault blocks and salt flanks. Specifically, the moveout associated with steeply dipping fault-plane reflections or reflections off a salt flank is in conflict with the moveout associated with reflections from gently dipping strata. Foliowing NMO correction, DMO correction is applied to data so as to preserve events with conflicting dips during stacking. Migration of a DMO stack then yields an improved image of fault blocks (Figure I-11) and salt flarks (Figure I-1).
The rigorous solution to the problem of conflicting dips with different stacking velocitjes is migration before stack. Because this topic is closely related to DMO correction, it also is covered in Chapter 5.
We study in Chapter 6 various techniques for attenuating random noise, coherent noise, and multiple reflections. Techniques to attenuate random noise ex- ploit part of the signal uncorrelated from trace to trace. Techniques to attenuate coherent linear noise exploit the linearity in the frequency-wavenumber and slantstack domains. Finally, techniques to attenuate multiples exploit their periodicity in the common-midpoint, slent-stack and velocity-stack domains. Multiples also can be attenuated by using techniques that exploit the velocity discrimination between primaries and multiples in the same domains.
After reviewing the fundamentals of signal processing (Chapter 1), studying the three principal processes - deconvolution (Chapter 2), CMP stacking (Chapter 3) and migration (Chapter 4), and reviewing dipmoveout correction (Chapter 5 ) and the noise and multiple attenuation techniques (Chapter 6 ), we then move on to processing of 3-D seismic data in Chapter 7. The principal objective for 3-D seismic exploration is to obtain an earth image in three dimensions. Clearly, all
FIG. I-8. Three CMP gathers before (left) and after (right) NMO correction. Note that the primaries have been flattened and the multiples have been undercorrected after NMO correction. As a result, multiple energy has been attenuated on the stacked section (center) relative to prinary energy. (Data courtesy Petro-Canada Resources.)
of the 2-D processing techniques covered in Chapters 1 through 6 are either directly applicable to 3 -D seismic data or need to be extended to the third dimension, such as migration and dip-moveout correction.
There is a fundamental problem with seismic data processing. Even when starting with the same raw data, the result of processing by one organization seems to be different from that of another organization. The example shown in Figure I-12 demonstrates this problem. The same data have been processed by six different contractors. Note the significant differences in frequency content, S/N ratio, and degree of structural continuity from one section to another. These differences often stem from differences in the choice of pararneters and the detailed aspects of implementation of processing algorithms. For example, all the contractors have applied residual statics corrections in generating the sections in Figure I-12. However, the prograns each contractor has used to estimate residual statics most likely differ in the handling of the correlation window, selecting the traces used for crosscorrelation with the pilot trace, and statistically treating the correlation peaks.
One other aspect of seismic data processing is the generation of artifacts while trying to enhance signal. A good seismic data analysis program not only performs the task for which it is written, but also generates minimum numerical artifacts. One of the features that makes a production program different from a research program, which is aimed at testing whether the idea works or not, is refinement of the algorithm in the production program to minimize artifacts. Processing can be hazardous if artifacts overpower the intended action of the program.
The ability of the seismic data analyst invariably is as important as the effectiveness of the algorithms in determining the quality of the final product from data processing. There are many examples of good processing using mediocre software. There are also examples of poor processing using good software. The example shown in Figure I-12 rigorously demonstrates how implementational differences in processing algorithus and differences in the analyst's skills can influence results of processing.
(a)
(b)
FIG. I-9. A portion of a CMP-stacked section (a) before, and (b) after residual statics corrections. Note the removal of traveltime distortions caused by the near-surface layer and improvement in the continuity of events after residual statics corrections,

Inversion of Seismic data

A narrow meaning of seismic inversion commonly referred to as trace inversion, is acoustic impedance estimation from a broad-band time-migrated CMP-stacked data. A broad meaning of seismic inversion commonly referred to as elastic inversion, is the grand scheme of estimating elastic parameters directly from observed data. Nevertheiess, in practice, applications of inversion methods can be grouped in two categories data modeling and earth modeling. Much of what we do in seismic data processing described in Chapters 1 through 7 is based on data modeling.
Applications of seismic inversion for data modeling include deconvolution (Chapter 2), refraction and residual statics corrections (Chapter 3) and the discrete Radon transform (Chapter 6). The discrete Radon transform is an excellent example to demonstrate the benefits of data modeling in seismic data processing. Consider a 2-D operator L T L T L^(T)\mathbf{L}^{\mathbf{T}}LT that corresponds to moveout correction to a CMP gather using a range of constant velocities and summing the trace amplitudes along the offset axis. ( T T TTT stands for matrix transpose.) As a result, the data represented by the CMP gather is transformed from the offset space (offset versus two way traveltime) to velocity space (velocity versus twoway zero-offset time). The gather in the output domain is called the velocity stack. The stack amplitudes on the velocity-stack gather exhibit smearing along the velocity axis. This is caused by discrete sampling along the offset axis and finite cable length. The operator L T L T L^(T)\mathbf{L}^{\mathbf{T}}LT alone does not account for these effects. Instead, we must use its generalized linear inverse ( L T L ) 1 L T L T L 1 L T (L^(T)L)^(-1)L^(T)\left(\mathrm{L}^{\mathbf{T}} \mathbf{L}\right)^{-\mathbf{1}} \mathbf{L}^{\mathbf{T}}(LTL)1LT. Application of the operator L T L T L^(T)\mathbf{L}^{\mathrm{T}}LT is within the framework of conventional processing, whereas application of the operator ( L T L ) 1 L T L T L 1 L T (L^(T)L)^(-1)L^(T)\left(\mathbf{L}^{\mathbf{T}} \mathbf{L}\right)^{-1} \mathbf{L}^{\mathbf{T}}(LTL)1LT is within the framework of seismic
FIG. I-10. A portion of a CMP-stacked section before (top) and after (bottom) migration. Note the accurate imaging of the erosional unconformity (A). Nevertheless, the out-of-the-plane event (B) associated with this unconformity can only be imaged accurately by 3 -D migration.
FIG. I-11. A portion of a CMP-stacked section, which has been corrected for dip moveout, before (top) and after (bottom) migration. Dip-moveout correction preserves diffractions and fault-plane reflections which conflict. with gently-dipping reflections. These conflicting events are otherwise attenuated by conventional stacking. (Data courtesy Schlumberger Geco-Prakla and TGS.)
FIG. I-12. A seismic line processed by six different contractors. (Data courtesy British Petroleum Development, Ltd.; Carless Exploration Ltd.; Clyde Petroleum Plc.; Goal Petroleum Plc.; Premier Consoldated Oilfelds Plc.; and Tricentrol Oil Corporation Ltd.)
inversion. The CMP gather can be reconstructed by applying inverse moveout correction and summing over the velocity axis. This inverse trangformation is represented by the operator L L L\mathbf{L}L. Reconstruction of the CMP gather from the velocity-stack gather is one example of data modeling. Data modeling using the velocitystack gather computed by the processing operator L T L T L^(T)\mathbf{L}^{\mathbf{T}}LT does not faithfully restore the amplitudes of the original CMP gather, whereas dat a modeling using the inversion operator ( L T L ) 1 L T L T L 1 L T (L^(T)L)^(-1)L^(T)\left(\mathbf{L}^{\mathrm{T}} \mathbf{L}\right)^{-1} \mathbf{L}^{\mathbf{T}}(LTL)1LT does.
Just as there is a difference between processing and inversion in data modeling, also, there exists a difference between processing and inversion in earth modeling. The primary objective in processing is to obtain an earth model in time with an accompanying earth image in time a time-migrated section or volume of data (Figure I-13). Representation of an earth model in time usually is in the form of a velocaty field, which has to be smoothly varying both in time and space. Whereas the primary objective in inversion is to obtain an earth model in depth with an accompanying earth image in depth a depth-migrated section or volume of data (Figure I-14). Representation of an earth model in depth usually is in the form of a detailed velocty depth model, which can include layer boundaries with velocity contrast (Figure I-14).
Chapters 8 and 9 are devoted to earth imaging and modeling in depth, respectively. Results of conventional processing of seismic data often are displayed in the form of an unmigrated (Figure I-15a) and migrated CMP-stacked section (Figure I-15b), with the vertical axis as time, which is different from the recording time of seismic wavefields. For unmigrated data, the vertical axis of the CMP-stacked section represents times of reflection events in the unmigrated position in the subsurface. These event times are associated with normalincidence raypaths from coincident source-receiver locations at the surface to reflectors in the subsurface and back. For migrated data, the vertical axis represents times of reflection events in the migrated position. These event times are associated with vertical-incidence raypaths from coincident source-receiver locations at the surface to reflectors in the subsurface and beck. As long as there are no lateral velocity variations, seismic imaging of the subsurface can be achieved using time migration techniques and the result can be displayed in time. This time-migrated section can then be converted to depth along vertical raypaths.
When there are mild to moderate lateral velocity variations, time migration can still yield a reasonably accurate image of the subsurface. Nevertheless, depth conversion must be done along image rays to accommodate for the lateral mispositioning of the events as a result of time migration.
In the presence of strong to severe lateral velocity variations, however, time migration no longer is valid.
Instead, seismic imaging of the subsur face must be done using depth migration techniques so as to properly account for lateral velocity variations and the result must. be displayed in depth.
The depth-migrated section (Figure I-15c) can be considered a close representation of the structural crosssection of the subsurface only if the velocity-depth model is sufficiently accurate. In the example shown in Figure I-15, the picked horizons correspond to leyer boundaries with significant velocity contrast. The zone of interest is base Zechstein (the red horizon) and the underlying Carboniferous sequence. The green horizon just below 2 k m 2 k m 2km2 \mathrm{~km}2 km is the top Zechstein. This formation consists of two units of anhydrite-dolomite with a thickness of approximately 100 m 100 m 100m100 \mathrm{~m}100 m the shallow unit very close to top-Zechstein and concordant with it, and the deeper unit which manifests itself with a very complex geometry as seen in the migrated sections.
An earth model in depth usually is described by two sets of parameters layer velocitves and reflector geometries (Figure I-16). Practical methods to delineate reflector geometries described in Chapter 8, and to estimate layer velocities described in Chapter 9 can be appropriately combined to construct earth models in depth from seismic data.
In practice, smoothness of earth models derived from processing means that we can make a straightray assumption and usually do not have to honor ray bending at layer boundaries. In contrast, detailed definition of earth models derived from inversion with a more stringent requirement in accuracy means that we do have to honor ray bending at layer boundaries and account for vertical and lateral velocity gradients within the layers themselves. Hence, to a large extent, processing can be automated, while inversion requires interpretive pause at each layer boundary.
There is a fundamental problem with inversion applied to earth modeling in depth velocty-depth ambiguty. This means that an error in depth is indistinguishable from an error velocity. To resolve velocitydepth ambiguity as much as possible, one needs to do an independent estimate of layer velocities and reflector geometries using prestack data. As a result of velocitydepth ambiguity, an output from inversion is an estimated velocity-depth model with a measure of uncertainty in layer velocities and reflector geometries. It is now widely accepted in the industry that results of inversion are geologically plausable only when there is a sound interpretation effort put into the data analysis.
It is the limited accuracy in velocity estimation that has led to the acceptance of time sections to be the standard mode of display in seismic explotation. Facing the challenge of improving the accuracy in velocity estimation should make the depth sections increasingly more acceptable. Specifically, improving the accuracy meens the ability to resolve detailed velocity
FIG. I-13. An earth image in time obtained by poststack time migration of CMP-stacked section with the color-codod earth model in time represented by a velocity field.
FIG. I-14. An earth image in depth obtained by prestack depth migration with the color-coded earth model in depth represented by a velocity-depth model.
FIG. I-15. (a) A cross-bection from an unmigrated volume of CMP-stadked data; (b) the sume croes-section after 3-D poststack time migration: and (c) after 3-D poststack depth migration. See text for details. (Data courtesy Amoco Production (UK) Led.)
a
b
FIG. I-16. An earth model in depth is described by two sets of parameters
(a) Layer velocities, and (b) reflector geometries.
variations in the vertical and lateral directions, associated with both structural and stratigraphic targets.
Earth modeling in depth usually involves implementation of an inversion procedure layer by layer starting from the top (Figure I-17). First, estimate a velocity field (the color-coded surface and the vertical crosssection) for the first layer, for instance, using 3-D co herency inversion. Then delineate the reflector geometry (the silver surface) associated with the base of the layer, for instance, using 3-D poststack depth migration (Figure I-17a). Next, estimate a velocity field for the second layer and delineate the reflector geometry associated with the base of the layer (Figure I-17b). Alternate between layer velocity estimation and reflector geometry delineation, one layer at a time, to complete the construction of the earth model in depth (Figure 1-17c). This layer-by-layer, structure-dependent estima tion of earth models in depth is needed when there are distinct layer boundaries with significant velocity contrast (as in many parts of the North Sea). In practice, an iterative, structure-independent estimation of earth models in depth also is used in the case of a background velocity field with not-so-distinct leyer boundaries (as in the Gulf of Mexico).
Practical methods of layer velocity estimation include Dix conversion and inversion of stacking velocities, coherency inversion, and analysis of image gathers from prestack depth migration (Chapter 9). Velocity nodes at analysis locations for the layer under consideration (Figure I-18a) are assigned to the normalincidence reflection points over the surface associated with the base of the layer (Figure I-18b). A velocity field for the layer is then created by spatial interpolation of the velocity nodes. This layer velocity field is assigned to the layer together with a similar field for a vertical velocity gradient whenever it is available from well data.
Practical methods of reflector geometry delineation include vertical-ray and image-ray depth conversion of time horizons interpreted from time-migrated data, commonly known as vertical stretch and map migration, respectively. Additionally, reflector geometries in depth can be delineated by interpreting post- and prestack depth-migrated data. By interpreting crosssections from the volume of depth-migrated data at appropriate intervals, horizon strands are created (Figure I-19a). These strands then are interpolated spatially to create the surface that represents the reflector geometry associated with the layer boundary included in the earth model in depth (Figure I-19b).
In Chapter 10, we present case studies for 2- and 3-D earth modeling and imaging in depth applicable to structural plays. These cases involve exploration and development objectives that require solving specific problems such as imaging beneath diapiric structures associated with salt tectonics. imaging beneath imbricate structures associated with overthrust tectonics, target reflectors below an irregular water-bottom topography, fault shadows, and shallow velocity anomalies.
A concise, but sufficiently rigorous, review of seismic wave propagation is given in Chapter 11. This also is intended to remind the reader of the two components of observed seismic data that can be used in inversion
traveltimes and amplitudes, to estimate the earth parameters. It is generally favorable to do the inversion of reflection traveltimes and amplitudes separately. The former is more robust and stable in the presence of noise. The latter is more sensitive to ambient noise and is prone to producing unstable solutions, and therefore, it may require more stringent constraints.
In Chapter 11, we review inversion of amplitudes of acoustic wavefields, specifically, prestack amplitude inversion to derive the attributes associated with amplitude variation with offset (AVO) and poststack amplitude inversion to estimate an acoustic impedance (AI) model of the earth. We broadly associate traveltime inversion with the estimation of a structural model of a reservoir that describes the geometry of the layer boundaries and faults. Whereas, we broadly associate amplitude inversion with the estimation of a stratigraphic model of the reservoir that describes the lateral and vertical variations of the AVO and AI attributes within the layers themselves. The latter can then be transcribed into petrophysical paraneters pore pressure, porosity, permeability, and fluid saturation, and it combined with the structural model to create a model of the reservoir. Therefore, seismic inversion is a true pronouncement of integration between petroloum geology, petroleum engineering, and exploration seismol ogy. Only the explotation seismologists timespeak. while the peroleurn geologists and engineers depthspeak. To achieve integration, they all must be fluent in the sarne language depthspenk.

Interpretation of Seismic data

When you pick semblance peaks from a velocity spectrum (Section 3.2) to determine the moveout velocity function, you implicitly make a judgment as to what is primary and what is multiple. When you pick a coherency semblance spectrum (Section 9.2) to determine the interval velocity profile, you make a judgment as to what degree of lateral velocity variations needs to be honored. These are but two examples of interpretive work involved in processing and inversion of seismic data, respectively.
What is known as traditional seismic interpreta-
FIG. 1-17. Layer-by-layer estimation of an earth model in depth. See lext for details.
FIG. I-18. Estimated velocities for a layer represented by the color-coded velocity nodes (top) and the velocity field derived from the nodes (bottom).
FIG. I-19. Reflector geometry delincution: (top) depth horizon strands created by interpreting selected cross-sections (dis. played is one such section) from the depth-migrated volume of data, and (bottom) the surface that represents the reflector boundary created by spatial interpolation of the strands.
tion, however, involves picking a reflection time surface associated with a layer boundary from a timemigrated volume of data or a reflector from a depthmigrated volume of data to determine the structure map for that layer boundary (Figure I-19). The power of 3-D visualization of image volumes, velocity volumes, and attribute volumes, such as those associated with AVO analysis and acoustic impedance estimation, have dramatically changed the way seismic interpretation is done now. Interperetation no longer is picking traveltimes to determine the structural geology of the area of interest, but also involves manipulation of amplitudes contained in the data volumes to derive information about the depositional environment, depositional sequence boundaries, and the internal constitution of the sequence units themselves. Interpretation of 3-D seismic data is covered in Section 7.5, while further examples are provided with the case studies in Sections 10.8 and 10.9 .

From Seismic Exploration to Seismic Monitoring

The seismic industry has been impressively dynamic and creative during its 60-year history. Although it is relatively a small sector within the oil and gas industry at large, it has made the most significant impact on increasing proven reserves and reserve-production ratios worldwide.
We shall now sketch a brief historiography of the seismic industry before we look ahead. The evolution of the scismic industry can be described briefly in decades of development and forward leaps from one theme to another as outlined in Table I-1.
In the 1960 s 1960 s 1960s1960 \mathrm{~s}1960 s, the digital revolution profoundly changed seismic acquisition. We were then able to record more data by increasing the number of channcls and fold of coverage. The digital revolution brought about the need to use digital computers to analyze the recorded data. That came about in the 1970 s when we switched from calculators to computers. Many of the data processing algorithms, including deconvolution,
Table 1-1. The milestones in the seismic industry.
1960s From aralog to digatal
1970 s From calculators to computers
1980 s 1980 s 1980s1980 \mathrm{~s}1980 s From 2-D to 3-D
1990 s 1990 s 1990s1990 \mathrm{~s}1990 s From tame to depth
2000s From 3 D 3 D 3-D3-D3D to 4 - D D DDD
From 4 D 4 D 4-D4-D4D to 4 C 4 C 4-C4-C4C
From ssotropy to anzsotropy velocity analysis, refraction, and residual statics corrections, normal-moveout corection and stacking, and even migration, were implemented in those years. The computer before the seventies was a person using the calculator; now the computer is a machine and the person became the seismic analyst.
In the 1980s, the seismic industry took another big step forward; it was now beginning to provide the oil and gas industry with 3-D images of the subsurface. We need only to examine the global reserve-production curves over the past decades to see that the 3-D revolution gave a big jump from 35 to 45 years for oil and from 50 to 65 years for gas. The seismic industry was already pushing the computer industry to the limit with its need for power to handle large-scale data volumes acquired by 3 D 3 D 3-D3-D3D surveys.
Finally, in the 1990 s, the seismic industry was capable of providing the oil and gas industry with images of the subsurface, not just in 3-D, but also in depth. It took years of exhaustive experimental research to test, and field-prove numerous methods to accurately estimate an earth model in depth and use it to efficiently create an earth image in depth. Once again, the seismic industry has challenged the computer industry to provide cost-effective solutions for numerically intensive applications with large input-output operations, such as 3-D prestack depth migration.
As the seismic industry made one breakthrough after another during its history, it also created new challenges for itself. Now we record not just P P PPP-waves but also converted S S SSS-waves for a wide range of objectives. Using the multicomponent seismic method, commonly known as the 4 -C seismic method, we are now able to see through gas plumes caused by the reservoir below. We are able to sometimes better image the subsalt and subbasalt targets with the 4-C seismic method. Using the converted S S SSS-waves, we are able to detect the oil-water contact, and the top or base of the reservoir unit that we sometimes could not delineate using only P P PPP-waves. We even go further now and attempt to identify fluid types in reservoir rocks, discriminate sand from shale, and map hydrocarbon saturation, again using the 4-C seismic method. Our ultimate objective is to use the seismic method, in addition to the production and geologic data, to characterize oil and gas reservoirs accurately.
Just as we may characterize oil and gas reservoirs seismically, we may also seismically monitor them. Given a set of time-lapse 3-D seismic survey data, which constitutes the basis of the 4-D seismic method, we can track flow paths and fluid distribution in the reservoirs throughout their lifetime. And finally, we have to acknowledge that the earth is anisotropic. By accounting
for anisotropy, we can map fractures and increase the accuracy of velocity esitmation and imaging techniques.
Accompanying all of these new frontiers for the seismic industry is the availability of a dazzling 3 D 3 D 3-D3-D3D visualization technology that now enables us to perform volume-based processing (Section 5.4) and inversion and interpretation (Sections 10.8 and 10.9). Keep the following principle in mind when analyzing large volumes of data: Before you get more data, get the most out of your data.
The topics on the 4-D and 4-C seismic methods, and anisotropy discussed in Chapter 11 are for the road immediately ahead in the seismic industry with the aim of a rigorous, seismically driven reservoir characterization and monitoring.

REFERENCES

Pullan, S. E. and Hunter, J. A., 1990, Delineation of buried bedrock valleys using the optimum offset shallow reflection technique, in Ward, S. H., Ed., Geotechnical and environmental geophysics, Vol. III: Soc. Expl. Geophys., 75-87.
Yilmaz, O., 1976, A Short Note on Deep Seismic Sounding in Turkey: J. Geophys. Soc. of Turkey, 3, 5458.

1 Fundamentals of Signal Processing

  • Introduction - The 1-D Fourier Transform - Analog versus Digital Signal - Frequency Aliasing *\cdot Phase Considerations - Time-Domain Operations - Convolution - Crosscorrelation and Autocorrelation *\cdot Vibroseis Correlation \bullet Frequency Filtering - Practical Aspects of Frequency Filtering - Bandwidth and Vertical Resolution \bullet Time-Variant Filtering - The 2-D Fourier Transform - Spatial Aliasing - Worldwide Assortment of Shot Records *\cdot Wave Types *\cdot Gain Applications *\cdot Geometric Spreading Correction - Programmed Gain Control \bullet RMS Amplitude AGC *\cdot Instantaneous AGC *\cdot Relative Trace Balancing *\cdot Basic Data Processing Sequence *\cdot Preprocessing *\cdot Deconvolution \bullet CMP Sorting *\cdot Velocity Analysis *\cdot Normal-Moveout Correction \bullet Multiple Attenuation *\cdot Dip-Moveout Correction *\cdot CMP Stacking *\cdot Poststack Processing *\cdot Migration *\cdot Residual Statics Corrections - Quality Control in Processing *\cdot Parsimony in Processing *\cdot Exercises *\cdot Appendix A: A Mathematical Review of the Fourier Transform - The 1-D Fourier Transform - The z z zzz-Transform - The 2-D Fourier Transform - References

1.0 INTRODUCTION

The Fourjer transform is fundamental to seismic data analysis. It applies to almost all stages of processing. A seismic trace represents a seismic wavefield recorded at a receiver location. The digital form of a seismic trace is a time series which can be completely described as a discrete sum of a number of sinusoids - each with a unique peak amplitude, frequency, and a phase-lag (relative alignment). The analysis of a seismic trace into its sinusoidal components is achieved by the forward Fourier transform. Conversely, the synthesis of a seismic trace from the individual sinusoidal components is achieved by the neverse Fourier transform. A brief mathematical review of the Fourier transform is given in Appendix A A AAA.
Seismic data processing algorithms often can be described or implemented more simply in the frequency domain than in the time domain. In Section 1.1, the one-dimensional (1-D) Fourier transform is introduced and some basic properties of time series in both time and frequency domains are described. Many of the processing techniques single- and multichannel, involve an operand (seismic trace) and an operator (filter). A simple application of Fourier analysis is in the design of zero-phase frequency filters, typically in the form of band-pass filtering.
The two-dimensional (2-D) Fourier transform (Section 1.2) is a way to decompose a seismic wavefield, such as a common-shot gather, into its plane-wave components, each with a certain frequency propagating at a certain angle from the vertical. Therefore, the 2-D Fourier transform can describe processes like migration and frequency-wavenumber ( f k ) ( f k ) (f-k)(f-k)(fk) filtering. A common application of f k f k f-kf-kfk filtering is the rejection of coherent linear noise by dip filtering, and attenuation of nultiples based on velocity discrimination between primaries and multiples in the f k f k f-kf-kfk domain (Section 6.2),
In Section 1.3, 40 common-shot gathers recorded "I rifferent parts of the world with different types of wnuces and recording instruments are introduced. Var1 :" types of seismic energy are described on these shot 1 "ids reflections, refractions, coherent noise such is multiples, guided waves, side-scattered energy and agrmurl roll, and ambient random noise.
Srismic data often require application of a gain funtion time-variant scaling of amplitudes, for varin 1 risons. The scaing function commonly is derived from the data. Gain types are discussed in Section 1.4. (t in carly stage in processing, gain is applied to data to correct for wavefront divergence decay in amplimiles caused by geometric spreading of scismic waves. Seismic data often are gained for display purposes; for instance, by applying automatic gain control (AGC), which brings up weak reflection zones in seismic data. However, an AGC-type gain can destroy signal character and must, therefore, be considered with caution.
Finaily, in Section 1.5, a summary of the basic data processing sequence is presented with field data examplis. There are three primary stages in seismic data prrcessing; each is aimed at improving seismic resolution the ability to separate two events that are very close together, either spatially or temporally:
(a) Deconvolution is performed along the time axis to increase temporal resolution by compressing the basic seismic wavelet to approximately a spike and suppressing reverberating wavetrains.
(b) Stacking compresses the offset dimension, thus reducing seismic data volume to the plane of the zerooffset seismic section and increasing the signal-tonoise ratio.
(c) Migration commonly is performed on the stacked section (which is assumed to be equivalent to a zero-offset section) to increase lateral resolution by collapsing diffractions and moving dipping events to their supposedly true subsurface positions.
Secondary processes are implemented at certain stages to condition the data and improve the performance of deconvolution, stacking, and migration. When coherent noise is dip filtered, for example, deconvolution and velocity analysis may be improved. Residual statics corrections also improve velocity anelysis and, hence, the quality of the stacked section.

1.1 THE 1-D FOURIER TRANSFORM

Consider the following experiment. Hold a spring at one erd and attach a weight to the other end. Pull the wisight dovi a certain amount, say 0.8 units of distancer
Release the weiglit. Assume that the spring is elastic it bounces up and down ad infinitum. Sct the time to zero at the onset of motion. Displacement of the weight as a function of time should vary between the peak amplitudes ( + 0.8 , 0.8 ) ( + 0.8 , 0.8 ) (+0.8,-0.8)(+0.8,-0.8)(+0.8,0.8). If you had a device that could trace the amplitude of the displacement as a function of time, it would produce a sinusoidal curve as slic " 11 " 11 "11" 11"11 in Figure 1.1-1 (frame 1). Measure the time intervi =tween two consecutive peaks; you will find that is 0.080 s ( 80 m s ) 0.080 s ( 80 m s ) 0.080s(80ms)0.080 \mathrm{~s}(80 \mathrm{~ms})0.080 s(80 ms). This time interval is called the per of the spring and it depends on the spring constant a measure of spring stiffness. We say that the spring has completed one cycle of motion in a single period of time. Count the number of cycles within one seci fad. This should be 12.5 cycles, which is called the freq. "tcy associated with the spring motion. One cycle per sct ind (cps) is one hertz (Hz). Note that 1 / 0.080 ε = 12 ; 12 1 / 0.080 ε = 12 ; 12 1//0.080 epsi=12;121 / 0.080 \varepsilon=12 ; 121/0.080ε=12;12, that is, frequency is the inverse of the period.
To continue, repeat the above experiment using a spring with a higher stiffness. Give the second spring a peak displacement amplitude of 04 units. The motioni of the spring is traced as another sinusoid in Figure 11 1 (frame 2). The period and frequency of the spring ale 0.040 s 0.040 s 0.040s0.040 \mathrm{~s}0.040 s and 25 H z 25 H z 25Hz25 \mathrm{~Hz}25 Hz, respectively. To keep track of these measurements, plot the peak amplitude of each spring as a function of frequency. These are the amplitude yecttra shown in Figure 1.1-1.
Working with two identical springs, release spring 1 from a peak amplitude displacement of 0.8 units and set the time to zero at the onset of the motion. When spring 1 passes through the zero amplitude position, set spring 2 in motion from the same peak amplitude displacement, (0.8). The motion of spring 1 is plotted in frame 1 , while the motion of spring 2 is plotted in frame 3 of Figure 1.1-1. Because the springs were set to motion with the same peak amplitude displacenent, the amplitude spectra of the two sinusoidal time functions should be identical. However, a difference is noted between the time functions in frames 1 and 3 . In particular, when the sinusoid in frame 1 takes the peak amplitude value, the sinusoid in frame 3 takes the sero amplitude value. There was a time delay ( 20 m s ) 20 m s ) 20ms)20 \mathrm{~ms})20 ms) equuvalent to one-quater of a full cycle in setting spring 2 in motion relative to spring 1 . This time delay is the difference between the two sinusoids shown in frames 1 and 3. A full cycle is equivalent to 360 degrees or 2 π r a 2 π r a 2pira2 \pi \mathrm{ra}2πra dians. Therefore, a time delay of one-quarter of a cvele is equivalent to a +90 -degree phase-lag.
Phase is defined as the negative of phat lise (Robinson and Treitel, 1980). Thus, a negatzie mr shift corresponds to a positue phase value. Note that in Figure 1.1-1, if we apply a time slift of one-ruarter of a full cycle ( 20 m s ) ( 20 m s ) (20ms)(20 \mathrm{~ms})(20 ms) to the sinusoid in frame 3 in the negative time direction. we obtain the sinumoid in frame 1 .
Sinusoids
Amplitude Spectra
1
0.5
0
Phase Spectra
FIG. 1.1-1. Tracing the motion of a spnng in tme yields a sinusoldal curve where positive amplt tude corresponds to spring motion in the upward direction. The peak amplitude represents the maximum displacement of the weight at the end of the spring from the unstretched postion. The time between the two consecutive peaks is the period of the sirusoid, the inverse of which is called frequency. Amplitude spectra distinguish sinusoids 1 and 2, which have different peak amplitudes and frequencies The tume delay of the onset of one spring relative to another is defined as phase-lag. Phase spcctra (the negative of phase-lag spectral distinguish sinusoids 1 and 3 .
Although their amplitude spectra are identical, these two sinusoids can be distinguished based on their phase spectro as seen in Figure 1.1-1.
The experiment is completed. What is learned? First, the motion of an elastic spring can be described by a sinusoidal time function. Second, and more important, a complete description of a sinusoidal motion is given by its frequency, peak amplitude, and phase. This experiment teaches us how to describe spring motion as a function of time and frequency.
Now imagine an ensemble of many springs, each with a sinusoidal motion with a specific frequency, peak amplitude, and phase. The sinusoidal responses of all the members are shown in Figure 1.1-2. Suppose the motions of the individual springs are superimposed by adding all the traces. The result is a tme-dependent signal that is represented by the first trace in Figure 1.1-2 (as indicated by the asterisk). The superposition (synthesis) allows us to transform the motion from frequency to time domain. This transformation is reversible; that is, the time-domain signal can be broken down (analyzed) into its sinusoidal components in the frequency domain.
Mathematically, this two-way process is achieved by the Fourier transform. In practice, the standard algorithm used on digital computers is the fast Fourier transform (FFT). Analysis of a time-dependent signal into its frequency components is done by forward Fourier transform, while synthesis of all the frequency components to the time-domain signal is done by inverse Fourier transform.
Figure 1.1-3 is a display of the Fourier transform of the time-dependent signal from Figure 1.1-2. The amplitude and phase spectra constitute a more condensed frequency-domain representation of the sinusoids in Figure 1.1-2. We can clearly see the parallelism between the two types of displays. In particular, the amplitude spectrum in Figure 1.1-3 has a large and a relatively small peak at about 20 and 40 H z 40 H z 40Hz40 \mathrm{~Hz}40 Hz, respectively. Darker bands corresponding to larger peak amplitudes occur in Figure 1.1-2 at about the same frequencies. On the other hand, zones of weak amplitudes at about 30 H z 30 H z 30Hz30 \mathrm{~Hz}30 Hz and at the low- and high-frequency ends of the spectrum also
FIG. 1.1-2. An ensemble of sinusoidal motions with different frequency, peak amplitude, and phase-lag can be superimposed to synthesize a time-dependent waveform on the trace as indicated by the asterisk.
are apparent in both types of representations. Remember that the amplitude spectrum curve represents the peak amplitudes of the individual sinusoidal components as a function of frequency.
Now examine the phase spectrum. From the spring experiment, recall that the time delay of a particular frequency component also was expressed as a phase-lag. To better trace phase-lag as a function of frequency, a part of Figure 1.1-2 is magnified in Figure 1.1-4. Follow the positive-peak trend denoted by P P PPP. Note that the peaks fall above the zero timing line on the negative side of time axis at the low-frequency end of the spectrum. They then cross over to the positive side of the time axis at about 20 H z 20 H z 20Hz20 \mathrm{~Hz}20 Hz and stay on that side over the rest of the frequency axis. The path that the peaks follow in Figure 1.1-4 can be plotted as the phase spectrum of Figure 1.1-3. If all the peaks were aligned along the zero timing line in Figure 1.1-4, then the corresponding time-domain signal would have a zero-phase spectrum. In this case, all the sinusoids would reinforce each other, causing a maximum peak value at zero time (Figure 1 111).
The physical significance of the amplitude spectrum is easier to understand than that of the phase spectrum. These two spectra are discussed further in this chapter. Basic mathematical details of the Fourier transform are given in Appendix A A AAA at the end of this chapter.

Analog versus Digital Signal

A seismic signal is a continuous time function. In digital recording, the continuous (analog) seismic signal is sampled at a fixed rate in time, called the sampling n π n π n pin \pinπ terval (or sampling rate). Typical values of sampling intervals range between 1 and 4 m s 4 m s 4ms4 \mathrm{~ms}4 ms for most reflection seismic work. Hjgh-resolution studies require sampling intervals as small as 0.25 m s 0.25 m s 0.25ms0.25 \mathrm{~ms}0.25 ms.
FIG. 1.1-3. The information from Figure 1.1-2 cun be condensed into amplitude and phase spectra. Each point along the amplitude spectrum curve corresponds to the peak amplitude of the sunusoid at that frequency plotted as a trace in Figure 1.1-2. Note the equivalence of the two peaks in the amplitude spectrum with the two high-amplitude zones in Figure 1,1-2. Each point along the phase spectrum corresponds to the time delay of a peak or trough along the sinusoid at that frequency with respect to the timing line at t = 0 t = 0 t=0t=0t=0. Note the equivalence of the phase curve with the trend of a positive peak from trace to trace in Figure 1.1-4.
Figure 1.1-5 shows a continuous signal in time. The discrete samples that might actually be recorded are shown by dots. A discrete time function is called a time senes. The bottom curve in Figure 1.1-5 is an attempted reconstruction of the original analog signal, which is shown as the curve on top. Note that the reconstructed signal lacks the details present in the original analog signal. These details correspond to high-frequency components that were lost by sampling. If a smaller sampling interval were chosen, then the reconstructed signal would more accurately represent the original signal. For the extreme case of a zero sampling interval, the continuous signal can be represented exactly.
Is there a measure of the restorable frequency bandwidth of the digitized data? Figure 1.1-6 shows a time series, such as a seismic trace, with a 2-ms sarrpling interval and the corresponding amplitude spectrum. In general, given the sampling interval Δ t Δ t Delta t\Delta tΔt, the highest frequency that can be restored accurately is called the Nyquist frequency and is given by
f N y q = 1 2 Δ t f N y q = 1 2 Δ t f_(Nyq)=(1)/(2Delta t)f_{N y q}=\frac{1}{2 \Delta t}fNyq=12Δt
For the time series in Figure 1.1-6, Δ t = 2 m s Δ t = 2 m s Delta t=2ms\Delta t=2 \mathrm{~ms}Δt=2 ms; therefore, the Nyquist frequency is 250 H z 250 H z 250Hz250 \mathrm{~Hz}250 Hz. The original time series was resampled to obtain a series with 4 - and 8 m s 8 m s 8-ms8-\mathrm{ms}8ms sampling intervals. The corresponding Nyquist frequencies are 125 and 62.5 H z 62.5 H z 62.5Hz62.5 \mathrm{~Hz}62.5 Hz, respectively. Figure 1.1-6 also shows the series (as reconstructed back to 2 m s 2 m s 2ms2 \mathrm{~ms}2 ms for plotting purposes) sampled at 4 and 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms with their amplitude spectra. Note that the coarser the sampling interval, the smoother the serjes. Smoothness results from a loss of high frequencies as seen in the amplitude spectra. Frequency components between 125 and 250 H z 250 H z 250Hz250 \mathrm{~Hz}250 Hz, which are present in the time series with the 2-ms sampling interval, seem to be absent in the series resampled to 4 ms. Likewise, frequency components between 62.5 and 250 H z 250 H z 250Hz250 \mathrm{~Hz}250 Hz seem to be absent from the series resampled to 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms. Can these frequencies be recovered? No. Once a continuous signal as digatized, the highest frequency that can be restored accurately is the Nyqust frequency.
We may think that when the time series sampled at 4 or 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms is interpolated back to a 2 - m s m s ms\mathrm{ms}ms sampling interval, those high frequencies should return. As stated earlier, the time series in Figure 1.1-6 with 4- and 8ms sampling intervals actually were reconstructed by interpolation back to 2 m s 2 m s 2ms2 \mathrm{~ms}2 ms to get the same number of samples as the original series for plotting with the same scale. Interpolation does not recover the frequencres lost by samping; at onily generates extra samples.
The implication for sampling the continuous signal in the field is an important one. If the earth signal had
FIG. 1.1-4. A portion of Figure 1.1-2 is enlarged to better delneate the trend of the phase curve from trace to trace from one frequency component to unother. Compare the trend indicated by the positive peak P P PPP with the phase spectrum in Figure 1.1-3.
frequencies, say up to 150 H z 150 H z 150Hz150 \mathrm{~Hz}150 Hz, then the 4 -ms sampling interval would cause a loss of the band between 125 and 150 H z 150 H z 150Hz150 \mathrm{~Hz}150 Hz.
While maximum recoverable signal frequency is the Nyquist frequency for a 1-D digitized data set, such as a single seismic trace, the situation can be different. for two or more dimensional data. Consider the process of moveout correction and stacking (Section 3.1). Given the sampling rate for the stacked trace, say 4 m s m s ms\mathrm{ms}ms, data sampies are searched on each input trace in the common-midpoint (CMP) gather based on the hyperbolic moveout equation. Since each input trace also is sampled at regular intervals, say 4 m s 4 m s 4ms4 \mathrm{~ms}4 ms, the computed input sample location would normally fall in between two samples on a given input trace. By interpolation, the required sample value can be computed and placed on the output sample location (Section 3.1). Such an output-driven process would faithfully preserve frequencies below the Nyquist, only. Consider the alter- native process in which a sample in the input trace is placed at the exact time location on the output trace (Wisecup, 1998). The resulting output stacked trace from this input-driven process would contain all the samples from all the input traces at exact time locations with irregular intervals. Such random sampling then yields a potential Nyquist frequency greater than the Nyquist frequency associated with the input traces.

Frequency Aliasing

Consider the sinusoid in Figure 1,1-7. This signal is resampled as before to 4 and 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms. The amplitude spectra indicate that all three have the same frequency, 25 H z 25 H z 25Hz25 \mathrm{~Hz}25 Hz. Nothing happened to the signal after resampling it to a coarser sampling interval. Now examine the higher frequency sinusoid ( 75 H z 75 H z 75Hz75 \mathrm{~Hz}75 Hz ) in Figure 1.1-8. It appears the
(a)
(b)
(c)
FIG. 1.1-5. (a) A continuous analog signal, (b) a digitized form of thr signal, (c) reconstructed analog signal. When digitized, a continuous analog signal loses frequencies above the Nyquist frequency. (Adapted from Rothman, 1981) same at both 2- and 4-ms sampling. However, 1esanpling to 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms changed the signal and made it appear to be a lower frequency sinusoid. The resampled signal haa frequency of 50 H z 50 H z 50Hz50 \mathrm{~Hz}50 Hz as seen in the amplitude spectrum The Nyquist frequency for an 8-ms sampling interval i 62.5 H z 62.5 H z 62.5Hz62.5 \mathrm{~Hz}62.5 Hz. The true signal frequency is 75 H z 75 H z 75Hz75 \mathrm{~Hz}75 Hz. As a result of resampling, the signal with 75 H z 75 H z 75-Hz75-\mathrm{Hz}75Hz frequency folde i back onto the spectrum and appeared at its ahas f r f r fr\mathrm{fr}fr quency of 50 H z 50 H z 50Hz50 \mathrm{~Hz}50 Hz. Finally, a 150 H z 150 H z 150Hz150 \mathrm{~Hz}150 Hz sinusoid resamplerl to 4 and 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms is shown in Figure 1.1-9. This time, the 4-ms sampling made the signal appear as a 100 H z 100 H z 100-Hz100-\mathrm{Hz}100Hz ing nal, while the 8-ms sampling made it appear as a 25 H 25 H 25H25 \mathrm{H}25H, signal. By using a single-frequency sinusoid, we sce thet frequencies above the Nyquist really are not lost aft (1) sampling, but appear at frequencies below the Nyquist
Now consider the superposition of two sinusuld with frequencies of 12.5 12.5 12.5-12.5-12.5 and 75 H z 75 H z 75-Hz75-\mathrm{Hz}75Hz as shown in F i g F i g Fig-\mathrm{Fig}-Fig ure 1.1-10. Digitization of this signal at 2- and 4-11, sampling intervals does not alter the original sigıal. since its frequency components are below the Nyquiv frequencies associated with 2- and 4-ms sampling intelvals 250 and 125 H z 125 H z 125Hz125 \mathrm{~Hz}125 Hz, respectively. However, when tlk

Sampling Rate = 2 m s = 2 m s =2ms=2 \mathbf{~ m s}=2 ms

4 m s 4 m s 4ms4 \mathrm{~ms}4 ms

Amplitude Spectra

FIG. 1.1-6. A tome series sampled at 2 m s 2 m s 2ms2 \mathrm{~ms}2 ms has a Nyquist frequency of 250 H z 250 H z 250Hz250 \mathrm{~Hz}250 Hz. Resampling to 4 and 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms confines the frequency band to 125 and 62.5 H z 62.5 H z 62.5Hz62.5 \mathrm{~Hz}62.5 Hz, respectively. Note the loss of high frequencies at larger sampling intervals.
FIG. 1.1-7. A 25 H z 25 H z 25-Hz25-\mathrm{Hz}25Hz sinusoid sampled at 2 m s 2 m s 2ms2 \mathrm{~ms}2 ms remains unchanged when resampled at 4 or 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms.

Amplitude Spectra

FIG. 1.1-8. A 75 H z 75 H z 75-Hz75-\mathrm{Hz}75Hz sinusoid sampled at 2 m s 2 m s 2ms2 \mathrm{~ms}2 ms remains unchanged when resampled at 4 m s , but 4 m s , but  4ms_(", but ")4 \mathrm{~ms}_{\text {, but }}4 ms, but  but appears as a 50 H z 50 H z 50-Hz50-\mathrm{Hz}50Hz sinusoid when resampled at 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms. Hence, the latter is the alies of the orignal sinusoid.

Amplitude Spectra

FIG. 1.1-9. A 150-Hz sinusoid sampled at 2 m s 2 m s 2ms2 \mathrm{~ms}2 ms appears as a 100 H z 100 H z 100Hz100 \mathrm{~Hz}100 Hz sinusoid when resampled at 4 m s 4 m s 4ms4 \mathrm{~ms}4 ms and as a 25 H z 25 H z 25-Hz25-\mathrm{Hz}25Hz sinusoid when resampled at 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms. (Amplitude modulation in the 2 -ms sinusoid is a result of limitations in plotting very high-frequency signals.)
Sampling Rate = 2 m s = 2 m s =2ms=2 \mathrm{~ms}=2 ms
4 m s 4 m s 4ms4 \mathrm{~ms}4 ms
Amplitude Spectra
FIG. 1.1-10. A time series synthesized from two sinusoids with 12.5 and 75 H z 75 H z 75Hz75 \mathrm{~Hz}75 Hz at 2 -ms sampling rate remains unchanged when resampled at 4 m s 4 m s 4ms4 \mathrm{~ms}4 ms. However, at 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms, its high-frequency component shifts from 75 to 50 H z 50 H z 50Hz50 \mathrm{~Hz}50 Hz, while its low-frequency component remains the same.
signal is digitized at a coarser sampling interval, such As 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms, the amplitude spectrum changes. The 12.5H/ component is not affected, because 8-ms sampling stil] is sufficient to sample this low-frequency compon'11t. On the other hand, the 75 H z 75 H z 75-Hz75-\mathrm{Hz}75Hz component is seen as a lower-frequency component ( 50 H z ( 50 H z (50Hz(50 \mathrm{~Hz}(50 Hz ). Once again, note that those frequencies in the original signal above the Nycuist frequency corresponding to the chosen sampling interval are folded back onto the amplitude spectrun of the digitized version of the signal.
This analysis can be extended to many sinusoids of different frequencies. In particular, the discrete time series derived from a too coarse sampling (undersampling) of t continuous signal actually contains contributions from high-frequency components of that contimous signal. Those high frequencies fold back onto the spectrum of the discrete time series and appear as lower frequencies. The phenomenon that is caused by undersampling the continuous signal is termed frequency aliasing.
To compute the alias frequency f a f a f_(a)f_{a}fa, use the following relation
f a = | 2 m f N f s | 1 f a = 2 m f N f s 1 f_(a)=|2mf_(N)-f_(s)|_(1)f_{a}=\left|2 m f_{N}-f_{s}\right|_{1}fa=|2mfNfs|1
where f . f . f_(.)f_{.}f.is the folding frequency, f s f s f_(s)f_{s}fs is the signal frequency, and m m mmm is an integer such that f a < f N f a < f N f_(a) < f_(N)f_{a}<f_{N}fa<fN. For example, suppose that f s = 65 H z , f N = 62.5 H z f s = 65 H z , f N = 62.5 H z f_(s)=65Hz,f_(N)=62.5Hzf_{\mathrm{s}}=65 \mathrm{~Hz}, f_{N}=62.5 \mathrm{~Hz}fs=65 Hz,fN=62.5 Hz, which corresponds to 8 m s 8 m s 8-ms8-\mathrm{ms}8ms sampling rate. The alias frequency then is f a = | 2 × 62.5 65 | = 60 H z f a = | 2 × 62.5 65 | = 60 H z f_(a)=|2xx62.5-65|=60Hzf_{a}=|2 \times 62.5-65|=60 \mathrm{~Hz}fa=|2×62.565|=60 Hz.
In conclusion, undersampling has two effects:
(a) band limiting the spectrum of the continuous signal, with the maximum frequency being the Nyquist, and
(b) contamination of the digital signal spectrum by high frequencies beyond the Nyquist, which may have been present in the continuous signal.
Nothing can be done about the first problem. The second problem is of practical importance. To keep the recoverable frequency band between zero and the Nyquist frequency free from aliased frequencies, a high-cut antialiasing filter is applied in the field before analog-todigital conversion of seismic signals. This filter eliminates those frequency components that would have been aliased during sampling. Typically, the high-cut antialiasing filter has a cutoff frequency that is either three-quarters or half of the Nyquist frequency. This filter rolls of steeply so that aliases of frequencies above the Nyquist are highly attenuated.

Phase Considerations

In the beginning of this section, a time-dependent signal was synthesized from its frequency components (Figure
1.1-2). Consider a signal with a zero-phase spectrum. Figure 1.1-11 shows sinusoids with frequencies ranging from approximately 1 to 32 H z 32 H z 32Hz32 \mathrm{~Hz}32 Hz. All of these sinusoids have zero-phase lag; thus, the peak amplitudes align at t = 0 t = 0 t=0t=0t=0. The time-domain signal on the trace iclentified by an asterisk in Figure 1.1-11 is synthesized by summing all these sinusoids a process describel by inverse Fourier transform. Such a time-domain sigual is called a wavelet. A wavelet usually is considered a transient signal, that is, a signal with a finite duration. It has a start time and an end time, and its energy is confined between these two time positions. The wavelet that was just constructed is symmetric around t = 0 t = 0 t=0t=0t=0 and has a (positive) peak amplitude at t = 0 t = 0 t=0t=0t=0. Such a wavelet is called zero phase. In fact, the wavelet was synthesized using the zero-phase sinusoids of equal peak amplitude.
A zero-phase wavelet is symmetric with respect to zero time and peaks at zero time. Figure 1.1-12 shows the result of applying a linear phase shift to the sinusoids in Figure 1.1-11. Linear phase shift is described by a function that represents a line in the frequency domain: ϕ = α ω ϕ = α ω phi=alpha omega\phi=\alpha \omegaϕ=αω, where α α alpha\alphaα is the slope constant and ω ω omega\omegaω is the angular frequency, which is the temporal frequency scaled by 2 π 2 π 2pi2 \pi2π. The wavelet, identified by an asterisk in Figure 1.1-12, has shifted in time by 0.2 s 0.2 s -0.2s-0.2 \mathrm{~s}0.2 s, but its shape has not changed. Thus, a lanear phase shift is equivalent to a constant tme shift. The slope of the lane describing the phase spectrum is proportional to the time shift.
The wavelet can be shifted by any amount of time simply by changing the slope of the line ϕ = α w ϕ = α w phi=alpha w\phi=\alpha wϕ=αw, that describes the phase spectrum. Starting with the zerophase wavelet, Figure 1.1-13 shows the effect of increasing amounts of the linear phase shift on a zero-phase wavelet. Although not shown, by changing the sign of the slope in the phase spectrum, the wavelet can be shifted in the opposite time direction.
If a 90-degree phase shift is applied to each of the sinusoids in Figure 1.1-11, as shown in Figure 1.1-14, then the zero crossings are aligned at t = 0 t = 0 t=0t=0t=0. The result of this summation yields the antisymmetric wavelet shown on the trace identifed by an asterisk. Note that the two wavelets in Figures 1.1-11 and 1.1-14 have the same amplitude spectrum because they have been synthesized from the sinusoidal components with the same peak amplitude and frequency. The difference lies in their phase spectra. The wavelet in Figure 1.1-11 has zero-phase spectrum, while that in Figure 1.1-14 has a constant-phase spectrum (+90 degrees). Therefore, the difference in wavelet shape is a result of the difference in their phase spectra.
Figure 1.1-15 shows the effect of varions anounts of constant phase shift on a zero-phase wivelet. The 90-degree phase shift converts the zero-phase wavelet
FIG. 1.1-11. Summation of a discrete number of sinusoids with no phase-lag, but with the same peak amplitude, yields a band-limited symmetric wavelet represented by the trace on the right (denoted by an asterisk). This is a zero-phase wavelet.
an antisymmetric wavelet. The 180 -degree phase shift changes the polarity of the zero-phase wavelet. The 270 -degree phase shift changes the polarity of the zerophase wavelet, while converting it to an antisymmetric wavelet. Finally, the 360 -degree phase shift retains the shape of the original wavelet. A constent phase shift to changes the shape of a wavelet. In partucular, a 90 degree phase shyf converts a symmetric wavelet to an antzsymmetric wavelet, while a 180 -degree phase shift changes th polanty.
Figure 1.1-16 shows a portion of a seismic section with the application of different degrees of constant phase rotation. Note the change in the wavelet character of the significant reflections. This difference in wavelet character has an impact on picking events for interpretation. When comparing displays of two different sections, which may be associated with two different vintages of processing of the same data or two different lines from the same survey, the wavelet character of the reflection event that is being picked must be consistent from one section to another. A common mistake
FIG. 1.1-12. The same sinusoidal components as in Figure 1.1-11, but with a -0.2 s constant-time delay. When summed, these sinusoids yield a band-limited symmetric wavelet that is represented by the trace on the right (denoted by an asterisk). This wavelet is the same as that shown in Figure 1.1-11, except that it is shifted in time by 0.2 s 0.2 s -0.2s-0.2 \mathrm{~s}0.2 s. This time shift is related to the linear phase spectrum associated with the summed frequency components.
is displaying two sections to be compared with opposite polarity. The polarity convention set by the Society of Exploration Geophysicists is based on a negative water-botton reflection coefficient, which corresponds to a positive polarity.
So far, two basic phase spectra have been examined
linear and constant phase shifts. We now examine their combined effect. The phase spectrum is defined by a function ϕ = ϕ 0 + α ω ϕ = ϕ 0 + α ω phi=phi_(0)+alpha omega\phi=\phi_{0}+\alpha \omegaϕ=ϕ0+αω, where ϕ 0 ϕ 0 phi_(0)\phi_{0}ϕ0 is the constant phase shift and α α alpha\alphaα is the slope of the linear phase shift. Figure 1.1-17 shows the result of applying a linear phase shift (as in Figure 1.1-12) plus a 90-degree constant phase shift (as in Figure 1.1-14) to the sinusoids in Figure 1.1-11. The zero-phase wavelet with the same amplitude spectrum as that in Figure 1.1-11 was shifted in time by 0.2 s 0.2 s -0.2s-0.2 \mathrm{~s}0.2 s because of the linear phase shift, and converted to an antisymmetric form because of the constant 90 degree phase shift.
(a)
(b)
(c)
(d)
(e)
FIG. 1.1-13. Starting with a zero-phase wavelet (a), linear phase shifts are applied to shift the wavelet in time without changing its shape. The slope of the linear phase finction is related to the time shift.
FIG. 1.1-14. The same sinusoidal components as in Figure 1.1-11 but with a constant 90-degree phase shift applied to each. The zero crossings are aligned at t = 0 t = 0 t=0t=0t=0. Summation of these sinusoids yields an antisymmetric wavelet that is represented by the trace on the right (denoted by an sasterisk).
Other variations in phase spectrum are shown in Figure 1.1-18. The zero-phase wavelet (Figure 1.1-18a) can be modified to different shapes simply by changing the phase spectrum. It can be modified to the extent that it may no longer resemble the original wavelet shape as illustrated by the last example (Figure 1.118d). By keeping the amplitude spectrum unchanged, the wavelet shape can be changed by modufyng the phase spectrum.

Time-Domain Operations

Consider a reflectivity sequence represented by the time series ( 1 , 0 , 1 2 ) 1 , 0 , 1 2 (1,0,(1)/(2))\left(1,0, \frac{1}{2}\right)(1,0,12). Also consider an impulsive source that causes an explosion at t = 0 t = 0 t=0t=0t=0 with an amplitude of 1 . The response of the reflectivity sequence to an impulse is called the mpulse response. This physical process can be described as in Table 1-1.
Table 1-1. Response of the reflectivity sequence ( 1 , 0 , 1 2 ) 1 , 0 , 1 2 (1,0,(1)/(2))\left(1,0, \frac{1}{2}\right)(1,0,12) to a zero-delay explosive impulse ( 1 , 0 ) ( 1 , 0 ) (1,0)(1,0)(1,0).
Time of
Onset
Time of Onset| Time of | | :--- | | Onset |
Reflectivity
Sequence
Reflectivity Sequence| Reflectivity | | :---: | | Sequence |
Source Response
0 10 1 2 1 2 (1)/(2)\frac{1}{2}12 1 0 1 0 1 2 1 2 (1)/(2)\frac{1}{2}12 0
"Time of Onset" "Reflectivity Sequence" Source Response 0 10 (1)/(2) 1 0 1 0 (1)/(2) 0| Time of <br> Onset | Reflectivity <br> Sequence | Source | Response | | | | | | | :--- | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | | 0 | 10 | $\frac{1}{2}$ | 1 | 0 | 1 | 0 | $\frac{1}{2}$ | 0 |
(a)
(b)
(c)
(d)
(e)
FIG. 1.1-15. Starting with the zero-phase wavelet (a), its shape is changed by applying constant phase shifts. A 90-degree phase shift converts the zero-phase wavelet to an antisymmetric wavelet (b), whle a 180-degree phase shift reverses its polarity (c). A 270-degree phase shift reverses the polarity, while making the wavelet antisymmetric (d). Finally, a 360-degree phase shift docs not modify the wavelet (e).
FIG. 1.1-16. A portion of a seismic section with different degrees of constant phase rotations.
FIG. 1.1-17. A linear (as in Figure 1.1-12) combined with a constant phase shift (as in Figure 1.1-14) results in a timeshifted antisymmetric wavelet. The wavelet is represented by the trace on the right (denoted by an asterisk).
Table 1-2. Response of the reflectivity sequence ( 1 , 0 , 1 2 ) 1 , 0 , 1 2 (1,0,(1)/(2))\left(1,0, \frac{1}{2}\right)(1,0,12) to a unit-delay implosive impulse ( 0 , 1 2 ) 0 , 1 2 (0,-(1)/(2))\left(0,-\frac{1}{2}\right)(0,12).
Time of
Onset
Time of Onset| Time of | | :--- | | Onset |
Reflectivity
Sequence
Reflectivity Sequence| Reflectivity | | :---: | | Sequence |
Source Response
1 1 0 1 2 1 2 (1)/(2)\frac{1}{2}12 0 1 2 1 2 -(1)/(2)-\frac{1}{2}12 0 1 2 1 2 -(1)/(2)-\frac{1}{2}12 0 1 4 1 4 -(1)/(4)-\frac{1}{4}14
"Time of Onset" "Reflectivity Sequence" Source Response 1 1 0 (1)/(2) 0 -(1)/(2) 0 -(1)/(2) 0 -(1)/(4)| Time of <br> Onset | Reflectivity <br> Sequence | Source | Response | | | | | | | | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | | 1 | 1 | 0 | $\frac{1}{2}$ | 0 | $-\frac{1}{2}$ | 0 | $-\frac{1}{2}$ | 0 | $-\frac{1}{4}$ |
One unit time later, suppose that the impulsive source generates an implosion with an amplitude of 1 2 1 2 -(1)/(2)-\frac{1}{2}12. This response is described in Table 1-2.
Note that the response in each case is the reflectivity sequence scaled by the impulse strength and delayed by the impulse onset. Since a general source function is considered to be a sequence of explosive and implosive impulses, the individual impulse responses are added to obtain the combined response. This process is called hnear superposition and is described in Table 1-3.

Convolution

In Table 1-3, the asterisk denotes convolution. The response of the reflectivity sequence ( 1 , 0 , 1 2 ) 1 , 0 , 1 2 (1,0,(1)/(2))\left(1,0, \frac{1}{2}\right)(1,0,12) to the source wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) was obtained by convolving the two series. This is done computationally as shown in Ta-
(a)
(b)
(c)
(d)
FIG. 1.1-18. The shape of a zero-phase wayelet (a) can be modified by introducing a nonzero-phase spectrom of any form as in (b), (c), and (d).
Table 1-3. Linear superposition of the two responses described in Tables 1-1 and I-2.
Time of
Onset
Time of Onset| Time of | | :--- | | Onset |
Reflectivity
Sequence
Reflectivity Sequence| Reflectivity | | :---: | | Sequence |
Source Response
0 1 0 1 2 1 2 (1)/(2)\frac{1}{2}12 1 0 1 0 1 2 1 2 (1)/(2)\frac{1}{2}12 0
1 1 0 1 2 1 2 (1)/(2)\frac{1}{2}12 0 1 2 1 2 -(1)/(2)-\frac{1}{2}12 0 1 2 1 2 -(1)/(2)-\frac{1}{2}12 0 1 4 1 4 -(1)/(4)-\frac{1}{4}14
Superposition: 1 1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 2 1 2 (1)/(2)\frac{1}{2}12 1 4 1 4 -(1)/(4)-\frac{1}{4}14
"Time of Onset" "Reflectivity Sequence" Source Response 0 1 0 (1)/(2) 1 0 1 0 (1)/(2) 0 1 1 0 (1)/(2) 0 -(1)/(2) 0 -(1)/(2) 0 -(1)/(4) Superposition: 1 -(1)/(2) 1 -(1)/(2) (1)/(2) -(1)/(4) | Time of <br> Onset | Reflectivity <br> Sequence | Source | | | | Response | | | | | :--- | ---: | ---: | ---: | ---: | ---: | ---: | ---: | ---: | ---: | | 0 | 1 | 0 | $\frac{1}{2}$ | 1 | 0 | 1 | 0 | $\frac{1}{2}$ | 0 | | 1 | 1 | 0 | $\frac{1}{2}$ | 0 | $-\frac{1}{2}$ | 0 | $-\frac{1}{2}$ | 0 | $-\frac{1}{4}$ | | Superposition: | | 1 | $-\frac{1}{2}$ | 1 | $-\frac{1}{2}$ | $\frac{1}{2}$ | $-\frac{1}{4}$ | | |
Expressed differently: ( 1 , 0 , 1 2 ) ( 1 , 1 2 ) = ( 1 , 1 2 , 1 2 , 1 4 ) 1 , 0 , 1 2 1 , 1 2 = 1 , 1 2 , 1 2 , 1 4 (1,0,(1)/(2))**(1,-(1)/(2))=(1,-(1)/(2),(1)/(2),-(1)/(4))\left(1,0, \frac{1}{2}\right) *\left(1,-\frac{1}{2}\right)=\left(1,-\frac{1}{2}, \frac{1}{2},-\frac{1}{4}\right)(1,0,12)(1,12)=(1,12,12,14)
ble 1-4. A fixed array is set up from the reflectivity sequence. The source wavelet is reversed (folded) and moved (lagged) one sample at a time. At each lag, the elements that align are multiplied and the resulting products are summed.
The mechanics of convolution are described in Table 1-5. The number of elements of output array c k c k c_(k)c_{k}ck is given by m + n 1 m + n 1 m+n-1m+n-1m+n1, where m m mmm and n n nnn are the lengths of the operand array a i a i a_(i)a_{i}ai and the operator array b j b j b_(j)b_{j}bj, respectively.
When the roles of the arrays in Table 1-4 are interchanged, the output array in Table 1-6 results. Note that the output response is identical to that in Table 1-4. Hence, convolution s commutative it does not matter which array is fixed and whech is moved, the output is the same.

Crosscorrelation and Autocorrelation

Seismic data processing often requires measurement of the similarity or time alignment of two traces. Correla-
Table 1-4. Convolution of the source wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) with the reflectivity sequence ( 1 , 0 , 1 2 1 , 0 , 1 2 (1,0,(1)/(2):}\left(1,0, \frac{1}{2}\right.(1,0,12 ).
Reflectivity
Sequence
Reflectivity Sequence| Reflectivity | | :---: | | Sequence |
Output
Response
Output Response| Output | | ---: | | Response |
1 2 1 2 (1)/(2)\frac{1}{2}12
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1
1 2 1 2 -(1)/(2)-\frac{1}{2}12
1 1 2 1 2 (1)/(2)\frac{1}{2}12
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 1 4 1 4 -(1)/(4)-\frac{1}{4}14
"Reflectivity Sequence" "Output Response" (1)/(2) -(1)/(2) 1 -(1)/(2) 1 (1)/(2) -(1)/(2) 1 -(1)/(4)| Reflectivity <br> Sequence | | Output <br> Response | | | :---: | :---: | :---: | :---: | | | $\frac{1}{2}$ | | | | $-\frac{1}{2}$ | | | 1 | | | | | $-\frac{1}{2}$ | | | 1 | | $\frac{1}{2}$ | | | $-\frac{1}{2}$ | 1 | $-\frac{1}{4}$ |
Table 1-5. Mechanics of the convolutional process.
Fixed Array:
a 0 , a 1 , a 2 , a 3 , a 4 , a 5 , a 6 , a 7 a 0 , a 1 , a 2 , a 3 , a 4 , a 5 , a 6 , a 7 a_(0),a_(1),a_(2),a_(3),a_(4),a_(5),a_(6),a_(7)a_{0}, a_{1}, a_{2}, a_{3}, a_{4}, a_{5}, a_{6}, a_{7}a0,a1,a2,a3,a4,a5,a6,a7
Moving Array:
b 0 , b 1 , b 2 b 0 , b 1 , b 2 b_(0),b_(1),b_(2)b_{0}, b_{1}, b_{2}b0,b1,b2
Given two arrays, a 2 a 2 a_(2)a_{2}a2 and b j b j b_(j)b_{j}bj :
Step 1 : Reverse moving array b b bbb.
Step 2 : Multiply in the vertical direction.
Step 3 : Add the products and write as output c k c k c_(k)c_{k}ck.
Step 4 : Shift array b b bbb, one sample to the right and repeat Steps 2 and 3.
Convolution Table:
where
c k = ȷ = 0 n a k ȷ b ȷ , k = 0 , 1 , 2 , , m + n 1 . c k = ȷ = 0 n a k ȷ b ȷ , k = 0 , 1 , 2 , , m + n 1 . c_(k)=sum_(ȷ=0)^(n)a_(k-ȷ)b_(ȷ),quad k=0,1,2,cdots,m+n-1.c_{k}=\sum_{\jmath=0}^{n} a_{k-\jmath} b_{\jmath}, \quad k=0,1,2, \cdots, m+n-1 .ck=ȷ=0nakȷbȷ,k=0,1,2,,m+n1.
Table 1-6. Convolution of the reflectivity sequence ( 1 , 0 , 1 2 ) 1 , 0 , 1 2 (1,0,(1)/(2))\left(1,0, \frac{1}{2}\right)(1,0,12) with the source wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12).
Table 1-7. Crosscorrelation of wavelet 1 with wavelet. 2.
2 1 -1 0 0 Output Lag
0021 -2 -4
002 1 1 -3
00 2 1 -1 6 -2
0 0 2 -1 1 -1
0 0 2 1 -1 -2 0
0 0 2 1. 0 1
0 0 2 1 0 2
0 0 2 1 1 1 1 1-11-111 0 3
0 0 2 1 1 2 1 1 2quad1-12 \quad 1-1211 0 4
2 1 -1 0 0 Output Lag 0021 -2 -4 002 1 1 -3 00 2 1 -1 6 -2 0 0 2 -1 1 -1 0 0 2 1 -1 -2 0 0 0 2 1. 0 1 0 0 2 1 0 2 0 0 2 1-1 0 3 0 0 2quad1-1 0 4| | 2 | 1 | -1 | 0 | 0 | | | Output | Lag | | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | | 0021 | | | | | | | | -2 | -4 | | 002 | 1 | | | | | | | 1 | -3 | | 00 | 2 | 1 | -1 | | | | | 6 | -2 | | 0 | 0 | 2 | | -1 | | | | 1 | -1 | | | 0 | 0 | 2 | 1 | -1 | | | -2 | 0 | | | | 0 | 0 | 2 | 1. | | | 0 | 1 | | | | | 0 | 0 | 2 | 1 | | 0 | 2 | | | | | | 0 | 0 | 2 | $1-1$ | 0 | 3 | | | | | | | 0 | 0 | $2 \quad 1-1$ | 0 | 4 |
tron is another time-domain operation that is used to make such measurements. Consider the following two wavelets:
Whvelet 1: ( 2 , 1 , 1 , 0 , 0 ) ( 2 , 1 , 1 , 0 , 0 ) (2,1,-1,0,0)(2,1,-1,0,0)(2,1,1,0,0)
Wavelet 2: ( 0 , 0 , 2 , 1 , 1 ) ( 0 , 0 , 2 , 1 , 1 ) (0,0,2,1,-1)(0,0,2,1,-1)(0,0,2,1,1)
Although these wavelets are identical in shape, wavelet 2 is shifted by two samples with respect to wavelet 1 . The time lag at which they are most similar can be determined. To do this, perform the operation on wavelet 1 as described in Table 1-5 without reversing wavelet 2 (omit Step 1). This is crosscorrelation and the result is shown in Table 1-7. Crosscorrelation measures how much two time series resemble each other.
From Table 1-7, note that maximum correlation occurs at lag -2 . This suggests that if wavelet 2 were shifted two samples back in time, then these two wavelets would have maximum similarity.
Table 1-8 shows the crosscorrelation values that result when the arrays are interchanged. This time the maximum correlation occurs at lag 2 . Thus, if wavelet
Table 1-8. Crosscorrelation of wavelet 2 with wavelet 1.
Table 1-9. Crosscorrelation of wavelet 1 with wavelet 2 and crosscorrelation of wavelet 2 with wavelet I.
Wavelet 1
with Wavelet 2
Wavelet 1 with Wavelet 2| Wavelet 1 | | ---: | | with Wavelet 2 |
Crosscorrelation
Output Lag
Crosscorrelation Output Lag| Crosscorrelation | | ---: | | Output Lag |
Wavelet 2
with Wavelet 1
Wavelet 2 with Wavelet 1| Wavelet 2 | | ---: | | with Wavelet 1 |
-2 -4 0
1 -3 0
6 -2 0
1 -1 0
-2 0 -2
0 1 1
0 2 6
0 3 1
0 4 -2
"Wavelet 1 with Wavelet 2" "Crosscorrelation Output Lag" "Wavelet 2 with Wavelet 1" -2 -4 0 1 -3 0 6 -2 0 1 -1 0 -2 0 -2 0 1 1 0 2 6 0 3 1 0 4 -2| Wavelet 1 <br> with Wavelet 2 | Crosscorrelation <br> Output Lag | Wavelet 2 <br> with Wavelet 1 | | :---: | :---: | :---: | | -2 | -4 | 0 | | 1 | -3 | 0 | | 6 | -2 | 0 | | 1 | -1 | 0 | | -2 | 0 | -2 | | 0 | 1 | 1 | | 0 | 2 | 6 | | 0 | 3 | 1 | | 0 | 4 | -2 |
1 were shifted by two samples forward in time, these two wavelets would have maximum similarity.
Unlike convolution, crosscorrelation is not commutatwe the output depends on which array is fixed and which is moved. Table 1-9 shows a comparison of the crosscorrelation results listed in Tables 1-7 and 1-8.
Crosscorrelation of a time series with itself is known as autocorrelation. Table 1-10 shows the autocorrelation lags of wavelet 1 . Note that maximum correlation occurs at zero lag, an important property of autocorrelation. Moreover, the autocorrelotion function as symmetric. This is a property of a real time series. Therefore, only one side of the antocorrelation needs to be computed.
It is heuristically shown in the next section on frequency filtering that convolution in the time domain is equivalent to multiplication in the frequency domain (Bracewell, 1965). Since correlation is a convolution without reversing the moving array (Table 1-5), a simi-
Table 1-10. Autocorrelation of wavelet 1.
FIG. 1.1-19. The frequency-domain description of convolution and correlation.
lar frequency-domain operation also applies to correlation.
Figure 1.1-19 is a summary of frequency-domain descriptions of convolution and correlation. Note the following properties for convolution and correlation:
(a) Both convolution and correlation produce an output with a spectral bandwidth that is common to both of the input series. The immediate example is the band-pass filtering process.
(b) Phases are additive in case of convolution and subtractive in case of correlation (Bracewell, 1965).
(c) For autocorrelation, this implies that the output series is zero-phase. This fact already was verified by the example in Table 1-10 where it was shown that the autocorrelation is symmetric with respect to zero lag.
As a measure of similarity, crosscorrelation is used widely at various stages of data processing. For instance, traces in a CMP gather are crosscorrelated with a pilot trace to compute residual statics shifts (Section 3.3). The fundamental basis for computing velocity spectra is crosscorrelation (Section 3.2). The constituent elements of the Wiener filter (Section 2.3) are crosscorrelation of the desired output waveform with the input wavelet, and autocorrelation of the input wavelet.

Vibroseis Correlation

One other important process is the vibroseis correlation. This involves crosscorrelation of a swecp signal with the recorded vibroseis trace. The sweep is a frequencymodulated vibroseis source signal input to the ground.
The convolutional model for vibroseis data is described in Section 2.5.
Figure 1.1-20 shows a vibroseis sweep signal, a recorded common-source gather, and the correlated gather. The sweep length is 10 s 10 s 10s10 \mathrm{~s}10 s with a frequency band of 6 to 60 H z 60 H z 60Hz60 \mathrm{~Hz}60 Hz. The 15-s uncorrelated vibroseis record yields a 5 -s correlated record. Note that the early part of the uncorrelated record contains low-frequency energy with increasingly higher frequencies at late times. This is because an upsweep (frequency increasing with time) signal was used in this data example.

Frequency Filtering

What happens to a wavelet when its amplitude spectrum is changed while its zero-phase character is preserved? To begin, consider the wavelet in Figure 1.1-21 (summed trace 1) resulting from superposition of two very low-frequency components. Then, add increasingly higher frequency components to the Fourier synthesis (summed traces 2 through 5). Note that the wavelet in the time domain is compressed as the frequency bandwidth (the range of frequencies summed) is increased. Ultimately, if all the frequencies in the inverse Fourier transformation are included, then the resulting wavelet becomes a spike, as seen in Figure 1.1-22 (summed trace 6). Therefore, a spike is characterized as the in-phase synthesis of all frequencies from zero to the Nyquist. For all frequencies, the amplitude spectrum of a spike is unity, while its phase spectrum is zero.
Figure 1.1-23 shows five zero-phase wavelets, synthesized as shown in Figure 1.1-21. Note that all of them have band-limited amplitude spectra. A zerophase band-limited wavelet can be used to filter a seismic trace. The output trace contains only those frequencies that make up the wavelet used in filtering. The time-domain representation of the wavelet is the filter operator. The individual time samples of this operator are the filter coefficients. The process described here is zero-phase frequency filtering, since it does not modify the phase spectrum of the input trace, but merely band-limits its amplitude spectrum.
Frequency-domain filtering involves multiplying the amplitude spectrum of the input seismic trace by that of the filter operator. The procedure is described in Figure 1.1-24. On the other hand, the filtering process in the time domain involves convolving the filter operator with the input time series. Figure 1.1-25 is a description of the filter design and its time-domain application. The frequency- and time-domain formulations of the filtering process (Figures 1.1-24 and 1.1-25) are besed on the following important concept in time series
FIG. 1.1-20. Vibroseis correlation: the sweep signal is correlated with the recorded vibroseis record to get correlated field data. A 10 -s sweep and 15 -s recorded data yield a 5 -s correlated record.
analysis (Section A.1): Convolution in the tome doman is equivalent to multiplication in the frequency domain. Similarly, convolution in the frequency domain is equvalent to multaplicatron on the trme doman.
Frequency filtering can be in the form of band-pass, band-reject, high-pass (low-cut), or low-pass (high-cut) filters. All of these filters are based on the same principle - construction of a zero-phase wavelet with an amplitude spectrum that meets one of the four specifcations
Band-pass filtering is used most commonly, because a seismic trace typically contains some low-frequency noise, such as ground roll, and some high-frequency ambient noise. The usable seismic reflection energy usually is confined to a bandwidth of approximately 10 to 70 H z H z Hz\mathrm{Hz}Hz, with a dominant frequency around 30 H z 30 H z 30Hz30 \mathrm{~Hz}30 Hz.
Band-pass filtering is performed at various stages in data processing. If necessary, it can be performed before deconvolution to suppress remaining ground-roll energy and high-frequency ambient noise that otherwise would contaminate signal autocorrelation. Narrow band-pass filtering may be necessary before crosscorrelating traces in a CMP gather with a pilot trace for use in estimating residual statics shifts (Section 3.3).
FIG, 1.1-21. The summation of zero-phase sinusoids with identical peak amplitudes. Traces resulting from each summation are numbered from 1 to 5 . As the frequency bandwidth is increased, the synthesized zero-phase wavelet is increasingly compressed.
FIG. 1.1-22. The output wavelet becomes a spike (summed trace 6) when the summation includes sinusoids at all frequencies up to the Nyquist frequency, Compare this with output treses 1 through 5 in Figure 1.1-21.
(a)
(b)
(c)
(d)
(e)
FIG. 1.1-23. A series of zero-phase wavelets (top row) and their respective amplitude spectra (bottom row). As bandwidth is increased, the wavelet is more compressed in time.
Band-pass filtering also can be performed before computing crosscorrelations during construction of the velocity spectrum for improved velocity picking (Section 3.2). Finally, it is a standard practice to apply a timevariant band-pass filter to stacked data (Section 1.5).

Practical Aspects of Frequency Filtering

Application of a filter in the frequency or time domain (Figures 1.1-24 and 1.1-25) yields basically identical results. In practice, the time-domain approach is favored, since convolution involving a short array, such as a filter operator, is more economical than applying Fourier transforms.
FIG. 1.1-24. Design and application of a zero-phase filter in the frequency domain.
From Figure 1.1-23, the fundamental property of frequency filters can be stated as follows: The broader the bandwedth, the more compressed the filter operator; thus, fewer filter coefficuents are requared. This property also follows from the fundamental concept that the trme span of a time serzes is inversely proportional to ats spectral bandwidth.
In designing a band-pass filter, the goal is to pass a certain bandwidth with little or no modification, and to largely suppress the remaining part of the spectrum as much as practical. At first, it appears that this goal can be met by defining the desired amplitude spectrum for the filter operator as follows:
A ( f ) = { 1 , f 1 < f < f 2 0 , otherwise, A ( f ) = 1 , f 1 < f < f 2 0 ,  otherwise,  A(f)={[1",",f_(1) < f < f_(2)],[0","," otherwise, "]:}A(f)= \begin{cases}1, & f_{1}<f<f_{2} \\ 0, & \text { otherwise, }\end{cases}A(f)={1,f1<f<f20, otherwise, 
FIG. 1.1-25. Design of a zero-phase frequency filter and its application in the time domain.
TIME TME I
(a)
TIME IM EC
(b)
TIME { M E C ) { M E C ) {MEC)\{M E C){MEC)
(c)
FIG. 1.1-26. Three zero-phase wavelets (top row) and their respective amplitude spectra (bottom row). (a) The steeply defined slopes of the passband cause ripples in the wavelet and the actual amplitude spectrum. (b) A moderate and (c) gentle slope help eliminate the ripples. Refer to the text for a discussion of corner frequencies A 1 , B , C A 1 , B , C A_(1),B,CA_{1}, B, CA1,B,C, and D D DDD.
where f 1 f 1 f_(1)f_{1}f1 and f 2 f 2 f_(2)f_{2}f2 are the cutoff frequencies. This is known as the boxcar amplitude spectrum.
To analyze the properties of such a filter, perform the following sequence of operations:
(a) Define a boxcar amplitude spectrum and zero phase spectrum.
(b) Apply inverse FFT and obtain a filter operator.
(c) Truncate the operator.
(d) Apply forward FFT and compute the amplitude spectrum of the truncated operator.
Figure 1.1-26a shows the results of this sequence of operations. The operator is at the top, and the actual and desired (boxcar) amplitude spectra are superimposed at the bottom. Note that the actual spectrum has a ringy character. This is known as the Gibbs phenomenon (Bracewell, 1965), and results from representing a boxcar with a finite number of Fourier coefficients. From a practical standpoint, the ringing is undesirable, since some of the frequencies in the passband are amplified, while others are attenuated. Additionally, some of the frequencies in the reject zones on both sides of the boxcar are passed.
How is the Gibbs phenomenon circumvented? Instead of defining the desired passband as a boxcar, assign slopes on both sides as shown in Figure 1.1 26 b 26 b 26b26 \mathrm{~b}26 b, and thus define the passband as a trapezoid. Note that the actual and desired amplitude spectra are now closer in agreement and the operator is more compact (it has fewer nonzero coefficients). However, in achieving a more compact operator, the shape of the desired spectrum has been compromised and the passband is broader than intended. The trapezoid slopes must be sufficiently gentle to achieve a satisfactory result as in Figure 1.1-26c, where the actual and desired spectra are approximately equal and the operator is compact. This is most desirable in practice, since it is best to work with operators that are as short as possible. It is recommended that a gentler slope be assigned on the high-frequency side relative to the low-frequency side of the passband. Finally, while defining the passband as a trapezoid, smoothing also must be applied at the
(a)
(b)
(c)
(d)
(e)
FIG. 1.1-27. Solid bars indicate the live length (nonzero coefficients) of the band-pass filter operator. Severe truncation (a) causes significant departure of the actual amphtude spectrum from the desired (trapezoid) amplitude spectrum, which is the same in all five cases.
corner frequencies (A, B, C, and D D DDD, as indicated in Figure 1.1-26c). This must be done because the Fourier transform exists only for continuous functions (Bracewell, 1965).
How short can the operator be? Figure 1.1-27 shows a sequence of increasingly longer operators. Solid bars indicate the operator length of the truncated filters. Note that excessive truncation causes a large deviation from the desired amplitude spectrum even though reasonable slopes were provided to the passband. Extension of the operator length brings the desired and actual spectra closer. However, there is a certain length beyond which nearly zero coefficients are added to the operator. The criterion that is used to define the operator length is that the frequency bandundth os unversely proportional to the effectrve length of the operator.

Bandwidth and Vertical Resolution

Frequency filtering is intimately tied to vertical (temporal) resolution of seismic data. Consider the filter operators in Figure 1.1-28. Both have the same effective bandwidth - the difference between the high-cut and low-cut frequencies. Therefore, the envelopes of the two operators are identical. The greater ringyness of the second operator (Figure 1.1-28b) results from its lower bandwidth ratio the ratio of the high-cut to the lowcut frequency.
There is a common misunderstanding that only high frequencies are needed to increase temporal resolution. This is not true. The top frame in Figure 1.1-29 shows a single refector and three sets of closely situated reflectors with 48 , 24 48 , 24 48-,24-48-, 24-48,24 and 12 m s 12 m s 12-ms12-\mathrm{ms}12ms time separations. A series of narrow band-pass filters is applied to these data as shown in the lower frames. The reflectors with the 48 -ms separation are resolved reasonably well by using the 10 t o 20 H z 10 t o 20 H z 10-to-20-Hz10-\mathrm{to}-20 \mathrm{-Hz}10to20Hz bandwidth. However, the more closely
FIG. 1.1-28. Two wavelets (top row) with the same bandwidth (bottom row). The passband of wavelet (B) is centered at 15 H z 15 H z 15Hz15 \mathrm{~Hz}15 Hz, while that of wavelet (b) is centered at 35 H z 35 H z 35Hz35 \mathrm{~Hz}35 Hz. Both wavelets have ripples, although one is low and the other is high frequency in character. Just having low or high frequencies does not suffice; both are needed to increase temporal resolution.

10 20 H z 10 20 H z 10-20Hz10-20 \mathrm{~Hz}1020 Hz

20 30 H z 20 30 H z 20-30Hz20-30 \mathrm{~Hz}2030 Hz

30 40 H z 30 40 H z 30-40Hz30-40 \mathrm{~Hz}3040 Hz

40 50 H z 40 50 H z 40-50Hz40-50 \mathrm{~Hz}4050 Hz

50 60 H z 50 60 H z 50-60Hz50-60 \mathrm{~Hz}5060 Hz

FIG. 1.1-29. The top section is a reflectivity model that consists of, from left to right, three reflector with 48 m s 48 m s 48-ms48-\mathrm{ms}48ms separation, three reflectors with 24 m s 24 m s 24-ms24-\mathrm{ms}24ms separation, three reflectors with 12-ms separation, and a single reflector - all centered at 1 s 1 s 1s1 \mathrm{~s}1 s. Band-limited responses (the same bandwidth, 10 H z 10 H z 10Hz10 \mathrm{~Hz}10 Hz, centered at different frequencies) do not provide good resolution.
situated reflectors cannot be resolved with this filter. For the 20 20 20-20-20 to 30 H z 30 H z -30-Hz-30-\mathrm{Hz}30Hz bandwidth, again, the 48 m s 48 m s 48-ms48-\mathrm{ms}48ms reflectors are reasonably separated. Nevertheless, none of the narrow band-pass filters provides the resolution needed to distinguish the reflectors situated with smaller separations. Just havng low or high frequencies does not
FIG. 1.1-30. The top section is the same reflectivity model as in Figure 1.1-29. Reflectors with large separation ( 48 m s 48 m s 48ms48 \mathrm{~ms}48 ms ) are resolvable with a bandwidth as low as 10 to 30 H z 30 H z 30Hz30 \mathrm{~Hz}30 Hz. However, reflectors with smaller separation ( 24 and 12 m s 12 m s 12ms12 \mathrm{~ms}12 ms ) require increasingly larger bandwidths for resolution.
improve temporal resolution. Both low and high frequencaes are needed to nncrease temporal resolution. This is demonstrated further in Figure 1.1-30. Note that closely situated reflectors can be resolved only with increasingly broader bandwidth. The 10 t o 30 H z 10 t o 30 H z 10-to-30-Hz10-\mathrm{to}-30-\mathrm{Hz}10to30Hz bandwidth is sufficient to resolve the reflectors with 48 m s 48 m s 48-ms48-\mathrm{ms}48ms separation. The 10 10 10-10-10 to 50 H z 50 H z -50-Hz-50-\mathrm{Hz}50Hz bandwidth is sufficient to resolve the reflectors with 24 -ms separation. Finally, the 10 to 100 H z 100 H z -100-Hz-100-\mathrm{Hz}100Hz bandwidth is needed to resolve the reflectors that are separated by 12 m s 12 m s 12ms12 \mathrm{~ms}12 ms. There is a close relationship between the amount of separation and the desired bandwidth (Section 11.1).

Time-Variant Filtering

The seismic spectrum, especially the high-frequency end, is subject to absorption along the propagation path because of the intrinsic attenuation of the earth (Section 1.4). Consider the portion of a stacked section and its narrow band-pass filtered panels in Figure 1.1-31. A signal is present from top to bottom within the 10-to-20-, 20-to-30-, 30-to-40-, and 40 40 40-40-40 to- 50 H z 50 H z 50-Hz50-\mathrm{Hz}50Hz bands. Not much signal is noted below 3.5 s 3.5 s 3.5s3.5 \mathrm{~s}3.5 s in the 50 t o 60 H z 50 t o 60 H z 50-to-60-Hz50-\mathrm{to}-60-\mathrm{Hz}50to60Hz band. Nevertheless, the signal content appears to be retained down to 3.5 s 3.5 s 3.5s3.5 \mathrm{~s}3.5 s with the 60 t o 70 H z 60 t o 70 H z 60-to-70-Hz60-\mathrm{to}-70-\mathrm{Hz}60to70Hz band. Finally, the 70 70 70-70-70 to- 80 H z 80 H z 80-Hz80-\mathrm{Hz}80Hz band shows signal down to 2.5 s 2.5 s 2.5s2.5 \mathrm{~s}2.5 s. Higher frequency bands of useful signal are confined to the shallow part of the section. Thus, temporal resolution is reduced greatly in the deeper portion of the section.
From a practical standpoint, the time-variant character of the signal bandwidth requires an application of frequency filters in a time-varying manner. By so doing, the ambient noise, which begins to dominate the signal at late times, is excluded and a section with a higher signal-to-noise ratio is obtained. Table 1-11 lists the time-variant filter (TVF) parameters selected from the panels in Figure 1.1-31. The filtered section is shown on the far right panel of the same figure. In practice, the filters are blended across adjacent time windows to establish a smooth transition of the passband regions.
A second band-pass series of filter scans, which is shown in Figure 1.1-32, allows an assessment of the right choice of the bandwidth for a given time gate. Here, we start with a narrow band-pass filter at the lowfrequency end of the spectrum and gradually broaden the passband by including higher frequencies
For some data, the bandwidth may be kept quite large from top to bottom. The stacked section in Figure 1.1-32 can tolerate wide-band filtering from early to late times. The filter panels for the stacked section in Figure 1.1-33, however, indicate that the signal band rapidly becomes confined to lower frequencies at late times. A signal is present from top to bottom within the
Table 1-11. Time-variant filter parameters for the data shown in Figure 1.1-31. The frequency values correspond to the corner frequencies described in Figure 1.126 .
Time,
ms
Time, ms| Time, | | :---: | | ms |
Filter Band,
H z H z Hz\mathrm{Hz}Hz
Filter Band, Hz| Filter Band, | | :---: | | $\mathrm{Hz}$ |
0 5 , 1070 , 80 5 , 1070 , 80 5,1070,805,1070,805,1070,80
2500 5 , 1060 , 70 5 , 1060 , 70 5,1060,705,1060,705,1060,70
3500 5 , 10 50 , 60 5 , 10 50 , 60 5,10-50,605,10-50,605,1050,60
5000 5 , 10 40 , 50 5 , 10 40 , 50 5,10-40,505,10-40,505,1040,50
"Time, ms" "Filter Band, Hz" 0 5,1070,80 2500 5,1060,70 3500 5,10-50,60 5000 5,10-40,50| Time, <br> ms | Filter Band, <br> $\mathrm{Hz}$ | | :---: | :---: | | 0 | $5,1070,80$ | | 2500 | $5,1060,70$ | | 3500 | $5,10-50,60$ | | 5000 | $5,10-40,50$ |
frequency bands up to 40 H z 40 H z 40Hz40 \mathrm{~Hz}40 Hz. Noise is noted below 2.5 s s s\mathrm{s}s in the 40 t o 50 H z 40 t o 50 H z 40-to-50-Hz40-\mathrm{to}-50-\mathrm{Hz}40to50Hz band. This noise quickly builds up to shallower times at a higher frequency band.
Time-variant filters typically are applied on stacked data. A uniform bandwidth must be established when filtering two sets of data that may have different vintages, source types, or noise levels. This is especially significant when trying to tie two lines and follow a re flector across them. The interpreter uses the frequency character of a marker horizon as a reference in the tracking procedure. Therefore, two intersecting lines should be filtered so that the reflection character is consistent from one to the other, thus simplifying the interpretation.

1.2 THE 2-D FOURIER TRANSFORM

Multichannel processing operations can be loosely defined as those that must operate on several data traces, simultaneously. Multichannel processes can be useful in discriminating against noise and enhancing signal on the basis of a criterion that can be distinguished from trace to trace, such as dip or moveout. The 2-D Fourier transform is a basis for both analysis and implementation of multichannel processes.
Consider the six zero-offset sections in Figure 1.21. The trace spacing is 25 m 25 m 25m25 \mathrm{~m}25 m with 24 traces per section. All have monochromatic events with 12 H z 12 H z 12Hz12 \mathrm{~Hz}12 Hz frequency, but with dips that vary from 0 to 15 m s / 15 m s / 15ms//15 \mathrm{~ms} /15 ms/ trace. From the discussion on the 1-D Fourier transform (Section 1.1), we know about frequency, particularly temporal frequency, or the number of cycles per unit time. This is the Fourier dual for the time variable. However, a seismic wavefield is not only a function of time, but also a function of a space variable (offset or midpoint axis). The Fourier dual for the space variable is defined as spatial frequency, which is the number of cycles per unit distance, or wavenumber. Just as the temporal frequency of a given sinusoid is determined by counting the number of peaks within a unit time, say 1 s 1 s 1s1 \mathrm{~s}1 s, the wavenumber of a dipping event is determined by counting the number of peaks within a unit distance, say 1 k m k m km\mathrm{km}km, along the horizontal direction. Just as the temporal Nyquist frequency is defined as in equation (1-1), the Nyquist wavenumber is defined as
k N y q = 1 2 Δ x k N y q = 1 2 Δ x k_(Nyq)=(1)/(2Delta x)k_{N y q}=\frac{1}{2 \Delta x}kNyq=12Δx
where Δ x Δ x Delta x\Delta xΔx is the spatial sampling interval. For all of the sections in Figures 1.2-1 through 1.2-6, the Nyquist wavenumber is 20 c y c l e s / k m 20 c y c l e s / k m 20cycles//km20 \mathrm{cycles} / \mathrm{km}20cycles/km, since the trace interval is 25 m 25 m 25m25 \mathrm{~m}25 m.
FIG. 1.1-31. The far left panel is a portion of a CMP stack without filtering. The following panela show the same data with different narrow band-pass filters. The frequency bands specified correspond to the corner frequencies B B BBB and C C CCC in Figure 1.1-26. Appropriate slopes were assigned to both low- and high-frequency ends of each passband. The far right panel is the same section as that in the far left panel after the application of the time-variant filter specified in Table 1-11.
FIG. 1.1-32. The far left panel is a portion of a CMP stack without filtering. The remaining panels show the same data with different band-pass filters which have increasingly wider passbands. The frequency bands specified correspond to the corner frequencies B and C C C\mathrm{C}C in Figure 1.1-26. Appropriate slopes were assigned to both low- and high-frequency ends of each passband.
FIG. 1.1-33. The upper far left penel is a portion of a CMP stack without filtering. The remaining panels show the same data with different narrow band-pass filters.
To compute the wavenumber that is associated with the section corresponding, say, to the 15 m s / 15 m s / 15-ms//15-\mathrm{ms} /15ms/ trace dip in Figure 1.2-1, follow a peak or trough across the section. First compute the total time difference along the selected peak or trough across the section:
( 23 traces ) ( 15 m s / t r a c e ) = 345 m s . ( 23  traces  ) ( 15 m s / t r a c e ) = 345 m s . (23" traces ")(15ms//trace)=345ms.(23 \text { traces })(15 \mathrm{~ms} / \mathrm{trace})=345 \mathrm{~ms} .(23 traces )(15 ms/trace)=345 ms.
Then convert this to number of cycles by dividing by the (temporal) period:
345 m s ( 1000 m s / s ) / ( 12 cycles / s ) = 4.14 cycles. 345 m s ( 1000 m s / s ) / ( 12  cycles  / s ) = 4.14  cycles.  (345(ms))/((1000(ms)//s)//(12" cycles "//s))=4.14" cycles. "\frac{345 \mathrm{~ms}}{(1000 \mathrm{~ms} / \mathrm{s}) /(12 \text { cycles } / \mathrm{s})}=4.14 \text { cycles. }345 ms(1000 ms/s)/(12 cycles /s)=4.14 cycles. 
The spatial extent of the section is 575 m 575 m 575m575 \mathrm{~m}575 m; therefore, the wavenumber associated with the 15 m s / 15 m s / 15-ms//15-\mathrm{ms} /15ms/ trace dip and the 12 H z 12 H z 12-Hz12-\mathrm{Hz}12Hz frequency is
4.14 cycles 0.575 k m = 7.2 c y c l e s / k m . 4.14  cycles  0.575 k m = 7.2 c y c l e s / k m . (4.14" cycles ")/(0.575(km))=7.2cycles//km.\frac{4.14 \text { cycles }}{0.575 \mathrm{~km}}=7.2 \mathrm{cycles} / \mathrm{km} .4.14 cycles 0.575 km=7.2cycles/km.
To continue this discussion, we will map these sections to the plane of temporal frequency versus spatial wavenumber, then look at two quadrants of this plane. The following convention will be used: Events with downdip to the right are assigned positive dip, while events with updip to the right are assigned negative dip. Additionally, positive dips map onto the right quadrant, which corresponds to positive wavenumbers, while negative dips map onto the left quadrant, which corresponds to negative wavenumbers.
The plane of frequency-qavenumber (the f k f k f-kf-kfk plane) appears at the bottom of each section in Figure 1.2-1. The section with zero-dip events maps onto a single point on the frequency axis at 12 H z 12 H z 12Hz12 \mathrm{~Hz}12 Hz. Zero dip is equivalent to zero wavenumber. The magnitude of the spike corresponds to the peak amplitude of the sinusoids that make up the traces in the section. Therefore, the f k f k f-kf-kfk plane actually represents the 2 D 2 D 2-D2-\mathrm{D}2D amplitude spectrum of the section in the t x t x t-xt-xtx domain. These data have been transferred from the time-space domain to the frequency-wavenumber domain. This process is described mathematically by the 2-D Fourier transform.
There is a practical relationship between the four variables: timespace ( t x ) ( t x ) (t-x)(t-x)(tx), and their Fourier duals, frequency-wavenumber ( f k ) ( f k ) (f-k)(f-k)(fk). Measure the inverse of the stepout in the 15-ms/trace section in Figure 1.2-1 by following a peak, trough, or zero crossing from trace to trace. Stepout is defined as the slope Δ t / Δ x Δ t / Δ x Delta t//Delta x\Delta t / \Delta xΔt/Δx. In this case, the inverse of the stepout is
Δ x Δ t = 0.575 k m 0.345 s = 1.67 k m / s Δ x Δ t = 0.575 k m 0.345 s = 1.67 k m / s (Delta x)/(Delta t)=(0.575(km))/(0.345(s))=1.67km//s\frac{\Delta x}{\Delta t}=\frac{0.575 \mathrm{~km}}{0.345 \mathrm{~s}}=1.67 \mathrm{~km} / \mathrm{s}ΔxΔt=0.575 km0.345 s=1.67 km/s
Now, compute the ratio:
f k = 12 cycles / s 7.2 c y c l e s / k m = 1.67 k m / s f k = 12  cycles  / s 7.2 c y c l e s / k m = 1.67 k m / s (f)/(k)=(12" cycles "//s)/(7.2cycles//km)=1.67km//s\frac{f}{k}=\frac{12 \text { cycles } / \mathrm{s}}{7.2 \mathrm{cycles} / \mathrm{km}}=1.67 \mathrm{~km} / \mathrm{s}fk=12 cycles /s7.2cycles/km=1.67 km/s
From this, the inverse of the stepout measured in the t x t x t-xt-xtx domain along a constant phase is equal to the ratio of the frequency to the wavenumber associated with the event
Δ x Δ t = f k Δ x Δ t = f k (Delta x)/(Delta t)=(f)/(k)\frac{\Delta x}{\Delta t}=\frac{f}{k}ΔxΔt=fk
Therefore, whle retaining ficed stepout, doubing the frequency means doubling the wavenumber.
Note that all sections in Figure 1.2-1 have the same frequency component. However, from 0 to 15 m s / t r a c e 15 m s / t r a c e 15ms//trace15 \mathrm{~ms} / \mathrm{trace}15 ms/trace, the number of peaks increases horizontally across each section. That is, for a given frequency, higher dips are assigned to higher wavenumbers, as seen on the f k f k f-kf-kfk plots.

Spatial Aliasing

From Figures 1.2-1 through 1.2-6, consider the same dip components, but at different frequencies. Map each individual section to the f k f k f-kf-kfk plane. Nothing unusual happens until the section with 15 m s / 15 m s / 15-ms//15-\mathrm{ms} /15ms/ trace dip at 36 H z 36 H z 36Hz36 \mathrm{~Hz}36 Hz is reached in Figure 1.2-3. Here there is no positive dip. In fact, as a whole, the section displays a checkerboard character making it difficult to determine whether the dip is positive or negative.
At 48 H z 48 H z 48Hz48 \mathrm{~Hz}48 Hz (Figure 1.2-4), the correct dip direction is observed in the first four sections. However, the fifth section, which corresponds to the 12 m s / t r 12 m s / t r 12-ms//tr12-\mathrm{ms} / \mathrm{tr}12ms/tr ace positive dip, shows a negative dip. Therefore, it is mapped onto the negative quadrant, which is the wrong quadrant for this section. This dip component ( 12 m s / t r a c e 12 m s / t r a c e 12ms//trace12 \mathrm{~ms} / \mathrm{trace}12 ms/trace ) at this frequency ( 48 H z ) ( 48 H z ) (48Hz)(48 \mathrm{~Hz})(48 Hz) is spatzally alased. In fact, any dip greater than 1 2 m s / 1 2 m s / 12ms//\mathbf{1 2} \mathrm{ms} /12ms/ trace is spatially aliased at this frequency.
In the next set of sections in Figure 1.2-5, spatial aliasing occurs at 60 H z 60 H z 60Hz60 \mathrm{~Hz}60 Hz for a 9 m s / 9 m s / 9-ms//9-\mathrm{ms} /9ms/ trace dip. Spatial aliasing not only culses mapping to the wrong quadrant, but also causes mapping with the wrong dip. One obvious example of this is mapping a 15 m s / t r a c e 15 m s / t r a c e 15-ms//trace15-\mathrm{ms} / \mathrm{trace}15ms/trace dip at 60 H z 60 H z 60Hz60 \mathrm{~Hz}60 Hz (Figure 1.2-5). Finally, at 72 H z 72 H z 72Hz72 \mathrm{~Hz}72 Hz (Figure 1.2-6), the 6-ms/trace dip component is on the verge of spatial aliasing. Moreover, the 15 m s / 15 m s / 15-ms//15-\mathrm{ms} /15ms/ trace dip component is spatially aliased twice; it folds back to the positive-dip quadrant and appears at a lower dip.
This same analysis can be used for the negativedip components. From Figures 1.2-1 through 1.2-6, note that each section as a whole was mapped onto a single point in the frequency-wavenumber domain. Each section has an associated unique frequency and wavenumber assigned to it. These zero-offset sections can be considered representations of plane waves that propagate at a unique angle from the vertical and carry a monochromatic signal. The wavefront is defined as the line of
FIG. 1.2-1. Top row: Six gathers, each containing 12 H z 12 H z 12-Hz12-\mathrm{Hz}12Hz monofrequency events with different dips ranging from 0 to 15 m s / m s / ms//\mathrm{ms} /ms/ trace. Trace spacing is 25 m 25 m 25m25 \mathrm{~m}25 m. Bottom row: Their respoctive amplitude spoctra. The dots on the spectra represent the mapping of cvents on the gathers. The solid vertical lines are the froquency axis. If the positivc dips are defined as downdip from left to right, then all cvents map onto the positive quadrant in the frequency-wavenumber ( f k ) ( f k ) (f-k)(f-k)(fk) planc. This is the first in a series of six figures that describes mapping of monofrequency sygnals in the ( f k f k f-kf-kfk ) domain (Figures 1.2-1 through 1.2-6).
FIG. 1.2-2. The same as Figure 1.2-1, except using 24-Hz monofroquency events.
FIG. 1.2-3. The same as Figure 1,2-1, except using 36 H z 36 H z 36-Hz36-\mathrm{Hz}36Hz monofrequency events.
FIG. 1.2-4. The same as Figure 1.2-1, except using 48 H z 48 H z 48-Hz48-\mathrm{Hz}48Hz monofrequency cvents.
FIG. 1.2-5. The same as Figure 1.2-1, except using 60 H z 60 H z 60-Hz60-\mathrm{Hz}60Hz monofrequency events.
FIG. 1.2-6. The same as Figure 12 1 12 1 12-112-1121, except using 72 H z 72 H z 72-Hz72-\mathrm{Hz}72Hz monofrequency events.
FIG. 1.2-7. Top row: Six gathers, each formed by summing gathers of the like dips in Figures 1 2-1 through 1.2-6. The trace spacing is 25 m 25 m 25m25 \mathrm{~m}25 m. Bottom row: Respective amplitude spectra.
constant phase, while the direction of propagation is perpendicular to the wavefront. Since a seismic wavefield is a superposition of many dips and frequencies, it is equivalent to the synthess of many plane-wave com ponents. In this respect, the physical meaning of the 2-D Fourier transform is important, for it is an analyoss (decomposition) of a wavefield into its plane-wave components.
A recorded wavefield is a composite of many dip and frequency components, such as those shown in Figures 1.2-1 through 1.2-6. Suppose that sections with the same dip, but with different frequencies, are superimposed. The composite sections are shown in Figure 1.2-7 with the composite amplitude spectra below each section. For a given dip, all frequency components map onto the f k f k f-kf-kfk plane along a straight line that passes through the origin. The higher the dip, the closer the radial line in the f k f k f-kf-kfk domuin is to the wavenumber axis. The zero-dip components map along the frequency axis. From the 9 12 9 12 9-12-9-12-912, and 15 m s / 15 m s / 15-ms//15-\mathrm{ms} /15ms/ trace dips, note that the spatially aliased frequencies are located along the linear segments that wrap around to the opposite quadrant in the amplitude spectrum. The steeper the dip, the lower the frequency at which spatial alzasing occurs.
So far, a discrete number of frequencies was considered. For a continuum of frequency components associated with a single dip, we anticipate that they would map along a straight, continuous line in the f k f k f-kf-kfk domain, as shown in Figure 1.2-8. While the dipping event in Figure 1.2 8 1.2 8 1.2-81.2-81.28 is not aliased, the dipping event in Figure 1.2-9 is spatially aliased beginning at approximately 21 H z 21 H z 21Hz21 \mathrm{~Hz}21 Hz.
Examination of the monochromatic single-dip sections in Figures 1.2-1 through 1.2-6 shows that each section maps onto a single point in the f k f k f-kf-kfk domain. An extension of this observation is made in Figure 1.2-10. Events with the same dip in the t x t x t-xt-xtx domain, regardless of their location, mup onto a single radial line in the f k f k f-kf-kfk domain. When events are spatially aliased, the radial line wraps around at the Nyquist wavenumber (Figure 1.2-11). These concepts have important practical implications, for they lead to f k f k f-kf-kfk dip filtering of coherent linear noise (Section 6.2). Events with different dips that may interfere in the t x t x t-xt-xtx domain can be isolated in the f k f k f-kf-kfk domain.
The numerical computation of the 2-D Fourier transform involves two 1-D Fourier transforms. Figure 1.2-12 shows the steps that are involved. A brief mathematical formulation of the 2-D Fourier transform is given in Section A.2.
In summary, 2-D Fourier transformation is a way to decompose a wavefield into its plane-wave components. Each plane wave carries a monochromatic signal that
FIG. 1.2-8. A single, isolated dipping event and its 2-D amplitude spectrum. No frequency is spatially aliased. What is the dip of the event in milliseconds per trace?
propagates at a certain angle from the vertical. Events with the same dip in the t x t x t-xt-xtx domain, regardless of location, are mapped onto a single line in the radial direction in the f k f k f-kf-kfk domain. In Chapter 4 , we shall discuss migration methods in the f k f k f-kf-kfk domain, and in Chapter 6, we shall demonstrate use of f k f k f-kf-kfk filtering to remove coherent linear noise and attenuate multiples.
Spatial aliasing has serious effects on the performance of multichannel processes such as f k f k f-kf-kfk filtering (Section 6.2) and migration (Section 4.6). Because of spatial aliesing, these processes can perceive events with steep dips at high frequencies as different from what they actually are and, hence, do not treat them properly. For example, migration moves the spatially aliased
FIG. 1.2-9. A singlc, tsolated dipping event and its 2-D amplitude spoctrum, Frequencies beyond 21 H z 21 H z 21Hz21 \mathrm{~Hz}21 Hz are spatially aliased.
frequency components in the wrong direction and generates a dispersive noise that degrades the quality of the migrated section.
How is spatial aliasing avoided? Compare the sections in Figures 1.2-8 and 1.2-9. Both have the same frequency content, 6 to 42 H z 42 H z 42Hz42 \mathrm{~Hz}42 Hz. The data in Figure 1.2-9 are spatially aliased because the dipping event is steeper than in Figure 1,2-8. Some ways to avoid spatial aliasing follow:
(a) Apply time shifts so that the steep events appear to have lower dips. Although this could change the dips that were low to higher dips, making them spatially aliased, it often is a feasible solution for
FIG, 1,2-10. Six events with identical dip in the t x t x t-xt-xtx domain map onto the same radial line in the f k f k f-kf-kfk domain. No frequencies are aliased. The dip of these events is the same as that of the single event in Figure 1.2-8. What distinguishes this spectrum from that in Figure 1.2-8?
certain situations. For instance, a linear moveout can be applied to CMP gathers to circurnvent spatial aliasing of shallow events in prestack migration (Li et al,, 1991). Also, a hyperbolic moveout can be applied to CMP gathers before multiple attenuation in the f k f k f-kf-kfk domain (Section 6.2).
(b) If a low-pass filter were applied to the traces in Figure 1.2-9 so that the frequencies up to 21 H z 21 H z 21Hz21 \mathrm{~Hz}21 Hz were retained, then the segment that is wrapped around to the negative quadrant of the amplitude spectrum is removed. Although spatial aliasing is eliminated, a significant part of the recorded frequency band is lost. This approach is not desirable.
FIG. 1.2-11. Six events with identical dip in the t x t x t-xt-xtx domain map onto the samc radial linc in the f k f k f-kf-kfk domain. Frequencies beyond 21 H z 21 H z 21Hz21 \mathrm{~Hz}21 Hz are aliascd. The dip of these events is the same as that of the single event in Figure 1.2-9.
(c) Figure 1.2-13 shows a single dipping event recorded with three different trace spacings. The 2 -D amplitude spectra suggest a third approach to solving the spatial aliasing problem. Note that the coarser the trace spacing, the more frequencies are spatially aliased. The same frequency bandwidth is kept in all three cases. The 12.5 m 12.5 m 12.5-m12.5-\mathrm{m}12.5m trace spacing provides a frequency band with no spatial aliasing. For a 25 m 25 m 25-m25-\mathrm{m}25m trace spacing, frequencies beyond 36 H z 36 H z 36Hz36 \mathrm{~Hz}36 Hz are spatially aliased; while for a 50 m 50 m 50-m50-\mathrm{m}50m trace spacing, frequencies beyond 18 H z 18 H z 18Hz18 \mathrm{~Hz}18 Hz are spatially aliased For this latter case, spatial aliasing is so severe that the aliased frequencies wrap around the wave-
Input Data, P ( x , t ) 1-D Fourier Transform in Time Direction: P ( x , ω ) = P ( x , t ) exp ( i ω t ) d t 1-D Fourier Transform in Spatial Direction: P ( k x , ω ) = P ( ω , x ) exp ( i k x x ) d x  Input Data,  P ( x , t )  1-D Fourier Transform   in Time Direction:  P ( x , ω ) = P ( x , t ) exp ( i ω t ) d t  1-D Fourier Transform   in Spatial Direction:  P k x , ω = P ( ω , x ) exp i k x x d x {:[" Input Data, "P(x","t)],[darr],[" 1-D Fourier Transform "],[" in Time Direction: "],[P(x","omega)=int P(x","t)exp(-i omega t)dt],[darr],[" 1-D Fourier Transform "],[" in Spatial Direction: "],[P(k_(x),omega)=int P(omega","x)exp(ik_(x)x)dx]:}\begin{gathered} \text { Input Data, } P(x, t) \\ \downarrow \\ \text { 1-D Fourier Transform } \\ \text { in Time Direction: } \\ P(x, \omega)=\int P(x, t) \exp (-i \omega t) d t \\ \downarrow \\ \text { 1-D Fourier Transform } \\ \text { in Spatial Direction: } \\ P\left(k_{x}, \omega\right)=\int P(\omega, x) \exp \left(i k_{x} x\right) d x \end{gathered} Input Data, P(x,t) 1-D Fourier Transform  in Time Direction: P(x,ω)=P(x,t)exp(iωt)dt 1-D Fourier Transform  in Spatial Direction: P(kx,ω)=P(ω,x)exp(ikxx)dx
FIG. 1.2-12. Computation of the 2-D Fourier transform.
number axis twice. We see that spatial aliasing can be avoided by selecting a sufficiently small trace spacing. This approach requires either a datadependent interpolation scheme (Section 7.2) to generate extra traces or modification of the field recording geometry. If the latter approach were taken, more shots and/or more recording channels are needed.
To circumvent spatial aliasing, data often are recorded with twice as many number of channels per shot record as that would be used in processing. Prior to dropping every other trace at the start of a processing sequence, a wavenumber filter is applied to remove the wavenumber components for all frequencies beyond the Nyquist wavenumber that corresponds to the trace spacing of the data after dropping alternating traces from the shot record. This wavenumber filter actualiy is a spatial high-cut antialias filter akin to the high-cut antialias frequency filter discussed in Section 1.1.
Consider the shot record shown in Figure 1.2-14a recorded with 368 channels at a group interval of 12.5 m m m\mathrm{m}m. The record which is intended for input to a processing sequence comprises 192 channels with 25 -m group interval. Just as dropping every other sample in a time series can result in frequency aliasing of some of the high frequencies, dropping alternating traces could result in spatial aliasing (Figure 1.2-14b). Note that spatial aliasing in the original record (Figure 1.2-14a) occurs starting at about 75 h z 75 h z 75hz75 \mathrm{hz}75hz. Trace decimation without spatial antialias filter causes spatial aliasing to occur starting at about 40 H z 40 H z 40Hz40 \mathrm{~Hz}40 Hz (Figure 1.2-14b).
To circumvent spatial aliasing as a result of dropping every other trace in the record, a prior application of a spatial high-cut antialias filter is needed (Figure 1.2-15). Apply a wavenumber filter to remove the energy within the f k f k f-kf-kfk region that is between 50 and 100 wavenumber in both quadrants of the f k f k f-kf-kfk plane
(Figure 1.2-15a). Since the trace spacing of the original record in Figure 1.2-14a is 12.5 m 12.5 m 12.5m12.5 \mathrm{~m}12.5 m, the corresponding Nyquist wavenumber is 40 cycles / k m / k m //km/ \mathrm{km}/km. Following trace decimation, the Nyquist wavenumber is 20 c y c l e s / k m 20 c y c l e s / k m 20cycles//km20 \mathrm{cycles} / \mathrm{km}20cycles/km, corresponding to 25 m 25 m 25-m25-\mathrm{m}25m trace spacing. Note in the f k f k f-kf-kfk spectrum in Figute 1.2-15a that the wavenumber filter has removed the energy between 20 and 40 c y c l e s / k m 40 c y c l e s / k m 40cycles//km40 \mathrm{cycles} / \mathrm{km}40cycles/km for all frequencies in both quadrants. Compare the f k f k f-kf-kfk spectra of the decimated data without (Figure 1.2-14b) and with antialias filtering (Figure 1.2-15b) and note that the wavenumber filter has removed the spatially aliased high-frequency components of the steeply dipping events in the original gather.
The spatial antialias filter design and application involves normal-moveout correction of the data (Section 3.1). Consider the 240 -channel shot record shown in Figure 1.2-16a with 6.25 m 6.25 m 6.25-m6.25-\mathrm{m}6.25m group interval. We want to apply spatial antialias filter and reduce the number of channels by half with 12.5 m 12.5 m 12.5-m12.5-\mathrm{m}12.5m group interval. Follow the steps below:
(a) Apply normal-moveout correction to the input gather (Figure 1.2-16a) that needs to be decimated to unalias the aliased energy.
(b) Apply 2-D Fourier transform to map the data onto the f k f k f-kf-kfk plane. Following the normal-moveout correction, the energy maps in the f k f k f-kf-kfk plane closer to the frequency axis, thus alleviating the spatial aliasing (Figure 1.2-17a).
(c) Design a spatial antialias filter by specifying reject zones for all frequencies between 50 and 100 wavenumber in both quadrants of the f k f k f-kf-kfk plane.
(d) Apply the wavenumber filter to the moveoutcorrected data in the f k f k f-kf-kfk domain (Figure 1.217b).
(e) Apply inverse Fourier transform of the wavenumber-filtered data (Figure 1.2-16b).
(f) Now drop every other trace to obtain the decimated data (Figure 1.2-16c). The Nyquist wavenumber of the gather following the application of the spatial antialias filter is one-half ot the Nyquist wavenumber of the original gather (Figure 1.2-17c).
(g) Apply inverse moveout correction (Figure 1.2-16d). The resulting shot record contains one-half the number of channels as in the original record (Figure 1.2-16a), and its energy is within the f k f k f-kf-kfk region defined by one-half the Nyquist wavenumber associated with the original record (compare Figures 1.2-17a and 1.2-17d),
The original moveout-corrected shot record (Figure 1.2-16a) after dropping every other trace, but without the application of the antialias wavenumber filter, is shown in Figure 1.2-16e with the f k f k f-kf-kfk spectrum of
FIG. 1.2-13. A single, isolated dipping event sampled at three different trace spacings with the corresponding f k f k f-kf-kfk spectra. No spatial aliasing occurs with the 12.5 m 12.5 m 12.5-m12.5-\mathrm{m}12.5m trace spacing (left). Frequencies bcyond 36 H z 36 H z 36Hz36 \mathrm{~Hz}36 Hz arc aliased with the 25 m 25 m 25-m25-\mathrm{m}25m trace spacing (center). Double alasing occurs with the 50 m 50 m 50-m50-\mathrm{m}50m trace spacing (right). Although events on the f k f k f-kf-kfk spectra appear to have different dips, all three have the same dip on the t x t x t-xt-xtx gathers (top). This deceptive character is because of the different horizontal scales used in displaying the f k f k f-kf-kfk spectra.
(a)
(b)
FIG. 1.2-14. (a) A shot record with its 2-D amplitude spectrum displayed on top; trace spacing is 12.5 m 12.5 m 12.5m12.5 \mathrm{~m}12.5 m and the Nyquist wavenumber is 40 c y c l e s / k m 40 c y c l e s / k m 40cycles//km40 \mathrm{cycles} / \mathrm{km}40cycles/km. Minimum and maximum offsets are 140 m 140 m 140m140 \mathrm{~m}140 m and 4727.5 m 4727.5 m 4727.5m4727.5 \mathrm{~m}4727.5 m, respectively. (b) The same record as in (a) with every other trace droppod; hence, trace spacing is 25 m 25 m 25m25 \mathrm{~m}25 m and the Nyquist wavenumber is 20 c y c l e s / k m 20 c y c l e s / k m 20cycles//km20 \mathrm{cycles} / \mathrm{km}20cycles/km. Note that little energy is spatially aliased above 75 H z 75 H z 75Hz75 \mathrm{~Hz}75 Hz in the original rccord (a), whle spatial aliasing occurs beginving at 45 H z 45 H z 45Hz45 \mathrm{~Hz}45 Hz in the record with every other trace dropped (b).
(a)
(b)
FIG. 1.2-15. (a) The same shot record as in Figure 1.2-14a after the application of a wavenumber filter to remove the energy beyond half the Nyquist wavenumber for all frequencies. (b) The same record ts in (a) after dropping every other trace. Note that spatial aliasing is circumvented first by applying a high-cut spatial antialiasing wavenumber filter (a) prior to dropping every other trace. In contrast, dropping every other trace without the prior application of an antialias filter causes spatial aliasing of events with large moveout (Figure 1.2-15b).

120 H z 120 H z 120Hz120 \mathrm{~Hz}120 Hz

100
80
60
40
20
FIG. 1.2-17. The f k f k f-kf-kfk spectra of the shot record at various stages as described in Figure 1.2-16.
FIG, 1.2-18. A zero-ofiset section (256 traces with 25 m 25 m 25-m25-\mathrm{m}25m trace spacing) containing 10 dipping events and its 2-D amplitude spectrum. No frequencies are aliased.
the resulting record shown in Figure 1.2-17e. This decimated shot record (Figure 1.2-16e) should be compared with the antialiesed-filtered record (Figure 1.2-16c) after inverse moveout correction (Figures 1.2-16d and f f f\mathrm{f}f ). Examine the f k f k f-kf-kfk spectra of the data after trace decimation with (Figure 1.2-17d) and without antialias filtering (Figure 1.2-17f) and note that, for this data set, wavenumber filtering has not been successful in removing spatially aliased energy. Wavenumber filtering for trace decimation is successful if the aliased energy in the original record is confined to the reject zones for all frequencies between 50 and 100 .
So far, only the synthesis of a single dipping event from a discrete number of frequency components has been considered. This analysis now is extended to a range of dips. Figure 1.2-18 shows a section with dips that vary from 0 to 45 degrees and the corresponding 2-D amplitude spectrum. These same dips, but with higher frequency content, also are seen in Figure 1.219. Events with 0-, 5-, 10-, and 15-degree dips are not spatially aliased. The 20 -degree dip is aliased at nearly 72 H z 72 H z 72Hz72 \mathrm{~Hz}72 Hz, the 30 -degree dip at nearly 48 H z 48 H z 48Hz48 \mathrm{~Hz}48 Hz, and the 45 45 45-45-45 degree dip at nearly 36 H z 36 H z 36Hz36 \mathrm{~Hz}36 Hz. Again, the steeper the dip, the lower the frequency at which spatial aliasing occurs.
FIG. 1.2-19. A zero-offset section (256 traces with 25 -m trace spacing) containmg 10 dipping events and its 2-D arnplitude spectrum. Steeper dips are aliased at increasingly lower frequencies.
Given a dip value, how is the maximum unaliased frequency determined? Consider the 20-degree dipping event in Figure 1.2-19. First, measure the dip in milliseconds per trace. There are 256 traces in the t x t x t-xt-xtx model with 25 m 25 m 25-m25-\mathrm{m}25m trace spacing. The 20 -degree dip is equivalent to 7 m s / t r a c e 7 m s / t r a c e 7ms//trace7 \mathrm{~ms} / \mathrm{trace}7 ms/trace. Frequency components with periods less than twice the dip are spatially aliased. Thus, given the dip in milliseconds per trace, the threshold frequency at which spatial aliasing begins is 500 per dip. In the present case, the threshold frequency is 500 / 7 72 H z 500 / 7 72 H z 500//7~~72Hz500 / 7 \approx 72 \mathrm{~Hz}500/772 Hz. This is verified by examining the amplitude spectrum in Figure 1.2-19.
Figure 1.2-20 shows three field records and their 2 D D D\mathrm{D}D amplitude spectra, known as f k f k f-kf-kfk spectra. By now, it is easy to recognize and relate various events on the shot gathers to those on the f k f k f-kf-kfk spectra. Event A A A\mathrm{A}A is the high-amplitude dispersive coherent noise with very low group velocity. When the spatial extent of these waves broadens, bandwidth in the wavenumber direction becomes smaller. Conversely, when the spatial extent becomes smaller, the event, such as G G GGG, spans a wider wavenumber bandwidth in the f k f k f-kf-kfk spectrum (compare events A, F 1 F 1 F_(1)F_{1}F1 and G G GGG ). Events B B BBB and C C CCC are parts
FIG. 1.2-20. Three common-shot gathers (top) and their f k f k f-kf-kfk spectra (bottom). (The marked events are discussed in the text.) Dip convention: An event maps onto a positive-dip quadrant in the f k f k f-kf-kfk spectrum if it dips down moving from near to far offets. (Data courtesy Deminex Petroleum.)
of the guided wave packet. Event C C C\mathrm{C}C contains aliased energy above 42 H z 42 H z 42Hz42 \mathrm{~Hz}42 Hz (indicated by D D D\mathrm{D}D on the f k f k f-kf-kfk spectrum). Primaries and associated multiples are mapped into region E E EEE between the frequency axis and event C C CCC.
Spatial aliasing not only is a concern in a prestack application of a multichannel filter, such as f k f k f-kf-kfk filtering, but also during poststack processing. Specifically, migration of CMP stacked data suffers from spatial aliasing if the trace interval is too coarse. An optimum CMP trace interval to avoid spatial aliasing can be computed as follows. Consider a dipping reflector with a dip angle of θ θ theta\thetaθ (Figure 1.2-21). Also consider a normal-incidence plane wave with a dominant period T T TTT recorded at the surface with a trace separation Δ x Δ x Delta x\Delta xΔx. (This is the zero-offset case where Δ x Δ x Delta x\Delta xΔx is the CMP trace interval.) From the geometry in Figure 1.2-21, we write
sin θ = v Δ t 2 Δ x sin θ = v Δ t 2 Δ x sin theta=(v Delta t)/(2Delta x)\sin \theta=\frac{v \Delta t}{2 \Delta x}sinθ=vΔt2Δx
where Δ t Δ t Delta t\Delta tΔt is the two-way time separation between the arrival times of the plane wave at the two receiver locations, A and B, and v v vvv is the medium velocity. Spatral
FIG. 1.2-21. A plane wave reflecting at normal incidence from a dipping reflector with a dip angle θ θ theta\thetaθ grrives at two consecutive receiver locations A A AAA and B B BBB at the surface with a separation Δ x Δ x Delta x\Delta xΔx. Geometry of this plane wave is used to derive equation (1-6).
aliasing occurs when the wavefront separation in time Δ t Δ t Delta t\Delta tΔt equals half the dominant period T T TTT. When this criterion is applied to equation (1-6), we get the following expression for the maximum threshold frequency, f max = 1 / T f max  = 1 / T f_("max ")=1//Tf_{\text {max }}=1 / Tfmax =1/T, that is not aliased for a given dip, velocity, and CMP trace interval:
f max = v 4 Δ x sin θ f max = v 4 Δ x sin θ f_(max)=(v)/(4Delta x sin theta)f_{\max }=\frac{v}{4 \Delta x \sin \theta}fmax=v4Δxsinθ
Table 1-12 shows the evaluation of equation (1-7) for a particular numerical example. Equation (1-7) also can be expressed in terms of receiver group interval 2 Δ x 2 Δ x 2Delta x2 \Delta x2Δx. Suppose the maximum dip is 30 degrees. If the sampling interval is 4 m s 4 m s 4ms4 \mathrm{~ms}4 ms, then the Nyquist frequency is 125 H z 125 H z 125Hz125 \mathrm{~Hz}125 Hz. After antialias filtering, the frequency band extends up to 90 H z 90 H z 90Hz90 \mathrm{~Hz}90 Hz, provided the high-cut filter is at three-quarters of the Nyquist. For a band width without spatial aliasing, we have to select a 12.5-m CMP trace interval.
To circumvent the deleterious effect of spatial aliasing on migrated data, trace interpolation is applied to attain a trace interval appropriate for the bandwidth of the CMP-stacked data. As stated in Section 1.1, 1-D interpolation of a time series, such as a seismic trace, from a coarse to a finer sampling interval does not re-
Table 1-12. Frequency threshold for spatial aliasing. Velocity is 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s.
Threshold Frequency (Hz) for
CMP Trace Interval (m)
Dip Angle (deg) 12.5 25 37.5 50
10 346 173 115 86
20 175 88 58 44
30 120 60 40 30
40 93 47 31 23
Threshold Frequency (Hz) for CMP Trace Interval (m) Dip Angle (deg) 12.5 25 37.5 50 10 346 173 115 86 20 175 88 58 44 30 120 60 40 30 40 93 47 31 23 | | Threshold Frequency (Hz) for | | | | | | :---: | ---: | ---: | ---: | ---: | :---: | | CMP Trace Interval (m) | | | | | | | Dip Angle (deg) | 12.5 | 25 | 37.5 | 50 | | | | | | | | | | 10 | 346 | 173 | 115 | 86 | | | 20 | 175 | 88 | 58 | 44 | | | 30 | 120 | 60 | 40 | 30 | | | 40 | 93 | 47 | 31 | 23 | |
cover the frequencies lost by the original sampling; but, it only generates extra samples. On the other hand, interpolation of 2-D data, such as a seismic section, from a coarse to a finer trace interval, is possible for all signal frequencies, including those that are aliased. This is because of the fact that one can detect and measure the dip as defined by the stepout of equation (1-5) on a stacked section for the unaliased frequencies and use the dip information to interpolate not only the unaliased but also the aliased frequencies. Modern data acquisition geometries for 2-D data often do not require trace
interpolation. Nevertheless, trace interpolation usually is required in the crossline direction prior to 3-D migration (Section 7.2).

1.3 WORLDWIDE ASSORTMENT OF SHOT RECORDS

Forty shot records, both land and marine, from North and South America, Europe, the Middle East, North Africa, and the Far East, are presented in Figures 1.31 through 1.3-40. Source types are vibroseis, Geoflex, dynamite, air gun, Maxipulse, Aquapulse, and Aquaseis. The recording parameters, including the number of traces, number of samples per trace, sampling interval, trace interval, and inner offset, are indicated in Table 1-13. Study the field records to learn how to recognize different types of waves. For display purposes, an instantaneous type of gain (AGC) (Section 1.4) was applied to all 40 records. These records will be referred to by their record numbers in the following discussions.
The main goal in processing reflection seismic data is to enhasce genuine reflection signal by suppressing unwanted energy in the form of coherent and random ambient noise. In the following paragraphs, shot gathers are examined to point out the different types of seismic energy.
Record 1 is a correlated vibroseis data set. (For vibroseis correlation, refer to Section 1.1.) A number of reflections is present in this record with reasonably good signal-to-noise ratio. A genuine reflection is recognized on common-shot gathers by its hyperbolic nature. Reflections behave the same way on CMP gathers. A flat horizon with no dip yields a symmetric hyperbola on both common-shot and common-midpoint gathers recorded using split-spread geometry. (In split-spread geometry, the source is located somewhere in the middle of the receiver cable, usually at the center.) A dipping horizon yields a skewed hyperbola on a commonshot gather, while still yielding a symmetric hyperbola on a common-midpoint gather. Reciprocity of sources and receivers provides this symmetry. From the reflection hyperbolas in Record 1, note that the subsurface is made up of nearly horizontally flat layers. Any irregularity in the shape of the moveout hyperbola can be attributed to near-surface effects and/or lateral variations in velocity.
Record 2 is an asymmetric shot gather. Note the refection energy between 1 and 2 s 2 s 2s2 \mathrm{~s}2 s, with rather irregular moveout.
Record 3, which was obtained by using dynamite, contains a series of reflections with nearly perfect hyperbolic noveout, especially between 1 and 3 s 3 s 3s3 \mathrm{~s}3 s. This record is from the times of analog recording. It is not uncommon to digitize old analog data and process it with modern techniques.
Record 4 contains events with complex moveout between 2.5 and 3.5 s 3.5 s 3.5s3.5 \mathrm{~s}3.5 s. Events A, B, and C have skewed hyperbolic moveouts, which, in this case, suggests that they are dipping up toward the left. Also note the traveltime distortions along the moveouts caused, most likely, by near-surface irregularities.
Record 5 has some ground-roll energy, which is characterized by its low-frequency, high-amplitude appearance, particularly on short-offset traces. This kind of energy typically is suppressed in the field by using a proper receiver array.
Record 6 contains weak and strong, nearly flat reflectors (A and B). The break in the reflection hyperbola (C1-C2) suggests the presence of a fault C l C l Cl\mathrm{Cl}Cl on the upthrown side and C 2 C 2 C2\mathrm{C} 2C2 on the downthrown side). Again, note the ground-roll energy with its dispersed low-frequency character on inside traces (event D),
Record 7 contains three interesting events. Event A is a skewed hyperbola, which suggests that it is dipping up toward the left, while event B B BBB is nearly symmetric, which suggests a flat dip. Event. C C C\mathrm{C}C shows a discontinuity F F F\mathrm{F}F along its moveout curve, indicating the presence of a fault.
Record 8 shows a record with excellent signal quality. This dynamite record has a number of reflections and associated interbed reverberations. Note the progressive decrease in the signal-to-noise ratio at late times. This is true for almost all seismic data. Event A has large moveout because it is shallow, while event B B BBB has small moveout because it is deep. (Linear energy C C CCC is referred to in Exercise 1-3.)
Record 9, which is a correlated vibroseis data set, has a series of reflections and ground roll. Unlike data from impulsive sources such as dynamite, first breaks in vibroseis data may not be distinguishable (compare, for example, Records 8 and 9). This is because the correlated vibroseis record contains some of the side lobes of the sweep signal autocorrelation. Note the increase in random noise in the later part of the record below 3 s 3 s 3s3 \mathrm{~s}3 s.
Record 10 contains two strong shallow reflectors, A A AAA and B B BBB, in addition to ground-roll energy C C CCC. Also, a bundle of energy with extremely large moveout is noted between 2.5 and 5 s 5 s 5s5 \mathrm{~s}5 s (D1-D2). This coherent noise may be attributed to side-scattered energy, which is caused by inhomogeneities in the subsurface (particularly at the water bottom) that behave as point sources.
Record 11 contains four prominent reflections. This record is from Alaska, where the thickness of the permafrost layer can be irregular. Such near-surface irreg-
Table 1-13. Parameter index of a worldwide assortment of common-shot gathers.
Record
Number
Record Number| Record | | :--- | | Number |
Area
Number of
Samples
per Trace
Number of Samples per Trace| Number of | | :--- | | Samples | | per Trace |
Number of
Traces
Number of Traces| Number of | | :--- | | Traces |
Sempling
Interval, ms
Sempling Interval, ms| Sempling | | :--- | | Interval, ms |
Trace
Interval,
ft or m m m\mathrm{m}m
Trace Interval, ft or m| Trace | | ---: | | Interval, | | ft or $\mathrm{m}$ |
Inner
Offset,
ft or m m mmm
Inner Offset, ft or m| Inner | | ---: | | Offset, | | ft or $m$ |
Source
1 South Texas 1,275 48 4 330 f t 330 f t 330ft330 \mathrm{ft}330ft 990 f t 990 f t 990ft990 \mathrm{ft}990ft V V V\mathrm{V}V
2 West Texas 1,025 120 4 100 f t 100 f t 100ft100 \mathrm{ft}100ft 400 f t 400 f t 400ft400 \mathrm{ft}400ft V
3 3 **3* 33 Louisiana 1,500 24 4 340 f t 340 f t 340ft340 \mathrm{ft}340ft 340 f t 340 f t 340ft340 \mathrm{ft}340ft D D D\mathrm{D}D
4 Turkey 1,275 48 4 100 m 100 m 100m100 \mathrm{~m}100 m 250 m 250 m 250m250 \mathrm{~m}250 m V V V\mathrm{~V} V
5 South America 3,000 48 2 100 m 100 m 100m100 \mathrm{~m}100 m 200 m 200 m 200m200 \mathrm{~m}200 m D
6 Far East 1,250 48 4 100 m 100 m 100m100 \mathrm{~m}100 m 150 m 150 m 150m150 \mathrm{~m}150 m D
7 South America 2,600 48 2 100 m 100 m 100m100 \mathrm{~m}100 m 300 m 300 m 300m300 \mathrm{~m}300 m
D
V V VVV
D V| D | | :--- | | $V$ |
8 Central America 1,300 96 4 50 m 50 m 50m50 \mathrm{~m}50 m 100 m 100 m 100m100 \mathrm{~m}100 m D
9 Alaska 1,000 96 4 220 f t 220 f t 220ft220 \mathrm{ft}220ft 990 f t 990 f t 990ft990 \mathrm{ft}990ft V
10 North Africa 1,325 120 4 25 m 25 m 25m25 \mathrm{~m}25 m 300 m 300 m 300m300 \mathrm{~m}300 m V V V\mathrm{~V} V
11 Alaska 1,000 96 4 220 f t 220 f t 220ft220 \mathrm{ft}220ft 990 f t 990 f t 990ft990 \mathrm{ft}990ft V V V\mathrm{V}V
12 Mississippi 1,275 48 4 330 f t 330 f t 330ft330 \mathrm{ft}330ft 990 f t 990 f t 990ft990 \mathrm{ft}990ft v v vvv
13 Offshore Texas 2,025 48 4 220 f t 220 f t 220ft220 \mathrm{ft}220ft 875 f t 875 f t 875ft875 \mathrm{ft}875ft A A A\mathrm{A}A
14 Offshore Texas 1,525 48 4 220 f t 220 f t 220ft220 \mathrm{ft}220ft 690 f t 690 f t 690ft690 \mathrm{ft}690ft
A A AAA
P P P\mathbf{P}P
A P| $A$ | | :--- | | $\mathbf{P}$ |
15 Offshore Canada 2,500 48 2 25 m 25 m 25m25 \mathrm{~m}25 m 360 m 360 m 360m360 \mathrm{~m}360 m
16 South America 1,275 48 4 25 m 25 m 25m25 \mathrm{~m}25 m
500 m 500 m 500m500 \mathrm{~m}500 m
233 m 233 m 233m233 \mathrm{~m}233 m
500m 233m| $500 \mathrm{~m}$ | | :--- | | $233 \mathrm{~m}$ |
A
17 South America 2,000 48 4 50 m 50 m 50m50 \mathrm{~m}50 m 233 m 233 m 233m233 \mathrm{~m}233 m
18 Offshore Louisiana 1,500 120 4 80 f t 80 f t 80ft80 \mathrm{ft}80ft 250 m 250 m 250m250 \mathrm{~m}250 m A
19 Turkey 1,250 216 4
82 f t 82 f t 82ft82 \mathrm{ft}82ft
10 m 10 m 10m10 \mathrm{~m}10 m
82ft 10m| $82 \mathrm{ft}$ | | :--- | | $10 \mathrm{~m}$ |
716 f t 716 f t 716ft716 \mathrm{ft}716ft A
20 South Aleutians 2,025 120 4 50 m 50 m 50m50 \mathrm{~m}50 m D D D\mathrm{D}D
21 Denver Basin
2,020
1,550
2,020 1,550| 2,020 | | :--- | | 1,550 |
48 82 f t 82 f t 82ft82 \mathrm{ft}82ft 921 f t 921 f t 921ft921 \mathrm{ft}921ft A
22 Williston Basin
1,550
1,550
1,550 1,550| 1,550 | | :--- | | 1,550 |
48 2 220 f t 220 f t 220ft220 \mathrm{ft}220ft 220 f t 220 f t 220ft220 \mathrm{ft}220ft V V V\mathrm{V}V
22
23
22 23| 22 | | :--- | | 23 |
San Juaquin Basin
1,550
1,550
1,550 1,550| 1,550 | | :--- | | 1,550 |
48
48
48 48| 48 | | :--- | | 48 |
2 110 f t 110 f t 110ft110 \mathrm{ft}110ft 110 f t 110 f t 110ft110 \mathrm{ft}110ft V
24
San Juaquin Basin
Arctic
San Juaquin Basin Arctic| San Juaquin Basin | | :--- | | Arctic |
1,550 2 220 f t 220 f t 220ft220 \mathrm{ft}220ft 220 f t 220 f t 220ft220 \mathrm{ft}220ft V
25
Arctic
Alberta
Arctic Alberta| Arctic | | :--- | | Alberta |
3,000
48
96
48 96| 48 | | :--- | | 96 |
2 220 f t 220 f t 220ft220 \mathrm{ft}220ft 220 f t 220 f t 220ft220 \mathrm{ft}220ft S S SSS
23
26
23 26| 23 | | :--- | | 26 |
Alberta
Alberta
Alberta Alberta| Alberta | | :--- | | Alberta |
2,000 96 2 50 m 50 m 50m50 \mathrm{~m}50 m 50 m 50 m 50m50 \mathrm{~m}50 m D D D\mathrm{D}D
20
27
20 27| 20 | | :--- | | 27 |
Alberta
Canada
Alberta Canada| Alberta | | :--- | | Canada |
1,500 48 2 67 m 67 m 67m67 \mathrm{~m}67 m 67 m 67 m 67m67 \mathrm{~m}67 m D
27
28
27 28| 27 | | :--- | | 28 |
1,791 92 4 50 m 50 m 50m50 \mathrm{~m}50 m 200 m 200 m 200m200 \mathrm{~m}200 m A
Canada 2,500 48 2 25 m 25 m 25m25 \mathrm{~m}25 m 300 m 300 m 300m300 \mathrm{~m}300 m A
29 Offshore Spain 2,000 48 4 50 m l 50 m l 50ml50 \mathrm{ml}50ml 250 m 250 m 250m250 \mathrm{~m}250 m M M M\mathrm{M}M
30 Offshore Crete 2,125 96 4 25 m 25 m 25m25 \mathrm{~m}25 m 230 m 230 m 230m230 \mathrm{~m}230 m A
31 North Sea 1,550 96 4 25 m 25 m 25m25 \mathrm{~m}25 m 228 m 228 m 228m228 \mathrm{~m}228 m A
32 North Sea 1,550 96 4 25 m 25 m 25m25 \mathrm{~m}25 m 178 m 178 m 178m178 \mathrm{~m}178 m A
33 North Sea 1,625 96 4 25 m 25 m 25m25 \mathrm{~m}25 m 200 m 200 m 200m200 \mathrm{~m}200 m A
34 Celtic Sea 1,500 60 4 50 m 50 m 50m50 \mathrm{~m}50 m 253 m 253 m 253m253 \mathrm{~m}253 m A
35 Denmark 2,500 52 2 100 m 100 m 100m100 \mathrm{~m}100 m 100 m 100 m 100m100 \mathrm{~m}100 m D
36 Middle East 1,024 48 4 50 m 50 m 50m50 \mathrm{~m}50 m 250 m 250 m 250m250 \mathrm{~m}250 m v v v\mathrm{v}v
37
37
37 37| 37 | | :--- | | 37 |
Turkey
Iunk
Turkey Iunk| Turkey | | :--- | | Iunk |
1,000 48 4 75 m 75 m 75m75 \mathrm{~m}75 m 187 m 187 m 187m187 \mathrm{~m}187 m v v v\mathrm{v}v
$ 1 $ 1 $1\$ 1$1
38
$1 38| $\$ 1$ | | :--- | | 38 |
Imhc}
North Africa
Imhc} North Africa| Imhc} | | :--- | | North Africa |
2,500 60 2 100 m 100 m 100m100 \mathrm{~m}100 m 100 m 100 m 100m100 \mathrm{~m}100 m V V V\mathrm{~V} V
39 Middle East 2,500 60 2 50 m 50 m 50m50 \mathrm{~m}50 m 100 m 100 m 100m100 \mathrm{~m}100 m G
40 West Africa 2,600 96 2 30 m 30 m 30m30 \mathrm{~m}30 m 120 m 120 m 120m120 \mathrm{~m}120 m D D D\mathrm{D}D
"Record Number" Area "Number of Samples per Trace" "Number of Traces" "Sempling Interval, ms" "Trace Interval, ft or m" "Inner Offset, ft or m" Source 1 South Texas 1,275 48 4 330ft 990ft V 2 West Texas 1,025 120 4 100ft 400ft V **3 Louisiana 1,500 24 4 340ft 340ft D 4 Turkey 1,275 48 4 100m 250m V 5 South America 3,000 48 2 100m 200m D 6 Far East 1,250 48 4 100m 150m D 7 South America 2,600 48 2 100m 300m "D V" 8 Central America 1,300 96 4 50m 100m D 9 Alaska 1,000 96 4 220ft 990ft V 10 North Africa 1,325 120 4 25m 300m V 11 Alaska 1,000 96 4 220ft 990ft V 12 Mississippi 1,275 48 4 330ft 990ft v 13 Offshore Texas 2,025 48 4 220ft 875ft A 14 Offshore Texas 1,525 48 4 220ft 690ft "A P" 15 Offshore Canada 2,500 48 2 25m 360m 16 South America 1,275 48 4 25m "500m 233m" A 17 South America 2,000 48 4 50m 233m 18 Offshore Louisiana 1,500 120 4 80ft 250m A 19 Turkey 1,250 216 4 "82ft 10m" 716ft A 20 South Aleutians 2,025 120 4 50m D 21 Denver Basin "2,020 1,550" 48 82ft 921ft A 22 Williston Basin "1,550 1,550" 48 2 220ft 220ft V "22 23" San Juaquin Basin "1,550 1,550" "48 48" 2 110ft 110ft V 24 "San Juaquin Basin Arctic" 1,550 2 220ft 220ft V 25 "Arctic Alberta" 3,000 "48 96" 2 220ft 220ft S "23 26" "Alberta Alberta" 2,000 96 2 50m 50m D "20 27" "Alberta Canada" 1,500 48 2 67m 67m D "27 28" 1,791 92 4 50m 200m A Canada 2,500 48 2 25m 300m A 29 Offshore Spain 2,000 48 4 50ml 250m M 30 Offshore Crete 2,125 96 4 25m 230m A 31 North Sea 1,550 96 4 25m 228m A 32 North Sea 1,550 96 4 25m 178m A 33 North Sea 1,625 96 4 25m 200m A 34 Celtic Sea 1,500 60 4 50m 253m A 35 Denmark 2,500 52 2 100m 100m D 36 Middle East 1,024 48 4 50m 250m v "37 37" "Turkey Iunk" 1,000 48 4 75m 187m v "$1 38" "Imhc} North Africa" 2,500 60 2 100m 100m V 39 Middle East 2,500 60 2 50m 100m G 40 West Africa 2,600 96 2 30m 120m D| Record <br> Number | Area | Number of <br> Samples <br> per Trace | Number of <br> Traces | Sempling <br> Interval, ms | Trace <br> Interval, <br> ft or $\mathrm{m}$ | Inner <br> Offset, <br> ft or $m$ | Source | | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | | 1 | South Texas | 1,275 | 48 | 4 | $330 \mathrm{ft}$ | $990 \mathrm{ft}$ | $\mathrm{V}$ | | 2 | West Texas | 1,025 | 120 | 4 | $100 \mathrm{ft}$ | $400 \mathrm{ft}$ | V | | $* 3$ | Louisiana | 1,500 | 24 | 4 | $340 \mathrm{ft}$ | $340 \mathrm{ft}$ | $\mathrm{D}$ | | 4 | Turkey | 1,275 | 48 | 4 | $100 \mathrm{~m}$ | $250 \mathrm{~m}$ | $\mathrm{~V}$ | | 5 | South America | 3,000 | 48 | 2 | $100 \mathrm{~m}$ | $200 \mathrm{~m}$ | D | | 6 | Far East | 1,250 | 48 | 4 | $100 \mathrm{~m}$ | $150 \mathrm{~m}$ | D | | 7 | South America | 2,600 | 48 | 2 | $100 \mathrm{~m}$ | $300 \mathrm{~m}$ | D <br> $V$ | | 8 | Central America | 1,300 | 96 | 4 | $50 \mathrm{~m}$ | $100 \mathrm{~m}$ | D | | 9 | Alaska | 1,000 | 96 | 4 | $220 \mathrm{ft}$ | $990 \mathrm{ft}$ | V | | 10 | North Africa | 1,325 | 120 | 4 | $25 \mathrm{~m}$ | $300 \mathrm{~m}$ | $\mathrm{~V}$ | | 11 | Alaska | 1,000 | 96 | 4 | $220 \mathrm{ft}$ | $990 \mathrm{ft}$ | $\mathrm{V}$ | | 12 | Mississippi | 1,275 | 48 | 4 | $330 \mathrm{ft}$ | $990 \mathrm{ft}$ | $v$ | | 13 | Offshore Texas | 2,025 | 48 | 4 | $220 \mathrm{ft}$ | $875 \mathrm{ft}$ | $\mathrm{A}$ | | 14 | Offshore Texas | 1,525 | 48 | 4 | $220 \mathrm{ft}$ | $690 \mathrm{ft}$ | $A$ <br> $\mathbf{P}$ | | 15 | Offshore Canada | 2,500 | 48 | 2 | $25 \mathrm{~m}$ | $360 \mathrm{~m}$ | | | 16 | South America | 1,275 | 48 | 4 | $25 \mathrm{~m}$ | $500 \mathrm{~m}$ <br> $233 \mathrm{~m}$ | A | | 17 | South America | 2,000 | 48 | 4 | $50 \mathrm{~m}$ | $233 \mathrm{~m}$ | | | 18 | Offshore Louisiana | 1,500 | 120 | 4 | $80 \mathrm{ft}$ | $250 \mathrm{~m}$ | A | | 19 | Turkey | 1,250 | 216 | 4 | $82 \mathrm{ft}$ <br> $10 \mathrm{~m}$ | $716 \mathrm{ft}$ | A | | 20 | South Aleutians | 2,025 | 120 | 4 | | $50 \mathrm{~m}$ | $\mathrm{D}$ | | 21 | Denver Basin | 2,020 <br> 1,550 | 48 | | $82 \mathrm{ft}$ | $921 \mathrm{ft}$ | A | | 22 | Williston Basin | 1,550 <br> 1,550 | 48 | 2 | $220 \mathrm{ft}$ | $220 \mathrm{ft}$ | $\mathrm{V}$ | | 22 <br> 23 | San Juaquin Basin | 1,550 <br> 1,550 | 48 <br> 48 | 2 | $110 \mathrm{ft}$ | $110 \mathrm{ft}$ | V | | 24 | San Juaquin Basin <br> Arctic | 1,550 | | 2 | $220 \mathrm{ft}$ | $220 \mathrm{ft}$ | V | | 25 | Arctic <br> Alberta | 3,000 | 48 <br> 96 | 2 | $220 \mathrm{ft}$ | $220 \mathrm{ft}$ | $S$ | | 23 <br> 26 | Alberta <br> Alberta | 2,000 | 96 | 2 | $50 \mathrm{~m}$ | $50 \mathrm{~m}$ | $\mathrm{D}$ | | 20 <br> 27 | Alberta <br> Canada | 1,500 | 48 | 2 | $67 \mathrm{~m}$ | $67 \mathrm{~m}$ | D | | 27 <br> 28 | | 1,791 | 92 | 4 | $50 \mathrm{~m}$ | $200 \mathrm{~m}$ | A | | | Canada | 2,500 | 48 | 2 | $25 \mathrm{~m}$ | $300 \mathrm{~m}$ | A | | 29 | Offshore Spain | 2,000 | 48 | 4 | $50 \mathrm{ml}$ | $250 \mathrm{~m}$ | $\mathrm{M}$ | | 30 | Offshore Crete | 2,125 | 96 | 4 | $25 \mathrm{~m}$ | $230 \mathrm{~m}$ | A | | 31 | North Sea | 1,550 | 96 | 4 | $25 \mathrm{~m}$ | $228 \mathrm{~m}$ | A | | 32 | North Sea | 1,550 | 96 | 4 | $25 \mathrm{~m}$ | $178 \mathrm{~m}$ | A | | 33 | North Sea | 1,625 | 96 | 4 | $25 \mathrm{~m}$ | $200 \mathrm{~m}$ | A | | 34 | Celtic Sea | 1,500 | 60 | 4 | $50 \mathrm{~m}$ | $253 \mathrm{~m}$ | A | | 35 | Denmark | 2,500 | 52 | 2 | $100 \mathrm{~m}$ | $100 \mathrm{~m}$ | D | | 36 | Middle East | 1,024 | 48 | 4 | $50 \mathrm{~m}$ | $250 \mathrm{~m}$ | $\mathrm{v}$ | | 37 <br> 37 | Turkey <br> Iunk | 1,000 | 48 | 4 | $75 \mathrm{~m}$ | $187 \mathrm{~m}$ | $\mathrm{v}$ | | $\$ 1$ <br> 38 | Imhc} <br> North Africa | 2,500 | 60 | 2 | $100 \mathrm{~m}$ | $100 \mathrm{~m}$ | $\mathrm{~V}$ | | 39 | Middle East | 2,500 | 60 | 2 | $50 \mathrm{~m}$ | $100 \mathrm{~m}$ | G | | 40 | West Africa | 2,600 | 96 | 2 | $30 \mathrm{~m}$ | $120 \mathrm{~m}$ | $\mathrm{D}$ |
  • Analog recording. V: vibroseis, D: dynamite, A: Air gun, P: Aquapulse, M: Maxipulse, G: Geoflex, S: Aquaseis. All vibroseis records have been correlated. Aquapulse and Maxipulse are registered trademarks of Western Geophysical Company of America. Aquaseis and Geoflex are registered trademarks of Imperial Chemical Industries.
    ularities can have lateral dimensions that range from less than a group interval to wavelengths that are several times a cable length. As seen on the right flank of the hyperbolas (events A, B, C, and D), these irregularities cause substantial time shifts in reflection arrivals. Such distortions in moveout could be dynamic (timedependent) or static (time-independent). They should be corrected before stacking. Except for these distortions, all events seem to have symmetric, hyperbolic moveouts that indicate nearly horizontally layered substrata.
Record 12 is a field record with a low signal-tonoise ratio. A complex subsurface structure is implied between 2 and 3.5 s 3.5 s 3.5s3.5 \mathrm{~s}3.5 s.
From Record 13, note the high-frequency hyperbolic energy S S S\mathrm{S}S that is associated with a side scatterer, possibly at the water bottom.
Record 14 has three identifiable reflections: A, B, and C. Reverberations and multiples also make up a significant portion of the data.
Record 15 is a marine record. The hard water bottom causes refraction arrival A A A\mathbf{A}A. This shot gather primarily contains guided waves, which are manifested as linear trends such as B, C, and D. The genuine reflection E E E\mathrm{E}E has little moveout.
Guided waves are trapped within a water layer and travel in the horizontal direction. They are dispersive each frequency component travels at a different speed, which is called horzzontal phase velocity. Their behavior is variable, primarily dictated by water bottom conditions and the thickness of the water layer. They are an important source of coherent noise and are confined mainly to the supercritical region of propagation, where no transmission occurs into the substratum. The nature of guided waves is analyzed in Section F.1.
Wave packet A A AAA in Record 16 is made up entirely of guided waves. Direct arrivals B carry the highest frequency components, while lower frequencies C C C\mathrm{C}C arrive earlier. Moderate frequencies D make up the later portion of the dispersive wave packet. This record has a reflection E E E\mathrm{E}E and long-period multiples M1 through M4. The reflection and its multiples also have an accompanying reverberating wavetrain that is nearly 300 m s 300 m s 300ms300 \mathrm{~ms}300 ms long.
Record 17 is longer than the common length (4 to 6 s ) 6 s ) 6s)6 \mathrm{~s})6 s) used in seismic data acquisition. There is no apparent signal after 4 s 4 s 4s4 \mathrm{~s}4 s; nevertheless, very weak signals can sometimes be uncovered by stacking.
Record 18 has some events worth mentioning. Dispersive waves, which include the head wave and direct arivals A make up the early portion of the record. Some reflections, B, C, and D, are followed by short-period reverberations. In the deeper part of the record, note the events with extremely large moveout E E E\mathrm{E}E, which is unusual for deep data. These events represent the sidescattered coherent noise.
Record 19 is a walk-away noise test. It is actually a composite of six shot records. The receiver cable was held constant while the shots were moved away without overlap. The receiver group interval is 10 m 10 m 10m10 \mathrm{~m}10 m. The receivers in each group were bundled together without array forming. This allowed all signal and noise wavelengths to be recorded. Horizontal wavelength is determined by measuring the dominant frequency (the reciprocal of the time between successive peaks or troughs) and the horizontal phase velocity (the reciprocal of stepout Δ t ( Δ x ) Δ t ( Δ x ) Delta t(Delta x)\Delta t(\Delta x)Δt(Δx) of the unwanted ground roll. The horizontal wavelength then is used to design the receiver array length that is needed to suppress this energy (see Exercise 1-4). Wave packet A1-A2 (between 1.7 and 4.6 s s sss on the far-left trace) is an excellent example of ground roll. The linear coherent energy with opposite dip A1A2 is the backscattered component. Reflection C C C\mathrm{C}C is being disrupted by ground-roll energy.
Ground roll is different from guided waves, although both are dispersive. Ground roll is one type of Rayleigh wave that arises because of the coupling of compressional waves ( P ) ( P ) (P)(P)(P) and the vertical component of shear waves ( S η S η S etaS \etaSη ) that propagate along the free surface (Grant and West, 1965). On the other hand, guided waves are one kind of compressional wave that travels within a layer just as sound waves travel in an organ pipe.
Record 20 (marine) shows a variety of wave types. Direct arrivals A A AAA are significantly suppressed by receiver arrays in the field. We can see the water bottom reflection B on short-offset traces. Note a shallow reflector C C C\mathrm{C}C and associated refraction arrival D D D\mathrm{D}D. At 1 s 1 s 1s1 \mathrm{~s}1 s, another reflector E E EEE is seen. Much of the energy between 1 and 3 s most likely is multiples associated with B, C, and E E EEE. Linear noise (possibly cable noise) F F FFF and the lowerfrequency propeller noise G G GGG appear in the deeper portion of the record after 4 s 4 s 4s4 \mathrm{~s}4 s.
Record 21 (vibroseis) has a weak A A AAA and a strong B B BBB shallow reflector. Below 2 s 2 s 2s2 \mathrm{~s}2 s, ambient noise dominates the record.
Record 22 is another vibroseis record. Note reflection arrivals A 1 B A 1 B A_(1)BA_{1} BA1B, and C C CCC. Although reasonably hyperbolic, there are some fluctuations in traveltimes that may be attributed to near-surface complexity (as inferred by the first breaks). Record 23 shows similar characteristics.
Record 24 is a marine shot gather that was acquired with an Aquaseis source. Direct arrivals A, water-bottom reflection B B BBB, and first-order multiples M 1 M 1 M1M 1M1, M2, are recognized easily. A primary reflection P P PPP and its peg-leg multiple PL also are distinguished.
hecord 25 (land) has a very good signal quality. In addition to the several primary reflections, note groundroll energy A. It is predominantly low frequency and travels with low group velocity (the speed with which the energy in a wave packet travels). Also note the nearsurface effects that cause traveltime distortions along the right flanks of reflections B, C, D, and E.
Record 26 (dynamite) does not have a welldeveloped ground-roll energy; however, it still is recognianhle from its low-froquency character A. Traveltime paths that correspond to reflections (for example, B, C, and D) have been disrupted by ground roll and possibly distorted by irregularities in the near surface.
Record 27 (marine) is interesting. Note the change in the cable geometry A (Exercise 1-6). There is a welldeveloped dispersive wave packet B B B\mathbf{B}B that spans between 1.9 and 2.9 s 2.9 s 2.9s2.9 \mathrm{~s}2.9 s at the far-offset trace. This includes the head wave and direct arrivals. Also note the distinct. moveout difference between events C C C\mathrm{C}C and D D D\mathrm{D}D. Event C C C\mathrm{C}C, with a larger moveout, belongs to the short-period multjple wavetrain that is associated with the water-bottom reflection. Event D, with a small moveout, is a primary reflection with its own peg-leg series F F F\mathbf{F}F.
The air-gun data in Record 28 contain highvelocity reflections with little moveout. Note the predominant guided wave packet C C C\mathrm{C}C that spans between 0.7 and 1.9 s 1.9 s 1.9s1.9 \mathrm{~s}1.9 s at the far-offset trace. It results from the strong water-bottom refractor D D D\mathrm{D}D.
Record 29 is puzzling (see Exercise 1-7). The skewness of the reflection hyperbolas ( B , C , D B , C , D B,C,DB, C, DB,C,D, and E E EEE ) increases in depth.
Record 30 is a deep-water shot record. The direct arrival A A AAA, water-bottom reflection B B BBB, and shallow reflection C C C\mathrm{C}C, can be identified easily. First-order waterbottom multiples M M M\mathrm{M}M and peg-leg multiples P L P L PL\mathrm{PL}PL, which are associated with the shallow reflector C C C\mathrm{C}C, also are prominent in this record.
Record 31 is a shot record primarily made up of guided waves. The following wave types are identified: A is the refraction arrival, B B B\mathrm{B}B is its multiples, C C C\mathrm{C}C is the direct arrival, D D DDD is the dispersive medium-frequency components of guided waves between 1.8 and 3 s 3 s 3s3 \mathrm{~s}3 s at the far-offet trace, and E E EEE is the backscattered energy associated with side scatterers at the water bottom.
Record 32 is another marine record that contains strong guided wave energy. A refractor A, direct arrival B, and dispersed wave packet C C CCC span between 1.2 and 4 s 4 s 4s4 \mathrm{~s}4 s at the far-offset trace. Events D and E represent subcritical reflection energy, most of which is reverberation.
The events on Records 33 and 34 are referred to in Exercises 1 9 1 9 1-91-919 and 1 10 1 10 1-101-10110, respectively.
The four far left traces in Record 35 are associated with the channels that are used to record auxiliary information.
Record 36 seems to have no events with hyperbolic moveout. Record 37 has a few refections, A D , B E A D , B E AD,BE\mathrm{AD}, \mathrm{BE}AD,BE, C F C F CF\mathrm{CF}CF; however, they are buried in strong ambient noise. Record 38 contains virtually no reflections. A strong dispersive wave (ground roll) makes up the early part of the record, while the remaining part contains primarily random noise.
Record 39 is a Geoflex record containing strong ground-roll energy A. Additionally, the record from top to bottom contains a strong high-frequency reverberating wavetrain and short-period multiples that are associated with the water bottom and, perhaps, a few shallow reflectors.
Record 40 has a small usable segment the longer offset traces on the left side between 1 and 4 s 4 s 4s4 \mathrm{~s}4 s. The remaining part of the record contains strong random noise and transient noise, A, B, C, D, and E, which are attributed to electronic instrument noise (possibly resulting from weather conditions).

Wave Types

To summarize, field records contain (a) reflections, (b) coherent noise, and (c) random ambient noise. One important aspect of data processing is to uncover genuine reflections by suppressing noise of various types. Processing, however, cannot yield sagnal from field data without signal. At best, it suppresses whatever noise is in the field data and enhances the refection energy that is buried in the noise. Seismic data must not be acquired with the attitude, 'Don't worry, processing will bring out the signal."
Reflections on shot records are recognized by their hyperbolic traveltimes. If the reflecting interface is horizontal, then the apex of the reflection hyperbola is situated at zero offset. On the other hand, if it is a dipping interface, then the reflection hyperbola is skewed in the updip direction.
There are several wave types under the coherent noise category:
(a) Ground roll is recognized by low frequency, strong amplitude, and low group velocity. It is the vertical component of dispersive surface waves. In the field, receiver arrays are used to eliminate ground roll. Ground roll can have strong backscattered components because of lateral inhomogeneities in the near-surface layer.
(b) Guded waves are persistent, especially in shallow marine records in areas with hard water bottom. The water layer makes a strong velocity contrast with the substratum, which causes most of the energy to be trapped within and guided laterally






oo\infty



लें म्ल ब्रें

through the water layer. The dispersive nature of these waves makes them easy to recognize on shot records. Guided waves also make up the early arrivals. The stronger the velocity contrast between the water layer and the substratum, the smaller the critical angle; thus, more guided-wave energy is trapped in the supercritical region. When there is a strong velocity contrast, refraction energy propagates in the form of a head wave. Guided waves also are found in land records. These waves are largely attenuated by CMP stacking. Because of their prominently linear moveout, in principle they also can be suppressed by dip filtering techniques. One such fltering technique is based on 2-D Fourier transformation of the shot record. This is discussed in Section 6.2. Another approach is based on slant stacking, which is described in Section 6.3.
(c) Side-scattered notse commonly occurs at the water bottom, where there is no flat, smooth topography. Irregularities of varying size act as point scatterers, which cause diffraction arrivals with table-top trajectories. They can be on or off the vertical plane of the recording cable. These arrivals typically exhibit a large range of moveouts, depending on the spatial position of the scatterers in the subsurface.
(d) Cable noise is linear and low in amplitude and frequency. It primarily appears on shot records as late arrivals.
(e) The air wave with a 300 m / s 300 m / s 300m//s300 \mathrm{~m} / \mathrm{s}300 m/s velocity can be a serous problem when shooting with surface charges such as Geoflex, Poulter, or land air gun. Perhaps whe only effective way to remove air waves is to zero out the data on shot gathers along a narrow corridor containing this energy (notch muting). It often is impossible to recover any data arriving after the air wave on Poulter data.
(f) Power hnes also cause noisy traces in the form of a monofrequency wave. A monofrequency wave may be 50 or 60 H z 60 H z 60Hz60 \mathrm{~Hz}60 Hz, depending on where the field survey was conducted. Notch filters often are used in the field to suppress such energy.
(g) Multoples are secondary reflections with interbed or intrabed raypaths. Guided waves include supercritical multiple energy. Multiples are attacked by methods, which are based on moveout discrimination, and prediction theory, which uses the periodic behavior of multiples. The most effective moveoutbased suppression technique often is CMP stack with inside-trace mute (Section 6.1). Prediction theory should be particularly effective, at least in theory, in the slant-stack domain (Section 6.3).
Random nowe has various sources. A poorly planted geophone, wind motion, transient movements in the vicinity of the recording cable, wave motion in the water that causes the cable to vibrate, and electrical noise from the recording instrument all can cause ambient noise. The net result of scattered noise from many scatterers in the subsurface also contributes to random noise (Lamer et al., 1983).
In Section 1.4, it is noted that energy propagating within the earth is subject to a decay in amplitude because of wavefront divergence and frequency-dependent absorption from the intrinsic attenuation of rocks. Signal strength therefore decreases in time, while random noise persists and eventually dominates. Unfortunately, gain corrections to restore signal strength at later times boost random noise in the process. Fortunately, CMP stack suppresses a significant part of the random noise uncorrelated from trace to trace.

1.4 GAIN APPLICATIONS

Gain is a teme-varant scaling in which the scaling function is based on a desired criterion. For instance, geometric spreading correction is applied to compensate for wavefront divergence early in processing, before deconvolution. Also before deconvolution, an exponential gain may be applied to compensate for attenuation losses. Often, gain is applied to seismic data for display. An automatic gain control (AGC) is applied to seismic data to bring up weak signals. Gain must be used with care, since it can destroy signal character. For example, an instantaneous AGC with a very small time gate makes strong reflections indistinguishable from weak reflections.
Unlike a gain function, trace balancing is a timeinvartant scaling of amplitudes. Trace balancing usually is based on rms-amplitude criterion. Specifically, each trace in a group of traces is scaled so that they all have the sanne desired rms amplitude level.

Geometric Spreading Correction

A field record represents a wavefield that is generated by a single shot. Conceptually, a single shot is thought of as a point source that generates a spherical wavefield. The earth has two effects on a propagating wavefield:
(a) In a homogeneous medium, energy density decays proportionately to 1 / r 2 1 / r 2 1//r^(2)1 / r^{2}1/r2, where r r rrr is the radius of the wavefront. Wave amplitude is proportional to the square root of energy density; it decays as 1 / r 1 / r 1//r1 / r1/r.
FIG. 1.4-1. A raw field record with no geometric spreading correction (far left panel) and its band-pass filtered versions. Note that the larger reflection amplitudes are confined to shallower times at increasingly higher frequency bands.
FIG. 1.4-2. The same field record as in Figure 1.4-1 (far left panel) after correcting for geometric spreading. Amplitudes are restored but frequency absorption remains.
In practice, velocity usually increases with depth, which causes further divergence of the wavefront and a more rapid decay in amplitudes with distance.
(b) The frequency content of the initial source signal changes in a time-variant manner as it propagates. In particular, high frequencies are absorbed more rapidly than low frequencies. This is because of the intrinsic attenuation in rocks.
Attenuation mechanisms still are the subject of extensive research. However, one plausible mechanism for attenuation is related to pore fluids. As the wavefront passes through rocks, the fluids that are present in the pores are disturbed. This disturbance is greater in partially saturated rocks than fully saturated rocks. Pore fluids consume part of the energy of the propagating wavefield, which causes a frequency-dependent decay.
From Figure 1.4-1, note the wavefront divergence and frequency absorption on the field record. The first panel represents field data without any gain recovery function applied. Note the gradual decay in amplitude at later times. This record was filtered with a series of 10-Hz-wide band-pass filters. The signal in the 10-to-20 H z H z Hz\mathrm{Hz}Hz panel exists down to about 6 s 6 s 6s6 \mathrm{~s}6 s. On the 20 20 20-20-20 to 30 H z 30 H z -30-Hz-30-\mathrm{Hz}30Hz panel, however, signal is visible only down to about 4 s. Moving to the higher frequency panels, note that the signal level is confined mainly to increasingly shallower times. Now apply the geometric spreading correction to the original field record in the far left panel of Figure 1.4-1. The result is shown in the far left panel of Figure 1.4-2. The amplitude level has been restored at late traveltimes. Filter panels of this record also are shown in Figure 1.4-2. When the filter panels in Figures 1.4-1 and 1.4-2 are compared with the same pass band, we see that the geometric spreading correction brought up some of the signal level at late times. However, note that the geometric spreading correction did not restore the amplitudes of the high frequencies as much as it restored the low frequencies, since the high frequencies were subject to stronger attenuation.
Figure 1.4-3 shows a portion of a CMP-stacked section and its filtered versions using narrow band-pass filters. Note that signal bandwidth only up to 20 H z 20 H z 20Hz20 \mathrm{~Hz}20 Hz is observed down to 5 s 5 s 5s5 \mathrm{~s}5 s, and frequencies up to 36 H z 36 H z 36Hz36 \mathrm{~Hz}36 Hz are observed down to 3.5 s 3.5 s 3.5s3.5 \mathrm{~s}3.5 s. The erosional unconformity just below 3.5 s 3.5 s 3.5s3.5 \mathrm{~s}3.5 s constitutes a boundary with large frequency absorption. This results in attenuation of much of the high-frequency signal below this boundary. Frequencies above 36 H z 36 H z 36Hz36 \mathrm{~Hz}36 Hz are confined to the shallow portion of the stacked section down to 2.5 s 2.5 s 2.5s2.5 \mathrm{~s}2.5 s.
The effect of attenuation must be removed by modifying the amplitude spectrum of the signal, thereby making it broader. Deconvolution is one process that
FIG. 1.4-3. A portion of a CMP-stacked section and its filtered versions. Note the attenuation of high frequencies below 2.5 s 2.5 s 2.5s2.5 \mathrm{~s}2.5 s.
FIG. 1.4-4. Raw field records from a land survey. Note the rapid decay in amplitudes at late times.
FIG. 1.4-5. The same field records as in Figure 1.4-4 after correcting for geometric spreading. The amplitudes have been restored at late times. Unfortunately, ambient noise also has been strengthened.
is used to achieve this goal. Alternative methods to compensate for frequency attenuation are time-variant spectral whitening and inverse- Q Q QQQ filtering. All three processes are described in Chapter 2.
The factor 1 / r 1 / r 1//r1 / r1/r that describes the decay of wave amplitudes as a function of the radius of the spherical wavefront is valid for a homogeneous medium without attenuation. For a layered earth, amplitude decay can be described approximately by 1 / [ v 2 ( t ) t ] 1 / v 2 ( t ) t 1//[v^(2)(t)t]1 /\left[v^{2}(t) t\right]1/[v2(t)t] (Newman, 1973). Here, t t ttt is the two-way traveltime and v ( t ) v ( t ) v(t)v(t)v(t) is the root-mean-squared (rms) velocity (Section 3.1) of the primary reflections (those reflected only once) averaged over a survey area. Therefore, the gain function for geometric spreading compensation is defined by
g ( t ) = v 2 v 0 2 ( t ) t t 0 g ( t ) = v 2 v 0 2 ( t ) t t 0 g(t)=(v^(2))/(v_(0)^(2))((t)t)/(t_(0))g(t)=\frac{v^{2}}{v_{0}^{2}} \frac{(t) t}{t_{0}}g(t)=v2v02(t)tt0
(a)
(b)
FIG. 1.4-6. (a) A raw field record from a marine survey. Before correcting for geometric spreading, refraction and guided wave energy dominate the record. (b) After the geometric spreading correction, while refection amplitudes have been restored, multiples and coherent noise also have been boosted.
where v 0 v 0 v_(0)v_{0}v0 is the reference velocity at specified time t 0 t 0 t_(0)t_{0}t0. A more rigorous offset-dependent and time-dependent description of the geometric spreading correction function also can be used.
Signal-level decay is evident in the field records in Figure 1.4-4. Note the weak appearance of reflections, particularly below 1 s 1 s 1s1 \mathbf{s}1s. This does not mean that there are no strong reflections below this time. Because of the amplitude decay resulting from wavefront divergence, no signal is seen at late times. As stated previously, this earth effect must be removed to bring up any signal that may be present in the deep portion of the record.
The same shot records after geometric spreading correction are shown in Figure 1.4-5. While reflections have been brought up in strength, noise components in the data also have been boosted. This is one undesirable aspect of any type of gain application.
Besides ambient noise, coherent noise in the data may be boosted as shown in Figure 1.4-6. By using the primary velocity function in correcting for geometric spreading, the amplitudes of the dispersive coherent noise and multiples have been overcorrected. Another example of overcorrected multiples is shown in Figure 1.4-2. (Compare the far left panel with its equivalent in Figure 1.4-1.)
To prevent overcorrection of amplitudes of multiple reflections, a velocity-independent scaling function, such as
g ( t ) = t α g ( t ) = t α g(t)=t^(alpha)g(t)=t^{\alpha}g(t)=tα
where α α alpha\alphaα usually is set to 2, can be used for geometric spreading correction (Claerbout, 1985). Figure 1.4-7 shows a marine record after muting the guided waves and applying t t ttt-squared scaling. Note from the amplitude spectrum averaged over the shot record that geometric spreading correction does not restore frequency components of the wavefield which are subject to absorption effects in rocks. Nevertheless, by correcting for amplitude decay caused by wavefront divergence, the autocorrelogram better describes the reverberations across all offsets. Actually, t t ttt-squared scaling now is a commonly used scaling function for geometric spreading correction.

Programmed Gain Control

Various types of gain criteria are used in practice. Based on a desired criterion, a gain function g ( t ) g ( t ) g(t)g(t)g(t) is derived from the data and multiplied with trace amplitudes at each time sample. This is illustrated in Figure 1.4-8. The gain function is specified or estimated at the time samples indicated by the dots and interpolated between these samples.
Programmed gain control (PGC) is the simplest type of gain. Referring to part of a stacked section in Figure 1.4-9, a gain function can be defined by interpolating between some scalar values specified at particular time samples. Larger scalar values naturally would be assigned at late times. In Figure 1.4-9, the applied PGC factors are indicated by the pairs of numbers corresponding to 0 and 6 s 6 s 6s6 \mathrm{~s}6 s. While the input panel indicates strong amplitudes at shallow times, the section scaled by the PGC factors ( 1 , 4 ) ( 1 , 4 ) (1,4)(1,4)(1,4) indicates a balanced amplitude level from top to bottom.
Rather than picking the scalars in a qualitative manner, the envelope of the ungained trace can be computed and smoothed. The envelope, which is the curve drawn by smoothly connecting the adjacent peaks (or troughs) along the trace, is a reliable attribute that describes amplitude decay rate. The PGC function then is the inverse of the trace envelope. A single PGC function is applied to all traces in a gather or stacked section to preserve the relative amplitude variations in the lateral direction.

RMS Amplitude AGC

The rms amplitude AGC gain function is based on the rms amplitude within a specified time gate on an input trace. This gain function is computed as follows. The input trace is subdivided into fixed time gates. First, the amplitude of each sample in a gate is squared. Second,
FIG. 1.4-7. (a) A field record from a marine survey, (b) after muting guided waves, and (c) after the geometric spreading correction using t 2 t 2 t^(2)t^{2}t2 as the scaling function. Shown on top are the amplitude spectra sveraged over the shot record, and at the bottom are the autocrrelograms.
FIG. 1.4-8. Gain is a time-variant scaling defined by a function, g ( t ) g ( t ) g(t)g(t)g(t). Based on some criteria, this function is defined at the time samples (shown by sold circles) that are usually at the center of specified time gates along the trace as indicated by 1 , 2,3 , and 4 . Gain application simply involves multiplying g ( t ) g ( t ) g(t)g(t)g(t) by the input trace amplitudes.
the mean of these values is computed and its square root is taken. This is the rms amplitude over that gate. The ratio of a desired rms amplitude (say 2000) to the actual r m s r m s rms\mathrm{rms}rms value is assigned as the value of the gain function at the center of the gate. Hence, the scaling function g ( t ) g ( t ) g(t)g(t)g(t) at the gate center is given by
g ( t ) = desired rms 1 N t = 1 N x i 2 g ( t ) =  desired rms  1 N t = 1 N x i 2 g(t)=(" desired rms ")/(sqrt((1)/(N)sum_(t=1)^(N)x_(i)^(2)))g(t)=\frac{\text { desired rms }}{\sqrt{\frac{1}{N} \sum_{t=1}^{N} x_{i}^{2}}}g(t)= desired rms 1Nt=1Nxi2
where x t x t x_(t)x_{t}xt is the trace amplitude and N N NNN is the number of samples within the gate.
Typically, we start out with a certain gate length at the shallow part of the trace. Gate length can be kept either constant or it can be increased systematically down the trace. At each gate center, the value of the gain function is computed as described above. Function g ( t ) g ( t ) g(t)g(t)g(t) then is interpolated between the gate centers. Note that the specified time gates are stationary they do not slide down the trace.
Figure 1.4-10 shows the ungained data and two rms-gained sections. The gate lengths are indicated at the top of each panel. When the gate used in the com- putation is kept small, say 64 m s 64 m s 64ms64 \mathrm{~ms}64 ms, then strong reflections become less distinct.

Instantaneous AGC

Instantaneous A G C A G C AGCA G CAGC is one of the most common gain types used. This gain function is computed as follows. First, the mean absolute value of trace amplitudes is computed within a specified time gate. Second, the ratio of the desired rms level to this mean value is assigned as the value of the gain function. Unlike the rms amplitude A G C A G C AGC\mathrm{AGC}AGC, this value is assigned to any desired time sample of the gain function within the time gate, say the n n nnnth sample of the trace, rather than to the sample at the center of the gate. The next step is to move the time gate one sample down the trace and compute the value of the gain function for the ( n + 1 ) ( n + 1 ) (n+1)(n+1)(n+1) th time sample, and so on. No interpolation is therefore required to define this gain function. Hence, the scaling function g ( t ) g ( t ) g(t)g(t)g(t) at the gate center is given by
FIG. 1.4-9. A portion of a CMP stack before and after application of two different PGC functions. The scale factors used in constructing the gain functions are indicated by the pairs of numbers on top of the gained sections, the first scalar in the pair corresponds to time t = 0 t = 0 t=0t=0t=0, and the second scalar corresponds to time t = 6 s t = 6 s t=6st=6 \mathrm{~s}t=6 s.
FIG. 1.4-10. A portion of a CMP stack before and after application of two different rms AGC functions. Numbers on the top indicate the window sizes in milliseconds used in computing the AGC gain function described by equation (1-9a).
FIG. 1.4-11. A portion of a CMP stack before and after application of five different instantaneous AGC functions. The numbers on top indicate gain window sizes in milliseconds used in computing the AGC gain function described by equation (1-9b).
g ( t ) = desired rms 1 N t = 1 N | x 2 | g ( t ) =  desired rms  1 N t = 1 N x 2 g(t)=(" desired rms ")/((1)/(N)sum_(t=1)^(N)|x_(2)|)g(t)=\frac{\text { desired rms }}{\frac{1}{N} \sum_{t=1}^{N}\left|x_{2}\right|}g(t)= desired rms 1Nt=1N|x2|
where x t x t x_(t)x_{t}xt is the trace amplitude and N N NNN is the number of samples within the gate.
Figure 1.4-11 shows the ungained data and four instantaneous AGC-gained sections. Gate lengths are indicated on top of each panel. Very small time gates cause a significant can loss of signal character by boosting zones that contain small amplitudes. This occurs with the 64-ms AGC output. In processing, this is called a fast AGC. In the other extreme, if a large time gate is selected, then the effectiveness of the AGC process is lessened. In practice, AGC time gates commonly aте specified between 200 and 500 m s 500 m s 500ms500 \mathrm{~ms}500 ms.

Relative Trace Balancing

All of the gain applications described in this section modify the trace amplitudes by function g ( t ) g ( t ) g(t)g(t)g(t) in a timevarying manner (equations 1-4 and 1-5). In true amplitude processing, it is necessary to display the data without applying a time-varying data-dependent gain function. However, some amplitude scaling is always necessary for display, since plotters require input data amplitudes to fall in a specific range. Trace balancing (trace equalization) schemes are used for this type of scaling. The balance factor is defined as the ratio of the desired rms to the rms amplitude that is computed from a specified time window. A separate balance factor
(a)
(b)
(c)
FIG. 1.4-12. (a) A field record, (b) after geometric spreading correction which shows differences in amplitude levels of the near- and far-offset channels caused by differences in gain settings during recording. (c) Following the application of trace balancing, these differences in amplitudes are removed. Displayed at the bottom are the autocorrelograms. Note in (a) the effect of different gain settings on the amplitude level of the autocorrelogram from trace to trace.
is computed for and applied to each trace, individually, Alternatively, a single balance factor based on a selected trace within a group of traces can be applied to the entire group. This is called relative trace balancing. Note that trace halancing amounts to scaling the trace by using a single factor that is time-invariant (equivalent to a single-window rms AGC). Figure 1.4-12 shows rms trace balancing of field data to correct for the differences in gain settings between the recording channels. Trace balancing commonly is applied immediately after deconvolution, and on final stacks using large gates.

1.5 BASIC DATA PROCESSING SEQUENCE

Since the intruduction of digital recording, a routine sequence in seismic data processing has evolved. This basic sequence now is described to gain an overall understanding of each step. There are three primary steps in processing seismic data - deconvolution, stacking, and migration, in their usual order of application. Figure 1.5-1 represents the seismic data volume in processing coordinates - midpoint, offset, and time. Deconvolu-
FIG. 1.5-1. Seismic data volume represented in processing coordinates - midpoint-offact-time. Deconvolution acts on the data along the time axis and increases temporal resolution. Stacking compresses the data volume in the offset direction and yields the plane of stacked section (the frontal fece of the prism). Migration then moves dipping events to their true subsurface positions and collapses diffractions, and thus increases lateral resolution.
tion acts along the time axis. It removes the basic seismic wavelet (the source time function modified by various effects of the earth and recording system) from the recorded seismic trace and thereby increases temporal resolution. Deconvolution achieves this goal by compressing the wavelet (Chapter 2). Stacking also is a process of compression (Chapter 3). In particular, the data volume in Figure 1.5-1 is reduced to a plane of midpoint-time at zero offiset (the frontal face of the prism) first by applying normal moveout correction to traces from each CMP gather (Section 3.1), then by summing them along the offset axis. The result is a stacked section. (The terms stacked section, CMP stack, and stack often are used synonymously.) Finally, migration commonly is applied to stacked data. It is a process that collapses diffractions and maps dipping events on a stacked section to their supposedly true subsurface locations (Chapter 4). In this respect, migration is a spatial deconvolution process that improves spatial resolution.
All other processing techniques may be considered secondary in that they help improve the effectiveness of the primary processes. For example, dip filtering may need to be applied before deconvolution to remove coherent noise so that the autocorrelation estimate is based on reflection energy that is free from such noise. Wide band-pass filtering also may be needed to remove very low- and high-frequency noise. Before deconvolution, correction for geometric spreading is necessary to compensate for the loss of amplitude caused by wavefront divergence. Velocity analysis, which is an essential step for stacking, is improved by multiple attenuation and residual statics corrections.
Many of the secondary processes are designed to make data compatible with the assumptions of the three primary processes. Deconvolution assumes a stationary, vertically incident, minimum-phase source wavelet and white reflectivity series that is free of noise. Stacking assumes hyperbolic moveout, while migration is based on a zero-offset (primaries only) wavefield assumption. A pessimist could claim that none of these assumptions is valid. However, when applied to field data, these techniques do provide results that are close to the true subsurface image. This is because these three processes are robust and their performance is not very sensitive to the underlying assumptions in their theoretical development.
Keep in mind that the success of a process depends not only on the proper choice of parameters pertinent to that particular process, but also on the effectiveness of the previous processing steps.
We shall use a 2-D seismic line from the Caspian Sea to demonstrate the basic processing sequence. Table 1-14 provides the processing parameters for the line. The water depth at one end of the line is approximately 750 m 750 m 750m750 \mathrm{~m}750 m and decreases along the line traverse to approximately 200 m 200 m 200m200 \mathrm{~m}200 m at the other end.

Preprocessing

Field data are recorded in a multiplexed mode using a certain type of format. The data first are demultiplexed as described in Figure 1.5-2. Mathematically, demulti-
Table 1-14. Processing parameters for the Caspian line used to describe the basic processing sequence in this section.
Shot interval in m 25 m 25 mquad25\mathrm{m} \quad 25m25
Group interval in m 25 m 25 mquad25\mathrm{m} \quad 25m25
Number of receiver groups 180 180 quad180\quad 180180
Minimum offset in m 175 m 175 mquad175\mathrm{m} \quad 175m175
Maximum offset in m 4 , 6 5 0 m 4 , 6 5 0 mquad4,650\mathrm{m} \quad \mathbf{4 , 6 5 0}m4,650
CMP interval in m 12.5 m 12.5 mquad12.5\mathrm{m} \quad 12.5m12.5
Fold of coverage 90
Number of CMPs 6 , 212 6 , 212 quad6,212\quad 6,2126,212
Line length in k m 77.64 k m 77.64 kmquad77.64\mathrm{km} \quad 77.64km77.64
Sampling interval in m s 4 m s 4 msquad4\mathrm{ms} \quad 4ms4
Maximum time in m s 8 , 000 m s 8 , 000 msquad8,000\mathrm{ms} \quad 8,000ms8,000
Data volume in gigabytes 4.5 4.5 quad4.5\quad 4.54.5
FIG. 1,5-2. Seismic data are recorded in rows of samples samples at the same time at consecutive channels. Demultiplexing involves sorting the data into columns of samples - all the time samples in one channel followed by those in the next channels.
plexing is seen as transposing a big matrix so that the columns of the resulting matrix can be read as seismic traces recorded at different offsets with a common shot point. At this stage, the data are converted to a convenient format that is used throughout processing. This format is determined by the type of processing system and the individual company. A common format used in the seismic industry for data exchange is SEG-Y, established by the Society of Exploration Geophysicists.
Figure 1.5-3 shows selected shot records along the Caspian line under consideration. Note the strong amplitudes at the early part and the relatively weaker energy at the deeper part of the records. Such decay in amplitude primarily is caused by wavefront divergence. The dispersive nature of the guided waves resulting from normal-mode propagation within the water layer appears to vary from record to record. This result.s from a combination of varying water depth, depth of the source array, and water-bottom conditions (Section F.1).
Preprocessing also involves trace editing. Nojsy traces, traces with transient glitches (see Figure 1.3-40), or monofrequency signals (see Figure 1.3-3) are deleted; polarity reversals (see Figure 1.3-2) are corrected. In case of very shallow marine data, guided waves are muted since they travel horizontally within the water layer and do not contain reflections from the substratum.
As seen in Figure 1.5-3, most marine data are contaminated by swell noise and cable noise. These types of noise carry very low-frequency energy but can be high in amplitudes. They can be recognized by their distinctive linear pattern and vertical streaks. The swell noise and cable noise are removed from shot records by a low-cut filtering as shown in Figure 1.5-4. Attenuation of coherent linear noise associated with side scatterers and ground roll may require techniques based on dip filtering (Chapter 6).
Following the trace editing and prefiltering, a gain recovery function is applied to the data to correct for the amplitude effects of spherical wavefront divergence. This amounts to applying a geometric spreading function, which depends on traveltime (Section 1.4). Optionally, this amplitude correction is made dependent on a spatially averaged velocity function, which is associated with primary reflections in a particular survey area. Additionally, an exponential gain function may be used to compensate for attenuation losses.
The date in Figure 1.5-5 have been corrected for geometric spreading using a t 2 t 2 t^(2)t^{2}t2 scaling function. While primary reflection amplitudes are corrected for wavefront divergence, energy associated with multiple reflections, coherent linear noise generated by water-bottom point scatterers and the recording cable, and random noise also is inevitably boosted by geometric spreading correction.
Finally, field geometry is merged with the seismic data. This precedes any gain correction that is offsetdependent. Based on survey information for land data or navigation information for marine data, coordinates of shot and receiver locations for all traces are stored on trace headers. Changes in shot and receiver locations are handled properly based on the information available in the observer's log. Many types of processing problems arise from setting up the field geometry, incorrectly. As a result, the quality of a stacked section can be degraded severely.
For land data, elevation statics are applied at this stage to reduce traveltimes to a common datum level. This level may be flat or vary (floating datum) along the line. Reduction of traveltimes to a datum usually requires correction for the near-surface weathering layer in addition to differences in elevation of source and receiver stations. Estimation and correction for the nearsurface effects usually are performed using refracted arrivals associated with the base of the weathering layer (Section 3.4).

Deconvolution

Typically, prestack deconvolution is aimed at improving temporal resolution by compressing the effective source wavelet contained in the seismic trace to a spike (spiking deconvolution). Predictive deconvolution (Sections 2.3 and 2.4) with a prediction lag (commonly termed
gap) that is equal to the first or second zero crossing of the autocorrelation function also is used commonly. Although deconvolution usually is applied to prestack data trace by trace, it is not uncommon to design a single deconvolution operator and apply it to all the traces on a shot record. Deconvolution techniques used in conventional processing are based on optimum Wiener filtering (Section 2.3).
Figure 1.5-6 shows the common-shot gathers a.fter spiking deconvolution. By examining some of the individual reflections and comparing them with those in Figure 1.5-5, note how the wavelet associated with the significant reflections is compressed and reverberer tory energy that trails behind each reflection is largely attenuated by deconvolution. Because both low- and high-frequency noise and signal are boosted, the data often need filtering with a wide band-pass filter after deconvolution. In addition, some kind of trace balancing (Section 1.4) often is applied after deconvolution to bring the data to a common root-mean-squared (rms) level (Figure 1.5-7).

CMP Sorting

Seismic data acquisition with multifold coverage is done in shot-receiver ( s , g ) ( s , g ) (s,g)(s, g)(s,g) coordinates. Figure 1.5 8 1.5 8 1.5-81.5-81.58 a is a schematic depiction of the recording geometry and ray paths associated with a flat reflector. Seismic data processing, on the other hand, conventionally is done in midpoint-offset ( y , h ) ( y , h ) (y,h)(y, h)(y,h) coordinates. The required coordinate transformation is achieved by sorting the data into CMP gathers. Based on the field geometry information, each individual trace is assigned to the midpoint between the shot and receiver locations associated with that trace. Those traces with the same midpoint location are grouped together, making up a CMP gather. Albeit incorrectiy, the term common depth pornt (CDP) and common midpont (GMP) often are used interchangeably.
Figure 1.5-8b depicts the geometry of a CMP gather and raypaths associated with a flat reflector. Note that CDP gather is equivalent to a CMP gather only when reflectors are horizontal and velocities do not vary horizontally. However, when there are dipping reflectors in the subsurface, these two gathers are not equivalent and only the term CMP gather should be used. Selected CMP gathers obtained from sorting the deconvolved shot gathers (Figure 1.5-7) are shown in Figure 1.5-9.
Figure 1.5-10 shows the superposition of shotreceiver ( s , g ) ( s , g ) (s,g)(s, g)(s,g) and midpoint-offset ( y , h ) ( y , h ) (y,h)(y, h)(y,h) coordinates, and raypath geometries for various gather types. The ( y , h ) ( y , h ) (y,h)(y, h)(y,h) coordinates have been rotated 45 degrees relative to the ( s , g ) ( s , g ) (s,g)(s, g)(s,g) coordinates. The dotted area represents the coverage used in recording the seismic profile along the midpoint axis, O y O y OyO yOy. Each dot represents a seismic trace with the time axis perpendicular to the plane of paper. The following gather types are identified in Figure 1.5 10 1.5 10 1.5-101.5-101.510 :
(1) Common-shot gather (shot record, field record),
(2) Common-receiver gather,
(3) Common-midpoint gather (CMP gather, CDP gather),
(4) Common-offset section (constant-offset section),
(5) CMP-stacked section (zero-offset section)
The recording cable length is F G F G FGF GFG and the line length is A D A D ADA DAD. The number of dots along the offset axis (cross-section 3 ) is equal to the CMP fold. The fold tapers off at the ends of the profile (segments A B A B ABA BAB and C D C D CDC DCD ). Full-fold coverage along the line is at midpoints over segment B C B C BCB CBC. The diagram in Figure 1.5-10 is known as a stacking chart and is useful when setting up the geometry of a line for preprocessing. If there is a missing shot or a bad receiver, the affected midpoints are identified easily (Exercise 1-15).
For most recording geometries, the fold of coverage n f n f n_(f)n_{f}nf for CMP stacking is given by
n f = n g Δ g 2 Δ s n f = n g Δ g 2 Δ s n_(f)=(n_(g)Delta g)/(2Delta s)n_{f}=\frac{n_{g} \Delta g}{2 \Delta s}nf=ngΔg2Δs
where Δ g Δ g Delta g\Delta gΔg and Δ s Δ s Delta s\Delta sΔs are the receiver-group and shot intervals, respectively, and n g n g n_(g)n_{g}ng is the number of recording channels. By using this relationship, the following rules can be established:
(a) The fold does not change when alternating traces in each shot record are dropped.
(b) The fold is halved when every other shot record is skipped, whether or not alternating traces in each record are dropped.

Velocity Analysis

In addition to providing an improved signal-to-noise ratio, multifold coverage with nonzero-offset recording yields velocity information about the subsurface (Chapter 3). Velocity analysis is performed on selected CMP gathers or groups of gathers. The output from one type of velocity analysis is a table of numbers as a function of velocity versus two-way zero-offset time (velocity spectrum). These numbers represent some measure of signal coherency along the hyperbolic trajectories governed by velocity, offset, and traveltime.
Figure 1.5-11 shows the velocity spectra derived from the CMP gathers as in Figure 1.5-9. The horizontal
axis in each spectrum represents the scanned normalmoveout velocity with a range of 1000 to 5000 m / s 5000 m / s 5000m//s5000 \mathrm{~m} / \mathrm{s}5000 m/s, and the vertical axis represents the two-way zero-offset time from 0 to 8 s 8 s 8s8 \mathrm{~s}8 s. Red indicates the maximum coherency measure. The curve in each spectrum represents the velocity function based on the picked maximum coherency values associated with primary reflections. The pairs of numbers along each curve denote the time-velocity values for each pick. Velocity-time pairs are picked from these spectra based on maximum coherency peaks to form velocity functions at analysis locations.
The velocity functions picked at analysis locations then are spatially interpolated between the analysis locations to create a velocity field as shown in Figure 1.5-12. Red in the shallow portion and blue in the deep portion of the section correspond to low and high velocities, respectively. This velocity field is used to supply a velocity function for each CMP gather along the profile.
In areas with complex structure, velocity spectra often fail to provide sufficient accuracy in velocity picks. When this is the case, the data are stacked with a range of constant velocities, and the constant-velocity stacks themselves are used in picking velocities.

Normal-Moveout Correction

The velocity field (Figure 1.5-12) is used in normal moveout (NMO) correction of CMP gathers (Section 3.1). Based on the assumption that, in a CMP gather, reflection traveltimes as a function of offset follow hyperbolic trajectories, the process of NMO correction removes the moveout effect on traveltimes. Figure 1.5-13 shows the CMP gathers in Figure 1.5-9 after moveout correction. Note that events are mostly flattened across the offset range - the offset effect has been removed from traveltimes. Traces in each CMP gather are then summed to form a stacked trace at each midpoint location. The stacked section comprises the stacked traces at all midpoint locations along the line traverse.
As a result of moveout correction, traces are stretched in a time-varying manner, causing their frequency content to shift toward the low end of the spectrum. Frequency distortion increases at shallow times and large offsets (Figure 1.5-13). To prevent the degradation of especially shallow events, the amplitudes in the distorted zone are zeroed out (muted) before stacking (Figure 1.5-14).
The CMP recording technique, which was invented in the 1950s and published later (Mayne, 1962), uses redundant recording to improve the signal-to-noise ratio during stacking. To achieve redundancy, multiple sources per trace n s n s n_(s)n_{s}ns, multiple receivers per trace n r n r n_(r)n_{r}nr, and multiple offset coverage of the same subsurface point n f n f n_(f)n_{f}nf, are used in the field. Given the total number of elements in the recording system, N = n s × n r × n f N = n s × n r × n f N=n_(s)xxn_(r)xxn_(f)N=n_{s} \times n_{r} \times n_{f}N=ns×nr×nf the signal amplitude-to-rms noise ratio theoretically is improved by a factor of N N sqrtN\sqrt{N}N. This improvement factor is based on the sssumptions that the reflection signal on traces of a CMP gather is identical and the random noise is mutually uncorrelated from trace to trace (Sengbush, 1983). Because these assumptions do not strictly hold in practice, the signal-to-noise ratio improvement gained by stacking is somewhat less than N N sqrtN\sqrt{N}N. Common-midpoint stacking also attenuates coherent noise such as multiples, guided waves, and ground roll. This is because reflected signal and coherent noise usually have different stacking velocities.
In areas with complex overburden structure that gives rise to strong lateral velocity variations, the hyperbolic moveout assumption associated with reflection traveltimes in CMP gathers is no longer valid. As a result, hyperbolic moveout correction and CMP stacking do not always yield a stacked section in which reflections from the underlying strata are faithfully preserved. In such circumstances, imaging in depth and before stack becomes imperative.

Multiple Attenuation

Multiple reflections and reverberations are attenuated using techniques based on their periodicity or differences in moveout velocity between multiples and primaries. These techniques are applied to data in various domains, including the CMP domain, to best exploit the periodicity and velocity discrimination criteria (Chapter 6 ).
Deconvolution is one method of multiple attenuation that exploits the periodicity criterion. Often, however, the power of conventional deconvolution in attenuating multiples is underestimated. As for the Caspian data example in this section, despite theoretical limitations, deconvolution can remove a significant portion of the energy associated with short-period multiples and reverberations. It also can attenuate long-period multiples if it is applied in data domains in which periodicity is preserved (Chapter 6).

Dip-Moveout Correction

The normal-moveout correction in Figure 1.5-14 was applied to the CMP gathers using the velocity field of Figure 1.5-12 that is optimum for flat events. Stacking velocities, however, are dip-dependent. Dip-moveout correction (DMO) is needed to correct for the dip effect on stacking velocities and thus preserve events with
conflicting dips during CMP stacking (Chapter 5). Dipmoveout correction has been an integral part of a conventional processing sequence for 2 D 2 D 2-D2-\mathrm{D}2D and 3 D 3 D 3-D3-\mathrm{D}3D seismic data since 1985 .
Dip-moveout correction is applied to data following the normal-moveout correction using flat-event velocities (Figure 1.5-15). This then is followed by inverse moveout correction (Figure 1.5-16) and subsequent velocity analysis at closely spaced intervals. Figure 1.5-17 shows the velocity spectra asociated with a subset of the analysis locations which correspond to those of Figure 1.5-11. As for the velocity spectra in Figure 1.5-11, the velocity range is 1000 5000 m / s 1000 5000 m / s 1000-5000m//s1000-5000 \mathrm{~m} / \mathrm{s}10005000 m/s and the maximum time is 8 s 8 s 8s8 \mathrm{~s}8 s. Also, red indicates the maximum coherency measure.

CMP Stacking

A new velocity field as shown in Figure 1.5-18 is derived from the velocity functions picked from the velocity spectra after DMO correction. As for the velocity field in Figure 1.5-12, red in the shallow portion and blue in the deep portion of the section correspond to low and high velocities, respectively. This new velocity field is used to apply NMO correction to the CMP gathers (Figure 1.5-19). Finally, a CMP stack is obtained (Figure 1.5-20) by summing over the offset axis. The stack is the frontal face of the data volume shown in Figure 1.5 1 1.5 1 1.5-11.5-11.51.

Poststack Processing

A typical poststack processing sequence includes the following steps:
(a) Deconvolution after stack (Section 2.5) is usually applied to restore high frequencies attenuated by CMP stacking. It also is often effective in suppressing reverberations and short-period multiples. Figure 1.5-21 shows the CMP stack as in Figure 1.5-20 after spiking deconvolution.
(b) Although not included in the processing sequence for the Caspian data example in this section, often, time-variant spectral whitening (Section 2.6) is used to further flatten the spectrum and accounts for the time-variant character of the source waveform.
(c) Time-variant band-pass filtering (Section 1.1) is then used to remove noise at the high- and lowfrequency end of the signal spectrum (Figure 1.522). (d) The basic processing sequence sometimes includes a step for attenuation of random noise uncorrelated from trace to trace (Chapter 6).
(e) Finally, some type of display gain (Section 1.4) is applied to the stacked data (Figure 1.5-23). For true amplitude preservation, time-variant scaling of stacked amplitudes is avoided; instead, a relative amplitude compensation function that is constant from trace to trace is applied (Section 1.4). This is a slow time-rarying gain function that amplifies weak late reflections without destroying the amplitude relationships from trace to trace that may be caused by subsurface reflectivity.

Migration

Dipping events are then moved to their supposedly true subsurface positions, and diffractions are collapsed by migrating the stacked section prior to amplitude scaling (Chapter 4). Figure 1.5-24 shows the CMP stack as in Figure 1.5-22 after migration. As for the unmigrated stack, the migrated section also is displayed with the scaled amplitudes (Figure 1.5-25). Although the output of migration is intended to represent the geological cross-section along the line traverse, it often is displayed in time as for the input stacked section. The provided lateral velocity variations are mild to moderate, time megration often is acceptable; otherwise, depth migration is imperative (Chapter 4),
The structural highs below midpoints 4200,6800 , and 8200 in Figure 1.5 25 1.5 25 1.5-251.5-251.525 are associated with mud diapirism which is prominent in the Caspian basin. Structural complexity caused by faulting and folding generally introduces problems in stacking and imaging the subsurface in three respects:
(a) Steeply dipping reflections associated with fault planes and salt flanks often conflict during stacking with gently dipping or near-flat reflections associated with the less undisturbed strata. The remedy for this problem is prestack time migration for which the robust alternative is dip-moveout correction combined with poststack time migration.
(b) Nonhyperbolic moveout caused by strong lateral velocity variations associated with complex overburden structures involving salt tectonics and overthurst tectonics yields traveltime and amplitude distortions during stacking based on the hyperbolic moveout assumption. The remedy for this problem is prestack depth migration.
(text contmues on p. 122)

a
FIG. 1.5-8. (a) Seismic data acquisition is done in shot-recelver ( s , g ) ( s , g ) (s,g)(s, g)(s,g) coordnates. The raypaths are associated with a planar horizontal reflector from a shot point (indicated by the solid circles) to several receiver locations (indicated by the triangles). The processing cocrdinates, midpoint-(half) offet, ( y , h ) ( y , h ) (y,h)(y, h)(y,h) are defined in terms of ( a , g ) : y = ( g + s ) / 2 , h = ( g s ) / 2 ( a , g ) : y = ( g + s ) / 2 , h = ( g s ) / 2 (a,g):y=(g+s)//2,h=(g-s)//2(a, g): y=(g+s) / 2, h=(g-s) / 2(a,g):y=(g+s)/2,h=(gs)/2. The shot axis here points opposite the profiling direction, which is to the left. On a flat reflector, the subsurface is sampled by reflection points which span a length that is equal to half the cable length. (b) Seismic data processing is done in midpoint-offet ( y , h ) ( y , h ) (y,h)(y, h)(y,h) coordinates. The raypaths are associated with a single CMP gather at midpoint location M M MMM. A CMP gather is identical to a CDP gatber if the depth point were on a horizontally flat reflector and the medium above were horizontally layered.


¿్

ูู
हू
(a)
(b)
FIG. 1.5-26. The NMO-corrected CMP gathers from a land seisuic line (a) before and (b) after residual statics corrections. Note that the distorted events (CMP 191, 216) have nearly been flattened (b).
CMP 297
FIG. 1.5-27. Velocity spectra derived from the same data as in Figure 1.5-26, (a) before and (b) after residual statics corrections. Note that no significant difference exists between spectra derived from CMP gather 297 with and without the application of residual statics corrections. Reflection times in this gather did not have significant residual static shifts.
CMP 188
FIG. 1.5-28. Velocity spectra derived from the same data as in Figure 1.5-26, (a) before and (b) after residual statics corrections. Note the improvement after corrections down to 2.6 s 2.6 s 2.6s2.6 \mathrm{~s}2.6 s.
(a)
(b)
FIG. 1.5-29. The CMP stacks derived from the gathers in Figure 1.5-26. The stack (a) without residual statics corrections shows false structure and poor coherence in the vicinity of CMP 149-197. Both are eliminated by correcting for residual statics (b).
(c) Any of the two cases described in (a) and (b) often manifest themselves as 3-D problems in nature. The remedy for the 3-D effects, of course, is 3-D migration.
The migrated section in Figure 1.5-25 must be evaluated w'thin the above limitations in stacking and imaging the nil)surface.

Residual Statics Corrections

There is one additional step in conventional processing of land and shallow-water seismic data before stacking residual statics corrections. From the NMO-corrected gathers in Figure 1.5-26a, note that the events in CMP 216 are not as flat as they are in the other gathers. The moveout in CMP gathers does not always conform to a perfect hyperbolic trajectory. This often is because of near-surface velocity irregularities that cause a static or dynamic distortion problem. Lateral velocity variations caused by a complex overburden can cause moveonts that could be negative a reflection event arrives on long-ofisct traces before it arrives on short-offset traces. Close examination of the velocity spectra indirates that some are easier to pick (Figure 1.5-27a) than others (Figure 1.5-28a). The velocity spectrum that corresponds to CMP 297 has sharp coherency peaks that ase associated with a distinctive velocity trend. However, the velocity spectrum that corresponds to CMP 188 does not yield a distinctive trend, thus making it relatively difficult to pick (Figure 1.5-28a).
To improve stacking quality, residual statics corrections (Section 3.3) are performed on the moveoutcorrected CMP gathers. This is done in a surfaceconsistent manner; that is, time shifts are dependent only on shot and receiver locations, not on the ray paths from shots to receivers. The estimated residual corrections are applied to the original CMP gathers with no NMO correction. Velocity analyses then are often repeated to improve the velocity picks (Figures 1.5-27b and 1.5-28b). With the improved velocity field, the CMP gathers are NMO-corrected (Figure 1.5-26b). Finally, the gathers are stacked as shown in Figure 1.529b. For comparison, the stack without the residual statics corrections is shown in Figure 1.5-29a. Reflection contimity over the problem zone between midpoints 53 245 has been improved.

Quality Control in Processing

The conventional processing sequence is outlined in Figure 1.5-30. Each of the processes described above is presented m m m\mathrm{m}m detail in subsequent chapters. In a seismir data processing sequence, the step that is most vulnerable to human errors is defining the geonetry for the survey under consideration and merging it with the seismic data. This involves correctly assigning sources and receivers to their respective surface locations and correctly specifying the source-receiver separation and azimuth for each recorded trace in the survey.
To demonstrate just how important it in to "t 1 1 1-1-1 rectly specify the geometry of a survey, conside the impact of a deliberately incorrect geometry assigu:nent on velocity estimation and normal-moveout correction. Figure 1.5-31 shows CMP gathers before and after moveout correction and velocity spectra at three analysis locations along a seismic traverse. The case shown in Figure 1.5-31a does not appear to exhibit any a! normal moveout behavior. The velocity spectrum yik kis a fairly unambiguous primary velocity function, ancl , rtmary events on the moveout-corrected gather are ne wiy flat. The case shown in Figure 1.5-31b, however, bcgins to show signs of something being wrong with the data.

Field Txapes and Obgerver's Log

(1) Preprocessing:

  • Demnltiplexing
  • Reformatting
  • Editing
  • Geometric Spreading Correction
  • Setup of Fieli Geometry
  • Application of Fjeld Staties
(2) Deconvolution and Trace Balancing
(3) CMP Sarting
(4) Velocity Analysis
(5) Residual Statics Corrections
(6) Veloeity Analysis
(7) NMO Correction
(8) DMO Correction
(9) Inverse NMO Correction
(10) Velocity Anqlysis
(11) NMO Correctjon, Mnting and Stacking
(12) Deconvalntion
(13) Time-Variant Spectral whitening
(14) Time-Variant Filtering
(15) Migration
(16) Gain Application
FIG. 1.5-30. A conventional processing flowchart.
Although the velocity spectrum, again, yields a fairly unambiguous primary velocity function, note that the events associated with the major primary reflections in the CMP gather do not submit themselves to flattening properly after normal-moveout correction. Such behavior in the moveout may be attributed to some physical phenomenon, for instance, anisotropy or nonhyperbolic moveout caused by lateral velocity variations. Nevertheless, it is caused in this case by incorrect geometry specification related to wrong offset assignment to the traces in the gather. The abnormal moveout behavior is strikingly more obvious in the case shown in Figure 1.5-31c. Note the ambiguous semblance peaks in the velocity spectrum, which cause failure in normal-moveout correction to properly flatten the primary events in the gather. Note the differences in the degree of abnormal behavior in event moveout from one location to another (Figures 1.5-31a,b,c); the simpler and the flatter the subsurface structure, the less obvious the adverse impact of incorrect geometry on the moveout.
The care required for correct assignment of the geometry of a survey, of course, does not undermine the care required for proper specification of the parameters associated with any other step in a processing sequence. Specifically, each step must be executed with the necessary quality control. Displays of appropriate data attributes, such as amplitude spectrum and autocorrelogram, help the analyst understand signal and noise chracteristics of the recorded data and the effect of a step included in the processing sequence on the data, thus facilitating appropriate specification of parameters associated with that step. Figures 1.5-32 through 1.5-41 show quality control panels that are examples of recommended standard displays for parameter selection at various stages in the analysis. All displays include the amplitude spectrum on the top row averaged over the gather, if it is a prestack test panel, and averaged over the portion of the stack, if it is a poststack test panel, and autocorrelogram of the respective data type on bottorn row.
Figure 1.5 32 1.5 32 1.5-321.5-321.532 is the quality control panel for prestack signal processing. Shown from left to right are: (a) a CMP gather which exhibits strong, low-frequency swell noise; (b) low-cut filtering to remove the swell noise; (c) t 2 t 2 t^(2)t^{2}t2 scaling to correct for geometric spreading (Section 1.4); (d) prestack spiking deconvolution (Sections 2.3, 2.4, and 2.5); (e) and wide bandpass filtering to remove the high-frequency noise boosted by spiking deconvolution. Note that the autocorrelogram better exhibits over the entire cable length the characteristics of the source waveform and reverberations and multiples after t 2 t 2 t^(2)t^{2}t2 scaling. Also note that spiking deconvolution has removed much of the energy associated with the reverberations and multiples. The broadening and flattening of the amplitude spectrum after spiking deconvolution are indicative of the increase of vertical resolution.
Figure 1.5-33 shows the spectra which are associated with the gathers from left to right in Figure 1.5-32. The horizontal axis is frequency in H z H z Hz\mathrm{Hz}Hz and the vertical axis is two-way traveltime in s s sss. Note from (a) that the swell noise at very low frequencies occupies the spectrum along the entire time axis. Note also that the energy in the gather is largely confined to shallow times within a bandlimited region of the spectrum. Following the low-cut filtering (b), note the elimination of the swell noise energy. The t 2 t 2 t^(2)t^{2}t2 scaling (c) has restored the energy at late times, and deconvolution (d) has broadened the spectrum. Following the wide bandpass filtering ( e ) ( e ) (e)(e)(e), note that the signal bandwidth has been preserved [compare with (a)], and the spectrum has been flattened within the passband.
Figures 1.5-34 and 1.5-35 show two standard test panels for determining prestack deconvolution parameters. With the help of the amplitude spectrum and autocorrelogram, the analyst chooses an optimum operator length and prediction lag. Figure 1.5-34 shows the test panel for prestack spiking deconvolution (Sections 2.3,2.4, and 2.5). Shown from left to right are: the input gather after low-cut filtering and t 2 t 2 t^(2)t^{2}t2 scaling as in Figure 1.5-32, followed by deconvolution using operator lengths of 120 m s , 160 m s , 240 m s , 360 m s 120 m s , 160 m s , 240 m s , 360 m s 120ms,160ms,240ms,360ms120 \mathrm{~ms}, 160 \mathrm{~ms}, 240 \mathrm{~ms}, 360 \mathrm{~ms}120 ms,160 ms,240 ms,360 ms, and 480 m s m s ms\mathrm{ms}ms. Note that deconvolution using an operator length of 480 m s 480 m s 480ms480 \mathrm{~ms}480 ms best flattens the spectrum within the signal passband. Failure of deconvolution in flattening the spectrum at very high frequencies is most likely due to nonstationarity of the signal. This effect usually is accounted for by time-variant spectral whitening after stack. Since autocorrelation of input data is used in designing a deconvolution operator, it is appropriate to examine the autocorrelation before and after deconvolution. Note from the autocorrelograms in Figure 1.5-34 that operator length dictates the ability of deconvolution in removing reverberations and short-period multiples.
Figure 1.5-35 shows the test panel for prestack predictive deconvolution (Sections 2.3,2.4, and 2.5). Shown from left to right are: the input gather after low-cut filtering and t 2 t 2 t^(2)t^{2}t2 scaling as in Figure 1.5-32, followed by deconvolution using prediction lags of 2 m s 2 m s 2ms2 \mathrm{~ms}2 ms (unit prediction lag), 8 m s , 16 m s , 24 m s 8 m s , 16 m s , 24 m s 8ms,16ms,24ms8 \mathrm{~ms}, 16 \mathrm{~ms}, 24 \mathrm{~ms}8 ms,16 ms,24 ms, and 32 m s 32 m s 32ms32 \mathrm{~ms}32 ms, with the same operator length of 480 m s 480 m s 480ms480 \mathrm{~ms}480 ms. Note that the unit-prediction lag yields a flat spectrum across the passband, while increasing the prediction lag results in departure from a flat spectrum. Prediction lag controls the ability of deconvolution to increase the vertical resolution (Section 2.4).
Figures 1.5-36 and 1.5-37 show two standard test panels for determining poststack deconvolution parameters. Note from the average amplitude spectrum of the
section on the left-hand side of each test panel that CMP stacking inherently atteniates high frequencies which need to be restored by poststack deconvolution. Figure 1.5-36 shows the test panel for poststack spiking deconvolution. Shown from left to right are: the input stack, followed by deconvolution using operator lengths of 120 m s , 160 m s , 240 m s , 360 m s 120 m s , 160 m s , 240 m s , 360 m s 120ms,160ms,240ms,360ms120 \mathrm{~ms}, 160 \mathrm{~ms}, 240 \mathrm{~ms}, 360 \mathrm{~ms}120 ms,160 ms,240 ms,360 ms and 480 m s 480 m s 480ms480 \mathrm{~ms}480 ms, and high-cut filtering to retain the acseptable signal band and remove the high-frequency noise.
Figure 1.5-37 shows the test panel for poststack predictive deconvolution. Shown from left to right arc: the input stack, followed by deconvolution using prediction lags of 2 m s 2 m s 2ms2 \mathrm{~ms}2 ms (unit preduction lag), 8 m s , 16 m s , 24 8 m s , 16 m s , 24 8ms,16ms,248 \mathrm{~ms}, 16 \mathrm{~ms}, 248 ms,16 ms,24 ms and 32 m s 32 m s 32ms32 \mathrm{~ms}32 ms, using the same operator length of 480 m s m s ms\mathrm{ms}ms, and high-cut filtering to retain the acceptable signal band and remove the high-frequency noise. Again, note that the unit-prediction lag yields a flat spectrum across the pasiband, while increasing the prediction lag results in departure from a flat spectrum.
Figure 1.5-38 shows the standard quality control pancl for poststack signal processing. Shown from left to right are: a portion of the stacked scction with prestack processing as described by Figure 1.5-32; spiking deconvolution (Section 2.5) to restore the high frequencies attenuated by the stacking process; time-variant spectral whitering to account for nonstationarity and to further flatten the spectrum (Section 26 ) all three steps followed by high-cut filtering; bandpass filtering to retain the acceptable signal band and remove the high-frequency noise; instantaneous AGC scaling and rms amplitude AGC scaling.
Figures 1.5-39 and 1.5-40 show the test pancls for defining the paramcters for time-variant filtcring (Scction 1.1). A portion of the stacked section is bandpass filtered using a 10 H z 10 H z 10-Hz10-\mathrm{Hz}10Hz bandwidth that slides from low to high-frequency end of the spectrum. Note that the coherent signal at high-frequency bands is confined to shallow times. Nevertheless, these filter panels indicate that signal up to 90 H z 90 H z 90Hz90 \mathrm{~Hz}90 Hz is present in the data down to 2.2 s 2.2 s 2.2s2.2 \mathrm{~s}2.2 s, and the signal up to 100 H z 100 H z 100Hz100 \mathrm{~Hz}100 Hz is present down to 1.4 s 1.4 s 1.4s1.4 \mathrm{~s}1.4 s,
Finally, Figure 1.5-41 shows the test panel for poststack noise attemuation using f x f x f-xf-xfx deconvolution (Section 6.5). A parameter that needs to be tested for f x f x f-xf-xfx deconvolution is the percent add-back of the estimated noise to circumvent the smeared appearance of events following noise attenuation. Shown from left to right are: a portion of the stacked section with poststack deconvolution, time-variant spectral whitening and bandpass filtering; noise attenuation with 80 , 60 , 40 , 20 80 , 60 , 40 , 20 80,60,40,2080,60,40,2080,60,40,20, and 0 percent add-back. Note that without any add-back, the amplitude spectrum of the section after noise attenuation indicates dampening of high-frequency energy that may be attributed to the random noise uncorrelated from trace to trace.
The test panel for quality control in proccssing of seismic data are not limited to those presented in Figures 1.5-32 through 1.5-41. Additional panels with appropriate and convenient format may be constructed to test parameters associated with refraction and residual statics corrections, multiple attenuation, dip-moveout correction, and migration. Powerful interactive tools, including 3-D visualization techniques, facilitate efficicnt parameter testing and quality control in processing.

Parsimony in Processing

The primary objective in data processing is to enhance the signal-to-noise ratio while preserving the useful signal bandwidth associated with the recorded clata at all stages in the analysis. The principle of parsiniony in processing is the basis to achicve this objective. Speefically, a processing scquence should be optimally lcan and not include any step that may do more harm than the intended action by that process. A further compelling reason for parsimony is preserving relative amplitudes for amplitude-driven exploration objcctives associated with stratigraphic plays.
Figures 1.5-42 through 1.5-53 show the step-bystep appearance of a portion of a stacked section besed on a very basic: processing sequence intended to minimize amplitude distortions whle largely attenuating reverberations, multiples, and random noise and ultimately increasing vertical and lateral resolution.
The stacked sections in Figures 1.5-42 through 1.547 were created based on the following prestack processing sequence:
(a) Figure 15-42: stack based on unprocesed data that contain low-frequency swell noise.
(b) Figure 1.5-43: stack using CMP gathers with lowcut filtering applied to remove the swell noise.
(c) Figure 1.5-44: stack as in (b) with the additional step for t 2 t 2 t^(2)t^{2}t2 sealing to compensate for wavefront divergence; note the restoration of amplitudes at late times.
(d) Figure 1.5-45: stack as in (c) with the additional step for prestack spiking deconvolution; note the attenuation of reverberations.
(e) Figure 1.5-46: stack as in (d) with the additional step for wide bandpass filtering to improve velocity analysis.
(f) Figure 1.5-47: stack as in (c) with the additional step for dip-moveout correction; note the preservation of diffractions that interfere with the nearly flat reflections.
FIG. 1.5-31. Anomalous moveout bchavor on CMP gathers caused by incorrect geometry specification See text for details.

FIG. 1.5-33. Spectral analysis associated with the test panel in Figure 1.5-32. See text for details.

FIG. 1.5-54. Spectral analysis of the sections based on the prestack procesing shown in Figures 1.5-42 through 1.5-47. See text for details.
FIG. 1.5-55. Spectral analysis of the sections based on the poststack processing shown in Figures 1.5-48 through 1.5-53. See text for details.

Sampling Rate = 2 m s = 2 m s =2ms=2 \mathrm{~ms}=2 ms

4 m s 4 m s 4ms4 \mathrm{~ms}4 ms
8 m s 8 m s 8ms8 \mathrm{~ms}8 ms

Amplitude Spectra

FIG. 1.E-1. A signal with three frequency components, A, B, and C, sampled at three different rates, 2, 4, and 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms. Frequency aliasing oceurs at coarser sampling intervals (see Exercise 1-1).
The stacked sections in Figures 1.5-48 through 1.553 were created based on the following poststack processing sequence:
(a) Figure 1.5-48: stack as in (f) of the prestack processing sequence described above with the additional step for poststack spiking deconvolution; note the increase in vertical resolution as a result of wavelet compression.
(b) Figure 1.5-49: stack as in (a) with the additional step for time-varient spectral whitening to account for nonstationarity.
(c) Figure 1.5-50: stack as in (b) with the additional step for wide bandpass filtering.
(d) Figure 1.5-51: stack as in (c) with the additional step for AGC scaling.
(e) Figure 1.5-52: stack as in (d) with the edditional step for attenuation of random noise uncorrelated from trace to trace using f x f x f-xf-xfx deconvolution (Section 6.5).
(f) Figure 1.5-53: migrated stack as in (c) with the additional step for AGC scaling.
Scan through the stacked sections starting with Figure 1.5-42 and observe the effect of each processing step on the result. Additonally, examine the spectra labeled as (a) through (f) in Figure 1.5-54 which correspond to the stacked sections in Figures 1.5-42 through Figure 1.5-47 involving the prestack sequence, respectively, and the spectra labeled as (a) through (f) in Figure 1.5-55 which correspond to the stacked sections in Figures 1.5-48 through Figure 1.5-53 involving the poststack sequence, respectively. Observe the change in the spectral content induced by each process, and note that the ultimate objectives in processing are aimed at preserving the bandwidth of the recorded signal and flattening the spectrum within the signal passband to attain the maximum possible vertical and lateral resolutions.

EXERCISES

Exercise 1-1. Refer to Figure 1.E-1. Using equation (1-2), compute the alias frequencies at 4- and 8-ms
s
s s s\mathrm{s}s туре
FIG. 1.E-2. A field data set displayed in two different domans common-shot and common-midpoint (see Exercise 1-12).
sampling intervals for the three frequency components - A, B and C C CCC from the amplitude spectrum of the 2 -ms time series. Confirm the results of your computation by the amplitude spectra.
Exercise 1-2. Using the hyperbolic traveltime equation, compute the average velocity down to reflector A A AAA in Figure 1.3-8. Assume a constant velocity between A A AAA and the surface. The required information about Record 8 is in Table 1-13.
Exercise 1-3. What is the dispersive event C C CCC in Figure 1.3-8?
Exercise 1-4. Refer to the walk-away noise test record in Figure 1.3-19. Measure the phase velocity ( Δ x / Δ t Δ x / Δ t Delta x//Delta t\Delta x / \Delta tΔx/Δt ) of the ground-roll energy at location A 1 A 1 A_(1)A_{1}A1. Also measure the dominant frcquency at the same location. Then, estimate the dominant wavelength (velocity/dominant frequency) of the ground roll. The receiver array length needed to suppress this energy in the field should be equal to or greater than the longest noise wavelength. The required information about Record 19 that you need for your computations is in Table 1-13.
Exercise 1-5. Measure the group velocity ( x / t x / t x//tx / tx/t ) of ground-roll energy A in Figure 1.3-25. The required information for Record 25 is in Table 1-13.
Exercise 1-6. Refer to the shot record in Figure 1.3-27. The ncar-offset 28 channels were recorded using a 50 -m group interval. What is the group interval for the remaining 64 channels? The required information for Record 27 is in Table 1-13.
Exercise 1-7. What is event A in Figure 1.3-29? Are cvents C , D C , D C,DC, DC,D, and E E EEE multiples of B B BBB ?
Exercise 1-8. Refer to Figure 1.3-30. Compute the water velocity using both the direct arrivals A A AAA and the water-bottom reflection B B BBB. Use one-way time for A A AAA and two-way time for B B BBB. The required information for Record 30 is in Table 1-13.
Exercise 1-9. Identify events A, B, C, D, E, and F F FFF in Figure 1.3-33.
Exercise 1-10. Identify events A, B, C, D, and E in Figure 1.3-34.
Exercise 1-11. Gain application involves multiplying the gain function with the seismic trace (Figure 1.4-8). Use the appropriate entry in Table A-1 to de scribe the effect of the gain application in the frequency domain.
Exercise 1-12. From Figure 1.E-2, identify the common-shot and common-midpoint gathers.
Exercise 1-13. Use equation (1-10) to compute fold n f n f n_(f)n_{f}nf for each of the following recording geometries:
Number of
Channels
Number of Channels| Number of | | :---: | | Channels |
Shot
Spacing, m
Shot Spacing, m| Shot | | :---: | | Spacing, m |
Receiver
Spacing, m m m\mathrm{m}m
Receiver Spacing, m| Receiver | | :---: | | Spacing, $\mathrm{m}$ |
240 25 25
240 50 25
240 100 25
240 25 50
"Number of Channels" "Shot Spacing, m" "Receiver Spacing, m" 240 25 25 240 50 25 240 100 25 240 25 50| Number of <br> Channels | Shot <br> Spacing, m | Receiver <br> Spacing, $\mathrm{m}$ | | :---: | :---: | :---: | | 240 | 25 | 25 | | 240 | 50 | 25 | | 240 | 100 | 25 | | 240 | 25 | 50 |
Exercise 1-14. Consider the recording geometry in Figure 1.5-8. Sketch the traveltine curves on a common-shot gather associated with point scatterers (a) beneath the cable, (b) behind, and (c) in front of the cable. Assume all scatterers are on the plane of recording.
Exercise 1-15. Suppose that the shot associeted with gather 1 in Figure 1.5-10 is missing. Identify the midpoints that are affected by this missing shot; that is, the midpoints with a lower fold of coverage. Suppose the receiver associated with gather 2 in Figure 1.5-10 is missing. Identify the midpoints that are affected by this.
Exercise 1-16. Prove the shifting, scaling, and differentiation rules applied to the Fourier transform of a function given by the entires (1), (2), and (3) in Table A-1.

Appendix A
A MATHEMATICAL REVIEW OF THE FOURIER TRANSFORM

A. 1 The 1-D Fourier Transform

Given a continuous function x ( t ) x ( t ) x(t)x(t)x(t) of a single variable t t ttt, its Fourier transform is defined by the integral
X ( ω ) = + x ( t ) exp ( i ω t ) d t X ( ω ) = + x ( t ) exp ( i ω t ) d t X(omega)=int_(-oo)^(+oo)x(t)exp(-i omega t)dtX(\omega)=\int_{-\infty}^{+\infty} x(t) \exp (-i \omega t) d tX(ω)=+x(t)exp(iωt)dt
where w w www is the Fourier dual of the variable t t ttt. If t t ttt signifies time, then ω ω omega\omegaω is angular frequency. The temporal frequency f f fff is related to the angular frequency ω ω omega\omegaω by ω = 2 π f ω = 2 π f omega=2pi f\omega=2 \pi fω=2πf.
The Fourier transform is reversible; that is, given X ( ω ) X ( ω ) X(omega)X(\omega)X(ω), the corresponding time function is
x ( t ) = + X ( ω ) exp ( i ω t ) d ω x ( t ) = + X ( ω ) exp ( i ω t ) d ω x(t)=int_(-oo)^(+oo)X(omega)exp(i omega t)d omegax(t)=\int_{-\infty}^{+\infty} X(\omega) \exp (i \omega t) d \omegax(t)=+X(ω)exp(iωt)dω
Throughout this book, the following sign convention is used for the Fourier transform. For the forward transform, the sign of the argument in the exponent is negative if the variable is time and positive if the variable is space. Of course, the inverse transform has the opposite sign used in the respective forward transform. For convenience, the scale factor 2 π 2 π 2pi2 \pi2π in equations (A-1) and (A-2) are omitted.
Generally, X ( ω ) X ( ω ) X(omega)X(\omega)X(ω) is a complex function. By using the properties of the complex functions, X ( ω ) X ( ω ) X(omega)X(\omega)X(ω) is expressed as two other functions of frequency
X ( ω ) = A ( ω ) exp [ i ϕ ( ω ) ] X ( ω ) = A ( ω ) exp [ i ϕ ( ω ) ] X(omega)=A(omega)exp[i phi(omega)]X(\omega)=A(\omega) \exp [i \phi(\omega)]X(ω)=A(ω)exp[iϕ(ω)]
where A ( ω ) A ( ω ) A(omega)A(\omega)A(ω) and ϕ ( ω ) ϕ ( ω ) phi(omega)\phi(\omega)ϕ(ω) are the amplitude and phase spectra, respectively. They are computed by the following equations:
A ( ω ) = X r 2 ( ω ) + X 4 2 ( ω ) A ( ω ) = X r 2 ( ω ) + X 4 2 ( ω ) A(omega)=sqrt(X_(r)^(2)(omega)+X_(4)^(2)(omega))A(\omega)=\sqrt{X_{r}^{2}(\omega)+X_{4}^{2}(\omega)}A(ω)=Xr2(ω)+X42(ω)
and
ϕ ( ω ) = tan 1 X t ( ω ) X + ( ω ) ϕ ( ω ) = tan 1 X t ( ω ) X + ( ω ) phi(omega)=tan^(-1)(X_(t)(omega))/(X_(+)(omega))\phi(\omega)=\tan ^{-1} \frac{X_{t}(\omega)}{X_{+}(\omega)}ϕ(ω)=tan1Xt(ω)X+(ω)
where X r ( ω ) X r ( ω ) X_(r)(omega)X_{r}(\omega)Xr(ω) and X 2 ( ω ) X 2 ( ω ) X_(2)(omega)X_{2}(\omega)X2(ω) are the real and imaginary parts of the Fouries transform X ( ω ) X ( ω ) X(omega)X(\omega)X(ω). When X ( ω ) X ( ω ) X(omega)X(\omega)X(ω) is expressed in terms of its real and imaginary components
X ( ω ) = X + ( ω ) + i X 1 ( ω ) X ( ω ) = X + ( ω ) + i X 1 ( ω ) X(omega)=X_(+)(omega)+iX_(1)(omega)X(\omega)=X_{+}(\omega)+i X_{1}(\omega)X(ω)=X+(ω)+iX1(ω)
and is compared with equation (A-3), note that
X r ( ω ) = A ( ω ) cos ϕ ( ω ) X r ( ω ) = A ( ω ) cos ϕ ( ω ) X_(r)(omega)=A(omega)cos phi(omega)X_{r}(\omega)=A(\omega) \cos \phi(\omega)Xr(ω)=A(ω)cosϕ(ω)
and
X t ( ω ) = A ( ω ) sin ϕ ( ω ) X t ( ω ) = A ( ω ) sin ϕ ( ω ) X_(t)(omega)=A(omega)sin phi(omega)X_{t}(\omega)=A(\omega) \sin \phi(\omega)Xt(ω)=A(ω)sinϕ(ω)
We now consider two functions x ( t ) x ( t ) -x(t)-x(t)x(t) and f ( t ) f ( t ) f(t)f(t)f(t). Listed in Table A-1 are basic theorems that are useful in various applications of the Fourier transform.
Table A-1. Foutrier transform theorems (Bracewell, 1965).
Operation Time Firequency
(1) Shifting x ( t τ ) x ( t τ ) x(t-tau)x(t-\tau)x(tτ) exp ( i ω τ ) X ( ω ) exp ( i ω τ ) X ( ω ) exp(-i omega tau)X(omega)\exp (-i \omega \tau) X(\omega)exp(iωτ)X(ω)
(2) Scaling x ( a t ) x ( a t ) x(at)x(a t)x(at) | a | 1 X ( ω / a ) | a | 1 X ( ω / a ) |a|^(-1)X(omega//a)|a|^{-1} X(\omega / a)|a|1X(ω/a)
(3) Differentiation d x ( t ) / d t d x ( t ) / d t dx(t)//dtd x(t) / d tdx(t)/dt z ω X ( ω ) z ω X ( ω ) z omega X(omega)z \omega X(\omega)zωX(ω)
(4) Addition f ( t ) + x ( t ) f ( t ) + x ( t ) f(t)+x(t)f(t)+x(t)f(t)+x(t) F ( ω ) + X ( ω ) F ( ω ) + X ( ω ) F(omega)+X(omega)F(\omega)+X(\omega)F(ω)+X(ω)
(5) Multiplication f ( t ) x ( t ) f ( t ) x ( t ) f(t)x(t)f(t) x(t)f(t)x(t) F ( ω ) X ( ω ) F ( ω ) X ( ω ) F(omega)**X(omega)F(\omega) * X(\omega)F(ω)X(ω)
(6) Convolution f ( t ) x ( t ) f ( t ) x ( t ) f(t)**x(t)f(t) * x(t)f(t)x(t) F ( ω ) X ( ω ) F ( ω ) X ( ω ) F(omega)X(omega)F(\omega) X(\omega)F(ω)X(ω)
(7) Autocorrelation x ( t ) x ( t ) x ( t ) x ( t ) x(t)**x(-t)x(t) * x(-t)x(t)x(t) | X ( ω ) | 2 | X ( ω ) | 2 |X(omega)|^(2)|X(\omega)|^{2}|X(ω)|2
(8) Parseval's theorem | x ( t ) | 2 d t | x ( t ) | 2 d t int|x(t)|^(2)dt\int|x(t)|^{2} d t|x(t)|2dt | X ( ω ) | 2 d ω | X ( ω ) | 2 d ω int|X(omega)|^(2)d omega\int|X(\omega)|^{2} d \omega|X(ω)|2dω
Operation Time Firequency (1) Shifting x(t-tau) exp(-i omega tau)X(omega) (2) Scaling x(at) |a|^(-1)X(omega//a) (3) Differentiation dx(t)//dt z omega X(omega) (4) Addition f(t)+x(t) F(omega)+X(omega) (5) Multiplication f(t)x(t) F(omega)**X(omega) (6) Convolution f(t)**x(t) F(omega)X(omega) (7) Autocorrelation x(t)**x(-t) |X(omega)|^(2) (8) Parseval's theorem int|x(t)|^(2)dt int|X(omega)|^(2)d omega| Operation | Time | Firequency | | :--- | :---: | :---: | | (1) Shifting | $x(t-\tau)$ | $\exp (-i \omega \tau) X(\omega)$ | | (2) Scaling | $x(a t)$ | $\|a\|^{-1} X(\omega / a)$ | | (3) Differentiation | $d x(t) / d t$ | $z \omega X(\omega)$ | | (4) Addition | $f(t)+x(t)$ | $F(\omega)+X(\omega)$ | | (5) Multiplication | $f(t) x(t)$ | $F(\omega) * X(\omega)$ | | (6) Convolution | $f(t) * x(t)$ | $F(\omega) X(\omega)$ | | (7) Autocorrelation | $x(t) * x(-t)$ | $\|X(\omega)\|^{2}$ | | (8) Parseval's theorem | $\int\|x(t)\|^{2} d t$ | $\int\|X(\omega)\|^{2} d \omega$ |
  • denotes convolution.
Proofs of these theorems can be found in the classic reference on Fourier transforms by Bracewell (1965). Also, some of the proofs are left to the excrcises at the end of this chapter. Here, we shall derive the convolutional relation (6) for continuous functions, and the same relation for discrete functions in Section A.2. Consider convolution of two functions x ( t ) x ( t ) x(t)x(t)x(t) and f ( t ) f ( t ) f(t)f(t)f(t) with their Fourier transforms X ( ω ) X ( ω ) X(omega)X(\omega)X(ω) and F ( ω ) F ( ω ) F(omega)F(\omega)F(ω), respectively,
y ( t ) = f ( t ) x ( t ) y ( t ) = f ( t ) x ( t ) y(t)=f(t)**x(t)y(t)=f(t) * x(t)y(t)=f(t)x(t)
which is explicitly given by the integral
y ( t ) = + f ( t t ) x ( t ) d t y ( t ) = + f t t x t d t y(t)=int_(-oo)^(+oo)f(t-t^('))x(t^('))dt^(')y(t)=\int_{-\infty}^{+\infty} f\left(t-t^{\prime}\right) x\left(t^{\prime}\right) d t^{\prime}y(t)=+f(tt)x(t)dt
The Fouricr transform of the resulting function y ( t ) y ( t ) y(t)y(t)y(t) is
Y ( ω ) = + y ( t ) exp ( ı ω t ) d t Y ( ω ) = + y ( t ) exp ( ı ω t ) d t Y(omega)=int_(-oo)^(+oo)y(t)exp(-ıomega t)dtY(\omega)=\int_{-\infty}^{+\infty} y(t) \exp (-\imath \omega t) d tY(ω)=+y(t)exp(ıωt)dt
Substitute the convolution integral of equation (A-7b) into equation (A-8a)
Y ( ω ) = + [ + f ( t t ) x ( t ) d t ] exp ( z ω t ) d t , ( A 8 b ) Y ( ω ) = + + f t t x t d t exp ( z ω t ) d t , ( A 8 b ) Y(omega)=int_(-oo)^(+oo)[int_(-oo)^(+oo)f(t-t^('))x(t^('))dt^(')]exp(-z omega t)dt,quad(A-8b)Y(\omega)=\int_{-\infty}^{+\infty}\left[\int_{-\infty}^{+\infty} f\left(t-t^{\prime}\right) x\left(t^{\prime}\right) d t^{\prime}\right] \exp (-z \omega t) d t, \quad(A-8 b)Y(ω)=+[+f(tt)x(t)dt]exp(zωt)dt,(A8b)
and interchange the two integrals
Y ( ω ) = + x ( t ) [ + f ( t t ) exp ( τ ω t ) d t ] d t Y ( ω ) = + x t + f t t exp ( τ ω t ) d t d t Y(omega)=int_(-oo)^(+oo)x(t^('))[int_(-oo)^(+oo)f(t-t^('))exp(-tau omega t)dt]dt^(')Y(\omega)=\int_{-\infty}^{+\infty} x\left(t^{\prime}\right)\left[\int_{-\infty}^{+\infty} f\left(t-t^{\prime}\right) \exp (-\tau \omega t) d t\right] d t^{\prime}Y(ω)=+x(t)[+f(tt)exp(τωt)dt]dt
From the shift theorem given by entry (1) of Table A-1, we have
+ f ( t t ) exp ( ı ω t ) d t = F ( ω ) exp ( i ω t ) + f t t exp ( ı ω t ) d t = F ( ω ) exp i ω t int_(-oo)^(+oo)f(t-t^('))exp(-ıomega t)dt=F(omega)exp(-i omegat^('))\int_{-\infty}^{+\infty} f\left(t-t^{\prime}\right) \exp (-\imath \omega t) d t=F(\omega) \exp \left(-i \omega t^{\prime}\right)+f(tt)exp(ıωt)dt=F(ω)exp(iωt)
Use this relation in equation (A-8c) to get
Y ( ω ) = + x ( t ) [ F ( ω ) exp ( ı ω t ) ] d t Y ( ω ) = + x t F ( ω ) exp ı ω t d t Y(omega)=int_(-oo)^(+oo)x(t^('))[F(omega)exp(-ıomegat^('))]dt^(')Y(\omega)=\int_{-\infty}^{+\infty} x\left(t^{\prime}\right)\left[F(\omega) \exp \left(-\imath \omega t^{\prime}\right)\right] d t^{\prime}Y(ω)=+x(t)[F(ω)exp(ıωt)]dt
then rearrange the terms to obtain
Y ( ω ) = F ( ω ) + x ( t ) cxp ( i ω t ) d t Y ( ω ) = F ( ω ) + x t cxp i ω t d t Y(omega)=F(omega)int_(-oo)^(+oo)x(t^('))cxp(-i omegat^('))dt^(')Y(\omega)=F(\omega) \int_{-\infty}^{+\infty} x\left(t^{\prime}\right) \operatorname{cxp}\left(-i \omega t^{\prime}\right) d t^{\prime}Y(ω)=F(ω)+x(t)cxp(iωt)dt
Note that the integral in equation (A-10b) is the Fourier trassform of x ( t ) x ( t ) x(t)x(t)x(t), and therefore,
Y ( ω ) = F ( ω ) X ( ω ) Y ( ω ) = F ( ω ) X ( ω ) Y(omega)=F(omega)X(omega)Y(\omega)=F(\omega) X(\omega)Y(ω)=F(ω)X(ω)
which is the desired result given by entry (6) of Table A-1.

A. 2 The z z zzz-Transform

A discrete time function is called a time series. When digitized, the continuous function x ( t ) x ( t ) x(t)x(t)x(t) takes the form
x ( t ) = k x k δ ( t k Δ t ) , k = 0 , 1 , 2 , x ( t ) = k x k δ ( t k Δ t ) , k = 0 , 1 , 2 , x(t)=sum_(k)x_(k)delta(t-k Delta t),quad k=0,1,2,dotsx(t)=\sum_{k} x_{k} \delta(t-k \Delta t), \quad k=0,1,2, \ldotsx(t)=kxkδ(tkΔt),k=0,1,2,
where Δ t Δ t Delta t\Delta tΔt is the sampling interval and δ ( t k Δ t ) δ ( t k Δ t ) delta(t-k Delta t)\delta(t-k \Delta t)δ(tkΔt) is the Dirac delta function. The discrete equivalent of the Fourier integral given by equation (A-1) is written as a summation
X ( ω ) = k x k exp ( i ω k Δ t ) , k = 0 , 1 , 2 , X ( ω ) = k x k exp ( i ω k Δ t ) , k = 0 , 1 , 2 , X(omega)=sum_(k)x_(k)exp(-i omega k Delta t),quad k=0,1,2,dotsX(\omega)=\sum_{k} x_{k} \exp (-i \omega k \Delta t), \quad k=0,1,2, \ldotsX(ω)=kxkexp(iωkΔt),k=0,1,2,
A new variable z = exp ( i ω Δ t ) z = exp ( i ω Δ t ) z=exp(-i omega Delta t)z=\exp (-i \omega \Delta t)z=exp(iωΔt) now is defincd. By substituting into equation (A-13) and explicitly writing the summation, we get
X ( z ) = x 0 + x 1 z + x 2 z 2 + X ( z ) = x 0 + x 1 z + x 2 z 2 + X(z)=x_(0)+x_(1)z+x_(2)z^(2)+dotsX(z)=x_{0}+x_{1} z+x_{2} z^{2}+\ldotsX(z)=x0+x1z+x2z2+
Function X ( z ) X ( z ) X(z)X(z)X(z) in equation (A-14) is called the z z zzz-transform of x ( t ) x ( t ) x(t)x(t)x(t). It is a polynomial of the z z zzz variable. The power of z z zzz represents the time delay of the discrete samples in the time series x ( t ) x ( t ) x(t)x(t)x(t).
We now show that convolution of two time series is equivalent to the multiplication of their z z zzz-transforms. Consider two discrete time series x ( t ) : ( x 0 , x 1 , x 2 ) x ( t ) : x 0 , x 1 , x 2 -x(t):(x_(0),x_(1),x_(2))-x(t):\left(x_{0}, x_{1}, x_{2}\right)x(t):(x0,x1,x2) and f ( t ) : ( f 0 , f 1 ) f ( t ) : f 0 , f 1 f(t):(f_(0),f_(1))f(t):\left(f_{0}, f_{1}\right)f(t):(f0,f1). Convolution of the two series is obtained by using Table 1-5. The results of the convolutional process are displayed in Table A-2.
The discrete output series y ( t ) : ( y 0 , y 1 , y 2 , y 3 ) y ( t ) : y 0 , y 1 , y 2 , y 3 y(t):(y_(0),y_(1),y_(2),y_(3))y(t):\left(y_{0}, y_{1}, y_{2}, y_{3}\right)y(t):(y0,y1,y2,y3) is given by
y 0 = f 0 x 0 y 1 = f 1 x 0 + f 0 x 1 y 2 = f 1 x 1 + f 0 x 2 y 3 = f 1 x 2 y 0 = f 0 x 0 y 1 = f 1 x 0 + f 0 x 1 y 2 = f 1 x 1 + f 0 x 2 y 3 = f 1 x 2 {:[y_(0)=f_(0)x_(0)],[y_(1)=f_(1)x_(0)+f_(0)x_(1)],[y_(2)=f_(1)x_(1)+f_(0)x_(2)],[y_(3)=f_(1)x_(2)]:}\begin{aligned} & y_{0}=f_{0} x_{0} \\ & y_{1}=f_{1} x_{0}+f_{0} x_{1} \\ & y_{2}=f_{1} x_{1}+f_{0} x_{2} \\ & y_{3}=f_{1} x_{2} \end{aligned}y0=f0x0y1=f1x0+f0x1y2=f1x1+f0x2y3=f1x2
The z z zzz-transforms of the two input series are expressed by
X ( z ) = x 0 + x 1 z + x 2 z 2 X ( z ) = x 0 + x 1 z + x 2 z 2 X(z)=x_(0)+x_(1)z+x_(2)z^(2)X(z)=x_{0}+x_{1} z+x_{2} z^{2}X(z)=x0+x1z+x2z2
and
F ( z ) = f 0 + f 1 z F ( z ) = f 0 + f 1 z F(z)=f_(0)+f_(1)zF(z)=f_{0}+f_{1} zF(z)=f0+f1z
By multiplying the two polynomials of equations (A-16a) and (A-16b), we obtain
X ( z ) F ( z ) = f 0 x 0 + ( f 1 x 0 + f 0 x 1 ) z + ( f 1 x 1 + f 0 x 2 ) z 2 + ( f 1 x 2 ) z 3 X ( z ) F ( z ) = f 0 x 0 + f 1 x 0 + f 0 x 1 z + f 1 x 1 + f 0 x 2 z 2 + f 1 x 2 z 3 X(z)F(z)=f_(0)x_(0)+(f_(1)x_(0)+f_(0)x_(1))z+(f_(1)x_(1)+f_(0)x_(2))z^(2)+(f_(1)x_(2))z^(3)X(z) F(z)=f_{0} x_{0}+\left(f_{1} x_{0}+f_{0} x_{1}\right) z+\left(f_{1} x_{1}+f_{0} x_{2}\right) z^{2}+\left(f_{1} x_{2}\right) z^{3}X(z)F(z)=f0x0+(f1x0+f0x1)z+(f1x1+f0x2)z2+(f1x2)z3
Table A-2. Convolution of ( f 0 , f 1 ) f 0 , f 1 (f_(0),f_(1))\left(f_{0}, f_{1}\right)(f0,f1) with ( x 0 , x 1 , x 2 ) x 0 , x 1 , x 2 (x_(0),x_(1),x_(2))\left(x_{0}, x_{1}, x_{2}\right)(x0,x1,x2).
x 0 x 0 x_(0)x_{0}x0 x 1 x 1 x_(1)x_{1}x1 x 2 x 2 x_(2)x_{2}x2 Output
f 1 f 1 f_(1)f_{1}f1 f 0 f 0 f_(0)f_{0}f0 y 0 y 0 y_(0)y_{0}y0
f 1 f 1 f_(1)f_{1}f1 f 0 f 0 f_(0)f_{0}f0 y 1 y 1 y_(1)y_{1}y1
f 1 f 1 f_(1)f_{1}f1 f 0 f 0 f_(0)f_{0}f0 y 2 y 2 y_(2)y_{2}y2
f 1 f 1 f_(1)f_{1}f1 f 0 f 0 f_(0)f_{0}f0 y 3 y 3 y_(3)y_{3}y3
x_(0) x_(1) x_(2) Output f_(1) f_(0) y_(0) f_(1) f_(0) y_(1) f_(1) f_(0) y_(2) f_(1) f_(0) y_(3) | | | $x_{0}$ | $x_{1}$ | $x_{2}$ | | Output | | :--- | :--- | :--- | :--- | :--- | :--- | :--- | | $f_{1}$ | $f_{0}$ | | | | $y_{0}$ | | | | | $f_{1}$ | $f_{0}$ | | | $y_{1}$ | | | | $f_{1}$ | $f_{0}$ | | $y_{2}$ | | | | | | $f_{1}$ | $f_{0}$ | $y_{3}$ | |
By comparing the coefficients of the polynomial given by equation (A-17) with the output of convolution in equations (A-15), we find that if
y ( t ) = f ( t ) x ( t ) y ( t ) = f ( t ) x ( t ) y(t)=f(t)**x(t)y(t)=f(t) * x(t)y(t)=f(t)x(t)
then,
Y ( z ) = F ( z ) X ( z ) Y ( z ) = F ( z ) X ( z ) Y(z)=F(z)X(z)Y(z)=F(z) X(z)Y(z)=F(z)X(z)
and, since z = exp ( ı ω Δ t ) z = exp ( ı ω Δ t ) z=exp(-ıomega Delta t)z=\exp (-\imath \omega \Delta t)z=exp(ıωΔt),
Y ( ω ) = F ( ω ) X ( ω ) Y ( ω ) = F ( ω ) X ( ω ) Y(omega)=F(omega)X(omega)Y(\omega)=F(\omega) X(\omega)Y(ω)=F(ω)X(ω)

A. 3 The 2-D Fourier Transform

The 2-D Fourier transform of a 2-D function, such as a wavefield P ( x , t ) P ( x , t ) P(x,t)P(x, t)P(x,t), is given by
P ( k x , ω ) = P ( x , t ) exp ( i k x x i ω t ) d x d t P k x , ω = P ( x , t ) exp i k x x i ω t d x d t P(k_(x),omega)=∬P(x,t)exp(ik_(x)x-i omega t)dxdtP\left(k_{x}, \omega\right)=\iint P(x, t) \exp \left(i k_{x} x-i \omega t\right) d x d tP(kx,ω)=P(x,t)exp(ikxxiωt)dxdt
Function P ( x , t ) P ( x , t ) P(x,t)P(x, t)P(x,t) can be reconstructed from P ( k x , ω ) P k x , ω P(k_(x),omega)P\left(k_{x}, \omega\right)P(kx,ω) by the 2 -D inverse Fourier transform:
P ( x , t ) = P ( k x , ω ) exp ( i k x x + i ω t ) d k x d ω P ( x , t ) = P k x , ω exp i k x x + i ω t d k x d ω P(x,t)=∬P(k_(x),omega)exp(-ik_(x)x+i omega t)dk_(x)d omegaP(x, t)=\iint P\left(k_{x}, \omega\right) \exp \left(-i k_{x} x+i \omega t\right) d k_{x} d \omegaP(x,t)=P(kx,ω)exp(ikxx+iωt)dkxdω
The integral given by equation (A-19) is evaluated in two steps. First, by Fouricr transforming in t t ttt,
P ( x , ω ) = P ( x , t ) exp ( i ω t ) d t P ( x , ω ) = P ( x , t ) exp ( i ω t ) d t P(x,omega)=int P(x,t)exp(-i omega t)dtP(x, \omega)=\int P(x, t) \exp (-i \omega t) d tP(x,ω)=P(x,t)exp(iωt)dt
then by Fourier transforming in x x xxx, we get the 2-D transform:
P ( k x , ω ) = P ( x , ω ) exp ( ı k x ) d x P k x , ω = P ( x , ω ) exp ı k x d x P(k_(x),omega)=int P(x,omega)exp(ık_(x))dxP\left(k_{x}, \omega\right)=\int P(x, \omega) \exp \left(\imath k_{x}\right) d xP(kx,ω)=P(x,ω)exp(ıkx)dx

REFERENCES

Bracewell, R. N., 1965, The Fourier transform and its applications: McGraw-Hill Book Co. Claerbout, J. F., 1976, Fundamentals of geophysical data processing: McGraw-Hill Book Co. Cleerbout, J. F, 1985, Imaging the earth's interior: Blackwell Scientific Publications.
Grant, F. S. and West, G. F., 1965, Interpretation theory in applied geophysics: McGraw-Hill Book Co.
Larner, K. L., Chambers, R., and Rothmen, D., 1981, Trace interpolation and design of 3-D surveys: Presented at the Ann. Eur. Assoc. Expl. Geophys. Mtg.
Larner, K. L., Chambers, R., Yang, M., Lynn, W., and Wai, W., 1983, Coherent noise in marine seismic data: Geophysics, 48 , 854 886 48 , 854 886 48,854-88648,854-88648,854886.
Li, Z., Lynn, W., Chambers, R., Larner, K., and Abma, R., 1991, Enhancements to prestack frequency-wavenumber ( f k ( f k (f-k(f-k(fk ) migration: Geophysics, 56, 27-40.
Mayne, W. H., 1962, Common-reflection-point horizontal data stacking techniques: Geophysics, 27, 927-938.
Newman, P., 1973, Divergence effects in a layered carth: Geophysics, 38, 481-488.
Robinson, E. A. atid Treitel, S., 1980, Geophysical signal analysis: Prentice-Hall, Inc.
Sengbush, R.L., 1983, Seismc exploration methods: Internat. Human Res. Dev. Corp.
Wisecup, R. D., Unambiguous signal recovery above the Nyquist using random-sample-interval imaging: Geophysics, 63, 763-771.
Yilmaz, O. and Cumro, D., 1983, Worldwide assortment of field sesmic records: Tech. Rep., Western Geophysical Company.

2 Deconvolution

  • Introduction - The Convolutional Model } \cdotExtra close brace or missing open brace The Convolutional Model in the Time Domain \bullet The Convolu- tional Model in the Frequency Domain *\cdot Inverse Filtering *\cdot The Inverse of the Source Wavelet \bullet Least-Squares Inverse Filtering *\cdot Minimum Phase \bullet Optimum Wiener Filters *\cdot Spiking Deconvolution \bullet Prewhitening \bullet Wavelet

Length - Prediction Lag *\cdot Percent Prewhitening - Effect of Random Noise on Deconvolution *\cdot Multiple Attenuation *\cdot Field Data Examples - Prestack Deconvolution \bullet Signature Deconvolution \bullet Vibroseis Deconvolution - Poststack Deconvolution - The Problem of Nonstationarity - Time-Variant Deconvolution - Time-Variant Spectral Whitening *\cdot Frequency-Domain Deconvolution - Inverse Q Q QQQ Filtering - Deconvolution Strategies *\cdot Exercises *\cdot Appendix B: Mathematical Foundation of Deconvolution *\cdot Synthetic Seismogram *\cdot The Inverse of the Source Wavelet *\cdot The Inverse Filter *\cdot Frequency-Domain Deconvolution *\cdot Optimum Wiener Filters \bullet Spiking Deconvolution \bullet Predictive Deconvolution \bullet Surface-Consistent Deconvolution \bullet Inverse Q Q QQQ Filtering \bullet References

2.0 INTRODUCTION

Deconvolution compresses the basic wavelet in the recorded seismogram, attenuates reverberations and short-period multiples, thus increases temporal resolution and yields a representation of subsurface reflectivity. The process normally is applied before stack; however, it also is common to apply deconvolution to stacked data. Figure 2.0-1 shows a stacked section with and without deconvolution. Deconvolution has protuced a section with a much higher temporal resolution. The ringy character of the stack without deconvolution limits resolution, considerably.
Figure 2.0-2 shows selected common-midpoint (CMP) gathers from a marine line before and after deconvolution. Note that the prominent reflections stand out more distinctly on the deconvolved gathers. Deconvolution has removed a considerable amount of ringy- ness, while it has compressed the waveform at each of the prominent reflections. The stacked sections associated with these CMP gathers are shown in Figure 2.03. The improvement observed on the deconvolved CMP gathers also are noted on the corresponding stacked section.
Figure 2.0-4 shows some NMO-corrected CMP gathers from a land line with and without deconvolution. Corresponding stacked sections are shown in Figure 2.0-5. Again, note that deconvolution has compressed the wavelet and removed much of the reverberating energy.
Deconvolution sometimes does more than just wavelet compression; it can remove a significant part of the multiple energy from the section. Note that the stacked section in Figure 2.0-6 shows a marked improve-
FIG. 2.0-1. Interpreters prefer the crisp, finely detailed appearance of the deconvolved section (right) as opposed to the blurred, ringy appearance of the section without deconvolution (left). (Data courtesy Enterprise Oil.)
ment between 2 and 4 s 4 s 4s4 \mathrm{~s}4 s after deconvolution.
To understand deconvolution, first we need to examine the constituent elements of a recorded seismic trace (Section 2.1). The earth is composed of layers of rocks with different lithology and physical properties. Seismically, rock layers are defined by the densities and velocities with which seismic waves propagate through them. The product of density and velocity is called seismuc impedance. The inpedance contrast between adjacent rock layers causes the reflections that are recorded along a surface profile. The recorded seismogram can be modeled as a convolution of the earth's impulse response with the seismic wavelet. This wavelet has many components, including source signature, secording filter, surface reflections, and receiver-array response. The earth's impulse response is what would be recorded if the wavelet were just a spike. The impulse response comprises primary reftections (reflectivity series) and all possible multiples.
Ideally, deconvolution should compress the wavelet components and eliminate multiples, leaving only the earth's reflectivity in the seismic trace. Wavelet compression can be done using an inverse filter as a deconvolution operator. An inverse filter, when convolved with the seismic wavelet, converts it to a spike (Section 2.2). When applied to a seismogram, the inverse filter should yield the earth's impulse response. An accurate inverse filter design is achieved using the least-squares method (Section 2.2).
The fundamental assumption underlying the deconvolution process (with the usual case of unknown source wavelet) is that of minimum phase. This issue is dealt with also in Section 2.2 .
The optimum Wiener filter, which has a wide range of applications, is discussed in Section 2.3. The Wiener filter converts the seismic wavelet into any desired shape. For example, much like the inverse filter, a Wiener filter can be designed to convert the seismic
s
(a)
(b)
FIG. 2.0-2. Note the prominent reflections on the deconvolved gathers (b). The reverberations would make it difficult to distinguish prominent reflections on the undeconvolved gathers (a).
(a)
(b)
FIG. 2.0-3. (a) The section obtained from the undeconvolved gathers of Figure 2.0-2a, and (b) the section obtained from the deconvolved gathers of Figure 2.0-2b.
wavelet into a spike. However, the Wiener filter differs from the inverse filter in that it is optimal in the lenstsquares sense. Also, the resolution (spikiness) of the output can be controlled by designing a Wiener predicizon error filter the basis for prediçtive deconvolution (Section 2.3). Converting the seismic wavelet into a spike is like asking for a perfect resolution. In practice, because of noise in the seismogram and assumptions made about the seismic wavelet and the recorded seismogram, spiking deconvolution is not always desirable. Finally, the prediction error filter can be used to remove periodic components multiples, from the seimogram. Practical aspects of predictive deconvolution are presented in Section 2.4, and field data examples are provided in Section 2.5. Finally, time-varying aspects of the source waveform nonstationarity, are discussed in Section 2.6 .
The mathematical treatment of deconvolution is found in Appendix B. However, several numerical examples, which provide the theoretical groundwork from a heuristic viewpoint, are given in the text. Much of the early theoretical work on deconvolution came from the MIT Geophysical Analysis Group, which was formed in the mid-1950s.

2.1 THE CONVOLUTIONAL MODEL

A sonic log log log\loglog segment is shown in Figure 2.1-1a. The sonic log log log\loglog is a plot of interval velocity as a function of depth based on downhole measurement using logging tools. Here, velocities were measured between the 1000 1000 1000-1000-1000 to 5400 f t 5400 f t 5400-ft5400-\mathrm{ft}5400ft depth interval at 2 - f t f t ft\mathrm{ft}ft intervals. The velocity function was extrapolated to the surface by a linear ramp. The sonic log exhibits a strong low-frequency component with a distinct blocky character representing gross velocity variations. Actually, it is this lowfrequency component that normally is estimated by velocity analysis of CMP gathers (Section 3.2).
In many sonic logs, the low-frequency component is an expression of the general increase of velocity with depth due to compaction. In some sonic logs, however, the low-frequency component exhibits a blocky character (Figure 2.1-1a), which is due to large-scale lithologic variations. Based on this blocky character, we may define layers of constant interval velocity (Table 2-1), each of which can be associated with a geologic formation (Table 2-2).
(a)
(b)
FIG. 2.0-4. Sorne NMO-corrected gathers associated with the stacked sections in Figure 20 5 20 5 20-520-5205, (a) before, (b) after deconvolution. Deconvolution has removed the ringy character from the data.
Table 2-1. The interval velocity trend obtained from the sonic log in Figure 2.1-1a.
Layer
Number
Layer Number| Layer | | :---: | | Number |
Interval Velocity, ft/s Depth Range, f t f t ft\mathrm{ft}ft
1 21000 1000 2000 1000 2000 1000-20001000-200010002000
2 19000 2000 2250 2000 2250 2000-22502000-225020002250
3 18750 2250 2500 2250 2500 2250-25002250-250022502500
4 12650 2500 3775 2500 3775 2500-37752500-377525003775
5 19650 3775 5400 3775 5400 3775-54003775-540037755400
"Layer Number" Interval Velocity, ft/s Depth Range, ft 1 21000 1000-2000 2 19000 2000-2250 3 18750 2250-2500 4 12650 2500-3775 5 19650 3775-5400| Layer <br> Number | Interval Velocity, ft/s | Depth Range, $\mathrm{ft}$ | | :---: | :---: | :---: | | 1 | 21000 | $1000-2000$ | | 2 | 19000 | $2000-2250$ | | 3 | 18750 | $2250-2500$ | | 4 | 12650 | $2500-3775$ | | 5 | 19650 | $3775-5400$ |
*The velocity in Layer 2 gradually decreases from the top of the layer to the bottom.
Table 2-2. Stratigraphic identification associated with layering described in Table 2-1.
Layer Number Lithologic Unit
Limestone
Shaly limestone with gradual increase in shale content Shaly limestone
Sandstone
Dolomite
(a)
(b)
FIG. 2.0-5. Deconvolution helps distinguish prominent reflections with ease (b). However, on a section without deconvolution (a), reflections are buried in reverberating energy. Selected CMP gathers for both sections are shown in Figure 2.0-4.
The sonic log also has a high-frequency component superimposed on the low-frequency component. These rapid fluctuations can be attributed to changes in rock properties that are local in nature. For example, the limestone layer can have interbeddings of shale and sand. Porosity changes also can affect interval velocities within a rock layer. Note that well-log measurements have a limited accuracy; therefore, some of the highfrequency variations, particularly those associated with a first arrival that is strong enough to trigger one re- ceiver but not the other in the log tool (cycle skips), are not due to changes in lithology.
Well-log measurements of velocity and density provide a link between seismic data and the geology of the substrata. We now explain the link between log log log\loglog measurements and the recorded seismic trace provided by seismic impedance the product of density and velocity. The first set of assumptions that is used to build the forward model for the seismic trace follows:
(a)
(b)
FIG. 2,0-6. CMP stacks with (a) no deconvolution before stack, (b) spiking deconvolution before stack. Deconvolution can remove a significant amount of multiple energy from seisrnic data. (Data courtesy Elf Aquitane and partners.)
Assumption 1. The earth is made up of horizontal layers of constant velocity.
Assumption 2. The source generates a compressional plane wave that impinges on layer boundaries at normal incidence. Under such circumstances, no shear waves are generated.
Assumption 1 is violated in both structurally complex areas and in areas with gross lateral facies changes. Assumption 2 implies that our forward model for the seismic trace is based on zero-offset recording an unrealizable experiment. Nevertheless, if the layer boundaries were deep in relation to cable length, we assume that the angle of incidence at a given boundary is small and ignore the angle dependence of reflection coeffi- cients. Combination of the two assumptions thus imply a normal-incidence one-dimensional (1-D) seismogram.
Based on assumptions 1 and 2 , the reflection coeffcjent c c ccc (for pressure or stress), which is associated with the boundary between, say, layers 1 and 2, is defined as
c = I 2 I 1 I 2 + I 1 c = I 2 I 1 I 2 + I 1 c=(I_(2)-I_(1))/(I_(2)+I_(1))c=\frac{I_{2}-I_{1}}{I_{2}+I_{1}}c=I2I1I2+I1
where I I III is the seismic impedance associated with each layer given by the product of density ρ ρ rho\rhoρ and compressional velocity v v vvv.
From well-log measurements, we find that the vertical density gradient often is much smaller than the vertical velocity gradient. Therefore, we often assume that the impedance contrast between rock layers is essentially due to the velocity contrast, only. Equation (2-1a) then takes the form:
c = v 2 v 1 v 2 + v 1 c = v 2 v 1 v 2 + v 1 c=(v_(2)-v_(1))/(v_(2)+v_(1))\mathrm{c}=\frac{v_{2}-v_{1}}{v_{2}+v_{1}}c=v2v1v2+v1
If v 2 v 2 v_(2)v_{2}v2 is greater than v 1 v 1 v_(1)v_{1}v1, the reflection coefficient would be pasitive. If v 2 v 2 v_(2)v_{2}v2 is less than v 1 v 1 v_(1)v_{1}v1, then the reflection coefficient would be negative.
The assumption that density is invariant with depth or that it does not vary as much as velocity is not always valid. The reason we can get away with it is that the density gradient usually has the same sign as the velocity gradient. Hence, the impedance function derived from the velocity function only should be correct within a scale factor.
For vertical incidence, the reflection coefficient is the ratio of the reflected wave amplitude to the incident wave amplitude. Moreover, from its definition (equation 2 1 , a ) 2 1 , a ) 2-1,a)2-1, a)21,a), the reflection coefficient is seen as the ratio of the change in acoustic impedance to twice the average acoustic impedance. Therefore, seismic amplitudes associated with earth models with horizontal layers and vertical incidence (assumptions 1 and 2) are related to acoustic impedance variations.
The reflection coefficient series c ( z ) c ( z ) c(z)c(z)c(z), where z z zzz is the depth variable, is derived from sonic log v ( z ) log v ( z ) log v(z)\log v(z)logv(z) and is shown in Figure 2.1-1b. We note the following:
(a) The position of each spike gives the depth of the layer boundary, and
(b) the magnitude of each spike corresponds to the fraction of a unit-amplitude downward-traveling incident plane wave that would be reflected from the layer boundary.
To convert the reflection coefficient series c ( z ) c ( z ) c(z)c(z)c(z) (Figure 2.1-1b) derived from the sonic log log log\loglog into a time series c ( t ) c ( t ) c(t)c(t)c(t), select a sampling interval, say 2 m s 2 m s 2ms2 \mathrm{~ms}2 ms. Then use the velocity information in the log (Figure 2.1-1a) to convert the depth axis to a two-way vertical time axis. The
FIG. 2.1-2. A seismic source wavelet after onset takes the form shown at top left. As the wavelet travels into the earth, the amplitude level drops (geometric spreading) and a loss of high frequencies occurs (frequency absorption).
result of this conversion is shown in Figure 2.1 1 c 2.1 1 c 2.1-1c2.1-1 \mathrm{c}2.11c, both as a conventional wiggle trace and as a variable area and wiggle trace (the same trace repeated six times to highlight strong refections). The reflection coefficient series c ( t ) c ( t ) c(t)c(t)c(t) (Figure 2.1-1c) represents the reflectivity of a series of fictitious layer boundaries that are separated by an equal time interval the sampling rate (Goupillaud, 1961). The major events in this reflectivity series are from the boundary between layers 2 and 3 located at about 0.3 s 0.3 s 0.3s0.3 \mathrm{~s}0.3 s, and the boundary between layers 4 and 5 located at about 0.5 s 0.5 s 0.5s0.5 \mathrm{~s}0.5 s.
The reflection coefficient series (Figure 2.1-1c) that was constructed is composed only of primary reflections (energy that was reflected only once). To get a complete 1-D response of the horizontally-layered earth model (assumption 1), multiple reflections of all types (surface, intrabed and interbed multiples) must be included. If the source were unit-amplitude spike, then the recorded zero-offset seismogram would be the impulse response of the earth, which includes primary and multiple reflections. Here, the Kunetz method (Claerbout, 1976) is used to obtain such an impulse response. The impulse response derived from the reflection coefficient series in Figure 2.1-1c is shown in Figure 2.1-1d with the variable area and wiggle display.
The characteristic pressure wave created by an impuisive source, such as dynamite or air gun, is called the signature of the source. All signatures can be described as band-limited wavelets of finite duration for example, the measured signature of an Aquapulse source in Figure 2.1-2. As this waveform travels into the earth, its overall amplitude decays because of wavefront divergence. Additionally, frequencies are attenuated because of the absorption effects of rocks (see Section 1.4). The progressive change of the source wavelet in time and depth also is shown in Figure 2.1-2. At any given time, the wavelet is not the same as it was at the onset of source excitation. This time-dependent change in waveform is called nonstatzonarty.
Wavefront divergence is removed by applying a spherical spreading function (Section 1.2). Frequency attenuation is compensated for by the processing techniques discussed in Section 2.6. Nevertheless, the simple convolutional model discussed here does not incorporate nonstationarity. This leads to the following assumption:
Assumption 3. The source waveform does not change as it travels in the subsurface it is stationary.

The Convolutional Model in the Time Domain

A convolutional model for the recorded seismogram now can be proposed. Suppose a vertically propagating downgoing plane wave with source signature (Figure 2.1-3a) travels in depth and encounters a layer boundary at 0.2 -s two-way time. The refection coefficient associated with the boundary is represented by the spike in Figure 2.1-3b. As a result of reflection, the source wavelet replicates itself such that is is scaled by the reflection coefficient. If we have a number of layer boundaries represented by the individual spikes in Figures 2.1 3 b 3 b 3b3 b3b through 2.1-3f, then the wavelet replicates itself at those boundaries in the same manner. If the reflection coefficient is negative, then the wavelet replicates itself with its polarity reversed, as in Figure 2.1-3c.
Now consider the ensemble of the reflection coefficients in Figure 2.1-3g. The response of this sparse spike series to the basic wavelet is a superposition of the individual impulse responses. This linear process is called the principle of superpostion. It is achieved computationally by convolving the basic wavelet with the reflectivity series (Figure 2.1 3 g 2.1 3 g 2.1-3g2.1-3 \mathrm{~g}2.13 g ). The convolutional process already was demonstrated by the numerical example in Section 1.1.
The response of the sparse spike series to the basic wavelet in Figure 2.1-3g has some important characteristics. Note that for events at 0.2 and 0.35 s 0.35 s 0.35s0.35 \mathrm{~s}0.35 s, we identify two layer boundaries. However, to identify the three closely spaced reflecting boundaries from the composite response (at around 0.6 s 0.6 s 0.6s0.6 \mathrm{~s}0.6 s ), the source waveform must be removed to obtain the sparse spike series. This removal process is just the opposite of the convolutional process used to obtain the response of the reflectivity series to the basic wavelet. The reverse process appropriately is called deconvolution.
Principle of Superposition
FIG. 2.1-3. A wavelet (a) traveling in the earth repeats itself when it encounters a reflector along its path ( b , c , d , e , f ) b , c , d , e , f ) b,c,d,e,f)b, c, d, e, f)b,c,d,e,f). The left column represents the reflection coefficients, while the right column represents the response to the wavelet. Amplitudes of the response are scaled by the reflection coefficient. The resulting seismogram (bottom right) represents the composite response of the earth's reflectivity (bottom left) to the wavelet (top right).
The principle of superposition now is applied to the impulse response derived from the sonic log log log\loglog in Figure 2.1-1d. Convolution of a source signature with the impulse response yields the synthetic seismogram shown in Figure 2.1-4. The synthetic seismogram also is shown in Figure 2.1-1e. This 1-D zero-offset seismogram is free of random ambient noise. For a more realistic represen- tation of a recorded seismogram, noise is added (Figure 2.1-4).
The convolutional model of the recorded seismogram now is complete. Mathematically, the convolutional model illustrated in Figure 2.1-4 is given by
x ( t ) = w ( t ) e ( t ) + n ( t ) x ( t ) = w ( t ) e ( t ) + n ( t ) x(t)=w(t)**e(t)+n(t)x(t)=w(t) * e(t)+n(t)x(t)=w(t)e(t)+n(t)
( 2 2 a ) ( 2 2 a ) (2-2a)(2-2 a)(22a)
Convolutional Model
FIG. 2.1-4. The top frame is the same as in Figure 2.1-1d. The asterisk denotes convolution. The recorded seismogram (bottom frame) is the sum of the noise-free seismogram and the noise trace. This figure is equivalent to equation (2-2a).
where x ( t ) x ( t ) x(t)x(t)x(t) is the recorded seismogram, w ( t ) w ( t ) w(t)w(t)w(t) is the besic seismic wavelet, e ( t ) e ( t ) e(t)e(t)e(t) is the earth's impulse response, n ( t ) n ( t ) n(t)n(t)n(t) is the random ambient noise, and *** denotes convolution. Deconvolution tries to recover the reflectivity series (strictly speaking, the impulse response) from the recorded seismogram.
An alternative to the convolutional model given by equation (2-2a) is based on a surface-consistent spectral decomposition (Taner and Coburn, 1981), In such a formulation, the seismic trace is decomposed into the convolutional effects of source, receiver, offset, and the earth's impulse response, thus explicitly accounting for variations in wavelet shape caused by near-source and near-receiver conditions and source-receiver separation. The following equation describes the surface-consistent convolutional model (Section B.8):
x v ( t ) = s 3 ( t ) h l ( t ) e k ( t ) g k ( t ) + n ( t ) , ( 2 2 b ) x v ( t ) = s 3 ( t ) h l ( t ) e k ( t ) g k ( t ) + n ( t ) , ( 2 2 b ) x_(v)^(')(t)=s_(3)(t)**h_(l)(t)**e_(k)(t)**g_(k)(t)+n(t),quad(2-2b)x_{v}^{\prime}(t)=s_{3}(t) * h_{l}(t) * e_{k}(t) * g_{k}(t)+n(t), \quad(2-2 b)xv(t)=s3(t)hl(t)ek(t)gk(t)+n(t),(22b)
where x 1 } ( t ) x 1 } ( t ) x_(1})^(')(t)x_{1\}}^{\prime}(t)x1}(t) is a model of the recorded seismogram, s j ( t ) s j ( t ) s_(j)(t)s_{j}(t)sj(t) is the waveform component associated with source location j , g 2 ( t ) j , g 2 ( t ) j,g_(2)(t)j, g_{2}(t)j,g2(t) is the component associated with receiver location i i iii, and h l ( t ) h l ( t ) h_(l)(t)h_{l}(t)hl(t) is the component associated with offset dependency of the waveform defined for each offset index l = | i j | l = | i j | l=|i-j|l=|i-j|l=|ij|. As in equation (2-2a), e k ( t ) e k ( t ) e_(k)(t)e_{k}(t)ek(t) represents the earth's impulse response at the source-receiver midpoint location, k = ( i + j ) / 2 k = ( i + j ) / 2 k=(i+j)//2k=(i+j) / 2k=(i+j)/2. By comparing equations (2-2a) and (2-2b), we infer that w ( t ) w ( t ) w(t)w(t)w(t) represents the combined effects of s ( t ) , h ( t ) s ( t ) , h ( t ) s(t),h(t)s(t), h(t)s(t),h(t), and g ( t ) g ( t ) g(t)g(t)g(t).
The assumption of surface-consistency implies that the basic wavelet shape depends only on the source and receiver locations, not on the details of the raypath from source to reflector to receiver. In a transition zone, surface conditions at the source and receiver locations may vary significantly from dry to wet surface conditions. Hence, the most likely situation where the surface-consistent convolutional model may be applicable is with transition-zone data. Nevertheless, the formulation described in this section is the most accepted model for the 1-D seismogram.
The random noise present in the recorded seismogram has several sources. External sources are wind motion, environmental noise, or a geophone loosely coupled to the ground. Internal noise can arise from the recording instruments. A pure-noise seismogram and its characteristics are shown in Figure 2.1-5. A pure randomnoise series has a white spectrum - it contains all the frequencies. This means that the autocorrelation function is a spike at zero lag and zero at all other lags. From Figure 2.1-5, note that these characteristic requirements are reasonably satisfied.
Now exarnine the equation for the convolutional model. All that normally is known in equation (2-2a) is x ( t ) x ( t ) x(t)x(t)x(t) - the recorded seismogran. The earth's impulse response e ( t ) e ( t ) e(t)e(t)e(t) must be estimated everywhere except at the location of wells with good sonic logs. Also, the source waveform w ( t ) w ( t ) w(t)w(t)w(t) normally is unknown. In certain cases, however, the source waveform is partly known; for example, the signature of an air-gun array can be measured. However, what is measured is only the waveform at the very onset of excitation of the source array, and not the wavelet that is recorded at the receiver. Finally, there is no a priori knowledge of the ambient noise n ( t ) n ( t ) n(t)n(t)n(t).
We now have three unknowns w ( t ) , e ( t ) w ( t ) , e ( t ) -w(t),e(t)-w(t), e(t)w(t),e(t), and n ( t ) n ( t ) n(t)n(t)n(t), one known x ( t ) x ( t ) -x(t)-x(t)x(t), and one single equation (2-2a). Can this problem be solved? Pessimists would say no. However, in practice, deconvolution is applied to seismic data as an integral part of conventional processing and is an effective method to increase temporal resolution.
To solve for the unknown e ( t ) e ( t ) e(t)e(t)e(t) in equation (2-2a), further assumptions must be made.
Assumption 4. The noise component n ( t ) n ( t ) n(t)n(t)n(t) is zero.
FIG. 2.1-5. A random signal with infinite length has a flat amplitude spectrum and an autocorrelogran that is zero at all lags except the zero lag. The discrete random series with finite length shown here seems to satisfy these requirements. What distinguishes a random signal from a spike ( 1 , 0 , 0 , ) ( 1 , 0 , 0 , ) (1,0,0,dots)(1,0,0, \ldots)(1,0,0,) ?
Assumption 5. The source waveform is known.
Under these assumptions, we have one equation,
x ( t ) = w ( t ) e ( t ) . x ( t ) = w ( t ) e ( t ) . x(t)=w(t)**e(t).x(t)=w(t) * e(t) .x(t)=w(t)e(t).
and one unknown, the reflectivity series c ( t ) c ( t ) c(t)c(t)c(t). In reality, however, neither of the above two assumptions normally is valid. Therefore, the convolutional model is examined further in the next section, this time in the frequency domain, to relax assumption 5 .
If the source waveform were known (such as the recorded source signature), then the solution to the deconvolution problem is deterministic. In Section 2.2, one such method of solving for e ( t ) e ( t ) e(t)e(t)e(t) is considered. If the source waveform were unknown (the usual case), then the solution to the deconvolution problem is statistical. The Wiener prediction theory (Section 2.3) provides one method of statistical deconvolution.

The Convolutional Model in the Frequency Domain

The convolutional model for the noise-free seismogram (assumption 4) is represented by equation (2-3a). Con- volution in the time domain is equivalent to multiplication in the frequency domain (Section A.1). This means that the the amplitude spectrum of the seismogram equals the product of the amplitude spectra of the seismic wavelet and the earth's impulse response (Section B.1):
A x ( ω ) = A w ( ω ) A e ( ω ) A x ( ω ) = A w ( ω ) A e ( ω ) A_(x)(omega)=A_(w)(omega)A_(e)(omega)A_{x}(\omega)=A_{w}(\omega) A_{e}(\omega)Ax(ω)=Aw(ω)Ae(ω)
where A I ( ω ) , A w ( ω ) A I ( ω ) , A w ( ω ) A_(I)(omega),A_(w)(omega)A_{I}(\omega), A_{w}(\omega)AI(ω),Aw(ω), and A e ( ω ) A e ( ω ) A_(e)(omega)A_{\mathrm{e}}(\omega)Ae(ω) are the amplitude spectra of x ( t ) , w ( t ) x ( t ) , w ( t ) x(t),w(t)x(t), w(t)x(t),w(t), and e ( t ) e ( t ) e(t)e(t)e(t), respectively.
Figure 2.1-6 shows the amplitude spectra (top row) of the impulse response e ( t ) e ( t ) e(t)e(t)e(t), the seismic wavelet w ( t ) w ( t ) w(t)w(t)w(t), and the seismogram x ( t ) x ( t ) x(t)x(t)x(t). The impulse response is the same as that shown in Figure 2.1-1d. The similarity in the overall shape between the amplitude spectrum of the wavelet and that of the seismogram is apparent. In fact, a smoothed version of the amplitude spectrum of the seismogram is nearly indistinguishable from the amplitude spectrum of the wavelet. It generally is thought that the rapid fluctuations observed in the amplitude spectrum of a seismogram are a manifestation of the earth's impulse response, while the basic shape is associated primarily with the source wavelet.
Mathematically, the similarity between the amplitude spectra of the seismogram and the wavelet suggests that the amplitude spectrum of the earth's impulse response must be nearly flat (Section B.1). By examining the amplitude spectrum of the impulse response in Figure 2.1-6, we see that it spans virtually the entire spectral bandwidth. As seen in Figure 2.1-5, a time series that represents a random process has a flat (white) spectrum over the entire spectral bandwidth. From close examination of the amplitude spectrum of the impulse response in Figure 2.1-6, we see that it is not entirely flat - the high-frequency components have a tendency to strengthen gradually. Thus, reflectivity is not entirely a random process. In fact, this has been observed in the spectral properties of reflectivity functions derived from a worldwide selection of sonic logs (Walden and Hosken, 1984).
We now study the autocorrelation functions (middle row, Figure 2.16) of the impulse response, seismic wavelet, and synthetic seismogram. Note that the autocorrelation functions of the basic wavelet and seismogram also are similar. This similarity is confined to lags for which the autocorrelation of the wavelet is nonzero. Mathematically, the similarity between the autocorrelogram of the wavelet and that of the seismogram suggests that the impulse response has an autocorrelation function that is small at all lags except the zero lag (Section B.1). The autocorrelation function of the random series in Figure 2.1-5 also has similar characteristics. However, there is one subtle difference. When compared, Figures 2.1-5 and 2.1-6 show that autocorrelation of
(a)
(b) (c)
FIG. 2.1-6. Convolution of the earth's impulse response (a) with the wavelet (b) (equation 2-2a) yields the seismogram (c) (bottom row). This process also is convolutional in terms of their autocorrelograms (middie row) and multiplicative in terms of their amplitude spectra (top row). Assumption 6 (white refectivity) is based on the similarity between autocorrelograms and amplitude spectra of the impulse response and wavelet.
the impulse response has a significantly large negative lag value following the zero lag. This is not the case for the autocorrelation of random noise. The positive peak (zero lag) followed by the smaller negative peak in the autocorrelogram of the impulse response arises from the spectral behavior discussed above. In particular, the positive peak and the adjacent, smaller negative peak of the autocorrelogram together nearly act as a fractional derivative operator (Section A.1), which has a ramp effect on the amplitude spectrum of the impulse response as seen in Figure 2.1-6.
The above observations made on the amplitude spectra and autocorrelation functions (Figure 2.1-6) imply that reflectivity is not entirely a random process. Nonetheless, the following assumption aimost always is made about reflectivity to replace the statement made in assumption 5.
Assumption 6. Reflectivity is a random process. This implies that the geismogram has the characteristics of the seismic wavelet in that their antocorrelations and amplitude spectra are similar.
This assumption is the key to implementing the predictive deconvolution. It allows the autocorrelation of the seismogram, which is known, to be substatuted for the autocorrelation of the sersmic wavelet, whach is unknown. In Section 2.3, we shall see that as a result of assumption 6 , an inverse filter can be estimated directly from the autocorrelation of the seismogram. For this type of deconvolution, Assumption 5, which is almost never met in reality, is not required. But first, we need to review the fundamentals of inverse filtering.

2.2 INVERSE FILTERING

If a filter operator f ( t ) f ( t ) f(t)f(t)f(t) were defined such that convolution of f ( t ) f ( t ) f(t)f(t)f(t) with the known seismogram x ( t ) x ( t ) x(t)x(t)x(t) yields an estimate of the earth's insulse response e ( t ) e ( t ) e(t)e(t)e(t), then
e ( t ) = f ( t ) x ( t ) e ( t ) = f ( t ) x ( t ) e(t)=f(t)**x(t)e(t)=f(t) * x(t)e(t)=f(t)x(t)
By substituting equation (2-4) into equation (2-3a), we get
x ( t ) = w ( t ) f ( t ) L ( t ) x ( t ) = w ( t ) f ( t ) L ( t ) x(t)=w(t)**f(t)**L(t)x(t)=w(t) * f(t) * \mathscr{L}(t)x(t)=w(t)f(t)L(t)
When x ( t ) x ( t ) x(t)x(t)x(t) is eliminated from both sides of the equation, the foliowing expression resuits:
δ ( t ) = w ( t ) f ( t ) δ ( t ) = w ( t ) f ( t ) delta(t)=w(t)**f(t)\delta(t)=w(t) * f(t)δ(t)=w(t)f(t)
where δ ( t ) δ ( t ) delta(t)\delta(t)δ(t) represents the Kronecker delta function:
δ ( t ) = { 1 , t = 0 0 , otherwise. δ ( t ) = 1 , t = 0 0 ,  otherwise.  delta(t)={[1",",t=0],[0","," otherwise. "]:}\delta(t)= \begin{cases}1, & t=0 \\ 0, & \text { otherwise. }\end{cases}δ(t)={1,t=00, otherwise. 
By solving equation (2-6) for the filter operator f ( t ) f ( t ) f(t)f(t)f(t), we obtain
f ( t ) = δ ( t ) 1 w ( t ) f ( t ) = δ ( t ) 1 w ( t ) f(t)=delta(t)**(1)/(w(t))f(t)=\delta(t) * \frac{1}{w(t)}f(t)=δ(t)1w(t)
FIG. 2.2-1. A flowchart for inverse filtering.
Therefore, the filtex operator f ( t ) f ( t ) f(t)f(t)f(t) needed to compute the earth's impulse response from the recorded seismogram turns out to be the mathematical inverse of the seismic wavelet w ( t ) w ( t ) w(t)w(t)w(t). Equation (2-8) implies that the inverse filter converts the basic wavelet to a spike at t = 0 t = 0 t=0t=0t=0. Likewise, the iuverse filter converts the seismogran to a series of spikes that defines the earth's impulse response. Therefore, inverse filtering is a method of deconvolution, provided the source waveform is known (determnnstic deconvolution). The procedure for inverse filtering is described in Figure 2.2-1.

The Inverse of the Source Wavelet

Computation of the inverse of the source wavelet is accomplished mathematically by using the z z zzz-transform (Section A.2). For example, let the basic wavelet be a two-point time series given by w ( t ) : ( 1 , 1 2 ) w ( t ) : 1 , 1 2 w(t):(1,-(1)/(2))w(t):\left(1,-\frac{1}{2}\right)w(t):(1,12). The z z zzz-transform of this wavelet is defined by the following polynomial:
W ( z ) = 1 1 2 z W ( z ) = 1 1 2 z W(z)=1-(1)/(2)zW(z)=1-\frac{1}{2} zW(z)=112z
The power of variable z z zzz is the number of unit time delays associated with each sample in the series. The first term has zero delay, so z z zzz is raised to zero power. The second term has unit delay, so z z zzz is raised to first power. Hence, the z z zzz-transform of a time series is a polynomial in z z zzz, whose coefficients are the values of the time samples.
A relationship exists between the z z zzz-transform and the Fourier transform (Section A.2). The z z zzz-variable is defined as
z = exp ( i ω Δ t ) z = exp ( i ω Δ t ) z=exp(-i omega Delta t)z=\exp (-i \omega \Delta t)z=exp(iωΔt)
whete ω ω omega\omegaω is angular frequency and Δ t Δ t Delta t\Delta tΔt is sarmpling interval.
The convolutional relation in the time domain given by equation (2-8) means that the z z zzz-transform of the inverse filter, F ( x ) F ( x ) F(x)F(x)F(x), is obtanned by polynomial division of the z z zzz-transform of the input wavelet, W ( z ) W ( z ) W^(')(z)W^{\prime}(z)W(z), given by equation (2-9) (Section A.2):
F ( z ) = 1 1 1 2 z = 1 + 1 2 z + 1 4 z 2 + F ( z ) = 1 1 1 2 z = 1 + 1 2 z + 1 4 z 2 + F(z)=(1)/(1-(1)/(2)z)=1+(1)/(2)z+(1)/(4)z^(2)+cdotsF(z)=\frac{1}{1-\frac{1}{2} z}=1+\frac{1}{2} z+\frac{1}{4} z^{2}+\cdotsF(z)=1112z=1+12z+14z2+
The coefficients of F ( z ) : ( 1 , 1 2 , 1 4 , ) F ( z ) : 1 , 1 2 , 1 4 , F(z):(1,(1)/(2),(1)/(4),dots)F(z):\left(1, \frac{1}{2}, \frac{1}{4}, \ldots\right)F(z):(1,12,14,) represent the time series associated with the filter operator f ( t ) f ( t ) f(t)f(t)f(t). Note that the series has an infinite number of coefficients, although they decay rapidly. As in any filtering process, in practice the operator is truncated.
First consider the first two terms in equation (211) which yield a two point filter operator ( 1 , 1 2 ) 1 , 1 2 (1,(1)/(2))\left(1, \frac{1}{2}\right)(1,12). The design and application of this operator is summarized in Table 2-3. The actual output is ( 1 , 0 , 1 4 ) 1 , 0 , 1 4 (1,0,-(1)/(4))\left(1,0,-\frac{1}{4}\right)(1,0,14), whereas the ideal result is a zero-delay spike ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0). Although not ideal, the actual result is spikier than the input wavelet, ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12).
Can the result be improved by including one more coefficient in the inverse filter? As shown in Table 2-4, the actual output from the three-point filter is ( 1 , 0 , 0 , 1 8 ) 1 , 0 , 0 , 1 8 (1,0,0,-(1)/(8))\left(1,0,0,-\frac{1}{8}\right)(1,0,0,18). This is a more accurate representation of the desired output ( 1 , 0 , 0 , 0 ) ( 1 , 0 , 0 , 0 ) (1,0,0,0)(1,0,0,0)(1,0,0,0) than that achieved with the output from the two-point filter (Table 2-3). Note that there is less energy leaking into the nonzero lags of the output from the three-point filter. Therefore, it is spikier. As more terms are included in the inverse filter: the output is closer to being a spike at zero lag. Since the number of points allowed in the operator length is limited, in practice the result never is a perfect spike.
Table 2-3. Design and application of the truncated inverse filter ( 1 , 1 2 ) 1 , 1 2 (1,(1)/(2))\left(1, \frac{1}{2}\right)(1,12) with the input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12).
Filter Design
Input Wavelet
The z z zzz-Transform
The Inverse
w ( t ) : ( 1 , 1 2 ) W ( z ) = 1 1 2 z F ( z ) = 1 + 1 2 z + 1 4 z 2 + f ( t ) : ( 1 , 1 2 , 1 4 , ) w ( t ) : 1 , 1 2 W ( z ) = 1 1 2 z F ( z ) = 1 + 1 2 z + 1 4 z 2 + f ( t ) : 1 , 1 2 , 1 4 , {:[w(t):(1,-(1)/(2))],[W(z)=1-(1)/(2)z],[F(z)=1+(1)/(2)z+(1)/(4)z^(2)+cdots],[f(t):(1,(1)/(2),(1)/(4),cdots)]:}\begin{aligned} w(t) & :\left(1,-\frac{1}{2}\right) \\ W(z) & =1-\frac{1}{2} z \\ F(z) & =1+\frac{1}{2} z+\frac{1}{4} z^{2}+\cdots \\ f(t) & :\left(1, \frac{1}{2}, \frac{1}{4}, \cdots\right) \end{aligned}w(t):(1,12)W(z)=112zF(z)=1+12z+14z2+f(t):(1,12,14,)
Filter Apphcation
Truncated Inverse Filter
( 1 , 1 2 ) ( 1 , 1 2 ) ( 1 , 0 , 1 4 ) ( 1 , 0 , 0 ) 1 , 1 2 1 , 1 2 1 , 0 , 1 4 ( 1 , 0 , 0 ) {:[(1,(1)/(2))],[(1,-(1)/(2))],[(1,0,-(1)/(4))],[(1","0","0)]:}\begin{aligned} & \left(1, \frac{1}{2}\right) \\ & \left(1,-\frac{1}{2}\right) \\ & \left(1,0,-\frac{1}{4}\right) \\ & (1,0,0) \end{aligned}(1,12)(1,12)(1,0,14)(1,0,0)
Input Wavelet
Actual Output
Desired Output
Convolution Table:
1 1 2 1 1 2 1-(1)/(2)1-\frac{1}{2}112
Output
1 2 1 2 (1)/(2)\frac{1}{2}12
1 1
1 2 1 2 (1)/(2)\frac{1}{2}12 1 0
1 2 1 2 (1)/(2)\frac{1}{2}12 1 = 4 4 = 4 4 =-(4)/(4)=-\frac{4}{4}=44
1 1 (1)/(2) 1 0 (1)/(2) 1 =-(4)/(4)| 1 | | | 1 | | ---: | ---: | ---: | ---: | | $\frac{1}{2}$ | 1 | | 0 | | | $\frac{1}{2}$ | 1 | $=-\frac{4}{4}$ |
Table 2-4. Design and application of the truncated inverse filter ( 1 , 1 2 , 1 4 ) 1 , 1 2 , 1 4 (1,(1)/(2),(1)/(4))\left(1, \frac{1}{2}, \frac{1}{4}\right)(1,12,14) with the input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12).

Ftiter Deswgn

Input Wavelet
The z z zzz-Transform
The Inverse
The Inverse Filter
w ( t ) : ( 1 , 1 2 ) W ( z ) = 1 1 2 z F ( z ) = 1 + 1 2 z + 1 4 z 2 + f ( t ) : ( 1 , 1 2 , 1 4 , ) w ( t ) : 1 , 1 2 W ( z ) = 1 1 2 z F ( z ) = 1 + 1 2 z + 1 4 z 2 + f ( t ) : 1 , 1 2 , 1 4 , {:[w(t):(1,-(1)/(2))],[W(z)=1-(1)/(2)z],[F(z)=1+(1)/(2)z+(1)/(4)z^(2)+cdots],[f(t):(1,(1)/(2),(1)/(4),cdots)]:}\begin{aligned} w(t) & :\left(1,-\frac{1}{2}\right) \\ W(z) & =1-\frac{1}{2} z \\ F(z) & =1+\frac{1}{2} z+\frac{1}{4} z^{2}+\cdots \\ f(t) & :\left(1, \frac{1}{2}, \frac{1}{4}, \cdots\right) \end{aligned}w(t):(1,12)W(z)=112zF(z)=1+12z+14z2+f(t):(1,12,14,)
Filter Application
Truncated Inverse Filter
Input Wavelet
Actual Output
Desired Output
Convolution Table:
1 1 2 Output 1 4 1 2 1 1 1 4 1 2 1 0 1 4 1 2 1 0 1 4 1 2 1 1 8 1 1 2  Output  1 4 1 2 1 1 1 4 1 2 1 0 1 4 1 2 1 0 1 4 1 2 1 1 8 {:[,,1,-(1)/(2)," Output "],[(1)/(4),(1)/(2),1,,,1],[,(1)/(4),(1)/(2),1,,0],[,(1)/(4),(1)/(2),1,0],[,,(1)/(4),(1)/(2),1,-(1)/(8)]:}\begin{array}{rrrrrr} & & 1 & -\frac{1}{2} & \text { Output } \\ \frac{1}{4} & \frac{1}{2} & 1 & & & 1 \\ & \frac{1}{4} & \frac{1}{2} & 1 & & 0 \\ & \frac{1}{4} & \frac{1}{2} & 1 & 0 \\ & & \frac{1}{4} & \frac{1}{2} & 1 & -\frac{1}{8} \end{array}112 Output 1412111412101412101412118
( 1 , 1 2 , 1 4 ) ( 1 , 1 2 ) ( 1 , 0 , 0 , 1 8 ) ( 1 , 0 , 0 , 0 ) 1 , 1 2 , 1 4 1 , 1 2 1 , 0 , 0 , 1 8 ( 1 , 0 , 0 , 0 ) {:[(1,(1)/(2),(1)/(4))],[(1,-(1)/(2))],[(1,0,0,-(1)/(8))],[(1","0","0","0)]:}\begin{aligned} & \left(1, \frac{1}{2}, \frac{1}{4}\right) \\ & \left(1,-\frac{1}{2}\right) \\ & \left(1,0,0,-\frac{1}{8}\right) \\ & (1,0,0,0) \end{aligned}(1,12,14)(1,12)(1,0,0,18)(1,0,0,0)
The inverse of the input wavelet w ( t ) : ( 1 , 1 2 ) w ( t ) : 1 , 1 2 w(t):(1,-(1)/(2))w(t):\left(1,-\frac{1}{2}\right)w(t):(1,12) has coefficients that rapidly decay to zero (equation 2-11). What about the inverse of the input wavelet w ( t ) : ( 1 2 , 1 ) w ( t ) : 1 2 , 1 w(t):(-(1)/(2),1)w(t):\left(-\frac{1}{2}, 1\right)w(t):(12,1) ? Again, define the z z zzz-transform:
W ( z ) = 1 2 + z W ( z ) = 1 2 + z W(z)=-(1)/(2)+zW(z)=-\frac{1}{2}+zW(z)=12+z
The z z zzz-transform of its inverse is given by the polynomial division:
F ( z ) = 1 1 2 + z = 2 4 z 8 z 2 F ( z ) = 1 1 2 + z = 2 4 z 8 z 2 F(z)=(1)/(-(1)/(2)+z)=-2-4z-8z^(2)-cdotsF(z)=\frac{1}{-\frac{1}{2}+z}=-2-4 z-8 z^{2}-\cdotsF(z)=112+z=24z8z2
As a result, the inverse filter coefficients are given by the divergent series f ( t ) : ( 2 , 4 , 8 , ) f ( t ) : ( 2 , 4 , 8 , ) f(t):(-2,-4,-8,cdots)f(t):(-2,-4,-8, \cdots)f(t):(2,4,8,). Truncate this series and convolve the two-point operator with the input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) as shown in Table 2 5 2 5 2-52-525. The actual output is ( 1 , 0 , 4 ) ( 1 , 0 , 4 ) (1,0,-4)(1,0,-4)(1,0,4), while the desired output is ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0). Not only is the result far from the desired output, but also it is less spiky than the input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1). The reason for this poor result is that the inverse filter coefficients increase in time rather than decay (equation 2-13). When truncated, the larger coefficients actually are excluded from the computation.
If we kept the third coefficient of the inverse filter in the above example (equation 2-13), then the actual output (Table 2-6) would be ( 1 , 0 , 0 , 8 ) ( 1 , 0 , 0 , 8 ) (1,0,0,-8)(1,0,0,-8)(1,0,0,8), which also is a bad approximation to the desired output ( 1 , 0 , 0 , 0 ) ( 1 , 0 , 0 , 0 ) (1,0,0,0)(\mathbf{1}, 0,0,0)(1,0,0,0).
Table 2-5. Design and application of the truncated inverse filter ( 2 , 4 ) ( 2 , 4 ) (-2,-4)(-2,-4)(2,4) with input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1).
Filter Design
Input Wavelet
The z z zzz-Transform
The Inverse
The Inverse Filter
w ( t ) : ( 1 2 , 1 ) W ( z ) = 1 2 + z F ( z ) = 2 4 z 8 z 2 f ( t ) : ( 2 , 4 , 8 , ) w ( t ) : 1 2 , 1 W ( z ) = 1 2 + z F ( z ) = 2 4 z 8 z 2 f ( t ) : ( 2 , 4 , 8 , ) {:[w(t):(-(1)/(2),1)],[W(z)=-(1)/(2)+z],[F(z)=-2-4z-8z^(2)-cdots],[f(t):(-2","-4","-8","cdots)]:}\begin{aligned} w(t) & :\left(-\frac{1}{2}, 1\right) \\ W(z) & =-\frac{1}{2}+z \\ F(z) & =-2-4 z-8 z^{2}-\cdots \\ f(t) & :(-2,-4,-8, \cdots) \end{aligned}w(t):(12,1)W(z)=12+zF(z)=24z8z2f(t):(2,4,8,)

Filter Application

Truncated Inverse Filter
( 2 , 4 ) ( 2 , 4 ) (-2,-4)(-2,-4)(2,4)
Input Wavelet
Actual Output
Desired Output
Convolution Table:
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 Output
-(1)/(2) 1 Output| $-\frac{1}{2}$ | 1 | Output | | :--- | :--- | :--- |
4 2 1 4 2 0 4 2 4 4 2 1 4 2 0 4 2 4 {:[-4,-2,,,,1],[,-4,-2,,,0],[,,-4,-2,,-4]:}\begin{array}{lllllr} -4 & -2 & & & & 1 \\ & -4 & -2 & & & 0 \\ & & -4 & -2 & & -4 \end{array}421420424
( 1 , 0 , 4 ) ( 1 , 0 , 0 ) ( 1 , 0 , 4 ) ( 1 , 0 , 0 ) {:[(1","0","-4)],[(1","0","0)]:}\begin{aligned} & (1,0,-4) \\ & (1,0,0) \end{aligned}(1,0,4)(1,0,0)
Output
Table 2-6. Design and application of the truncated inverse filter ( 2 , 4 , 8 ) ( 2 , 4 , 8 ) (-2,-4,-8)(-2,-4,-8)(2,4,8) with input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1).
Falter Desagn
Input Wavelet
The z z zzz-Transform
The Inverse
The Inverse Filter
w ( t ) : ( 1 2 , 1 ) W ( z ) = 1 2 + z F ( z ) = 2 4 z 8 z 2 f ( t ) : ( 2 , 4 , 8 , ) w ( t ) : 1 2 , 1 W ( z ) = 1 2 + z F ( z ) = 2 4 z 8 z 2 f ( t ) : ( 2 , 4 , 8 , ) {:[w(t):(-(1)/(2),1)],[W(z)=-(1)/(2)+z],[F(z)=-2-4z-8z^(2)-cdots],[f(t):(-2","-4","-8","cdots)]:}\begin{aligned} w(t) & :\left(-\frac{1}{2}, 1\right) \\ W(z) & =-\frac{1}{2}+z \\ F(z) & =-2-4 z-8 z^{2}-\cdots \\ f(t) & :(-2,-4,-8, \cdots) \end{aligned}w(t):(12,1)W(z)=12+zF(z)=24z8z2f(t):(2,4,8,)
Falter Application
Truncated Inverse Filter ( 2 , 4 , 8 ) ( 2 , 4 , 8 ) quad(-2,-4,-8)\quad(-2,-4,-8)(2,4,8)
Input Wavelet ( 1 2 , 1 ) 1 2 , 1 quad(-(1)/(2),1)\quad\left(-\frac{1}{2}, 1\right)(12,1)
Actual Output ( 1 , 0 , 0 , 8 ) ( 1 , 0 , 0 , 8 ) quad(1,0,0,-8)\quad(1,0,0,-8)(1,0,0,8)
Desired Output ( 1 , 0 , 0 , 0 ) ( 1 , 0 , 0 , 0 ) quad(1,0,0,0)\quad(1,0,0,0)(1,0,0,0)
Convolution Table:
1 2 1 Output 8 4 2 1 8 4 2 8 4 2 0 8 4 2 8 1 2 1  Output  8 4 2 1 8 4 2 8 4 2 0 8 4 2 8 {:[-(1)/(2)quad1quad" Output "],[{:[-8,-4,-2,1]:}],[{:[-8,-4,-2]:}],[{:[-8,-4,-2,0]:}],[{:[-8,-4,-2,-8]:}]:}\begin{aligned} & -\frac{1}{2} \quad 1 \quad \text { Output } \\ & \begin{array}{llll} -8 & -4 & -2 & 1 \end{array} \\ & \begin{array}{llll} -8 & -4 & -2 \end{array} \\ & \begin{array}{llll} -8 & -4 & -2 & 0 \end{array} \\ & \begin{array}{llll} -8 & -4 & -2 & -8 \end{array} \end{aligned}121 Output 842184284208428

Least-Squares Inverse Filtering

A well-behaved input wavelet, such as ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) as opposed to ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1), has a z z zzz-transform whose inverse can be represented by a convergent series. Then the inverse filtering described above yields a good approximation to a zero-lag spike output ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0). Can we do even better than that?
Formulate the following problem: Given the input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12), find a two-term filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b) such that the error between the actual output and the desired output ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0) is minimum in the least-squares sense.
Compute the actual output by convolving the filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b) with the input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) (Table 2-7). The cumulative energy of the error L L LLL is defined as the sum of the squares of the differences between the coefficients of the actual and desired outputs:
L = ( a 1 ) 2 + ( b a 2 ) 2 + ( b 2 ) 2 . L = ( a 1 ) 2 + b a 2 2 + b 2 2 . L=(a-1)^(2)+(b-(a)/(2))^(2)+(-(b)/(2))^(2).L=(a-1)^{2}+\left(b-\frac{a}{2}\right)^{2}+\left(-\frac{b}{2}\right)^{2} .L=(a1)2+(ba2)2+(b2)2.
The task is to find coefficients ( a , b ) ( a , b ) (a,b)(a, b)(a,b) so that L L LLL takes its minimum value. This requires variation of L L LLL with respect to the coefficients ( a , b ) ( a , b ) (a,b)(a, b)(a,b) to vanish (Section B.5). By simplifying equation (2-14), taking the partial derivatives of quantity L L LLL with respect to a a aaa and b b bbb, and setting the results to zero, we get
5 2 a b = 2 5 2 a b = 2 (5)/(2)a-b=2\frac{5}{2} a-b=252ab=2
and
a + 5 2 b = 0 a + 5 2 b = 0 -a+(5)/(2)b=0-a+\frac{5}{2} b=0a+52b=0
We have two equations and two unknowns; namely, the filter coefficients ( a , b ) ( a , b ) (a,b)(a, b)(a,b). The so-called normal set of equations (2-15a) and (2-15b) can be put into the following convenient matrix form
( 5 / 2 1 1 5 / 2 ) ( a b ) = ( 2 0 ) 5 / 2 1 1 5 / 2 a b = 2 0 ([5//2,-1],[-1,5//2])([a],[b])=([2],[0])\left(\begin{array}{cc} 5 / 2 & -1 \\ -1 & 5 / 2 \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{l} 2 \\ 0 \end{array}\right)(5/2115/2)(ab)=(20)
By solving for the filter coefficients, we obtain ( a , b ) ( a , b ) (a,b)(a, b)(a,b) : ( 0.95 , 0.38 ) ( 0.95 , 0.38 ) (0.95,0.38)(0.95,0.38)(0.95,0.38). Design and application of this least-squares inverse filter are summarized in Table 2-7.
To quantify the spikiness of this result and compare it with the result from the inverse filter in Table 2-3, compute the energy of the errors made in both (Table 2-8). Note that the least-squares filter yjelds less error when trying to convert the input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) to a spike at zero lag ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0).
We now examine the performance of the leastsquares filter with the input wavelet ( I 2 , 1 ) I 2 , 1 (-(I)/(2),1)\left(-\frac{\mathbf{I}}{2}, 1\right)(I2,1). Note that the inverse filter produced unstable results for this wavelet (Table 2-5). We want to find a two-term filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b) that when convolved with the input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1), yields an estimate of the desired spike output ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0) (Table 2-9). As before, the least-squares error between the actual output and the desired output should be minimal.
The cumulative energy of the error is given by
L = ( a 2 1 ) 2 + ( b 2 + a ) 2 + b 2 . L = a 2 1 2 + b 2 + a 2 + b 2 . L=(-(a)/(2)-1)^(2)+(-(b)/(2)+a)^(2)+b^(2).L=\left(-\frac{a}{2}-1\right)^{2}+\left(-\frac{b}{2}+a\right)^{2}+b^{2} .L=(a21)2+(b2+a)2+b2.
Table 2-7. Design and application of a two-term least-
1 1 2 1 2 -(1)/(2)-\frac{1}{2}12 Actual Output Desired Output
b a b a b quad ab \quad aba a a aaa 1
b b bbb a a aaa b a / 2 b a / 2 b-a//2b-a / 2ba/2 0
b / 2 b / 2 -b//2-b / 2b/2 0
1 -(1)/(2) Actual Output Desired Output b quad a a 1 b a b-a//2 0 -b//2 0| 1 | $-\frac{1}{2}$ | Actual Output | Desired Output | | :---: | :---: | :---: | :---: | | $b \quad a$ | | $a$ | 1 | | $b$ | $a$ | $b-a / 2$ | 0 | | | | $-b / 2$ | 0 |
squares inverse filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b).
Filter Design
Convolution of the filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b) with input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) :
Falter Applacation
Least-Squares Filter ( 0.95 , 0.38 ) ( 0.95 , 0.38 ) (0.95,0.38)(0.95,0.38)(0.95,0.38)
Input Wavelet ( 1 , 0.5 ) ( 1 , 0.5 ) (1,-0.5)(1,-0.5)(1,0.5)
Actual Output ( 0.95 , 0.09 , 0.19 ) ( 0.95 , 0.09 , 0.19 ) quad(0.95,-0.09,-0.19)\quad(0.95,-0.09,-0.19)(0.95,0.09,0.19)
Desired Output ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) quad(1,0,0)\quad(1,0,0)(1,0,0)
Table 2-8. Frror in two-term inverse and least-squares filtering.
Input: ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12)
Desired Output: ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0)
Actual Output Error
Energy
Inverse Filter ( 1 , 0 , 0.25 ) ( 1 , 0 , 0.25 ) quad(1,0,-0.25)\quad(1,0,-0.25)(1,0,0.25)
0.063
Least-Squares Filter ( 0.95 , 0.09 , 0.19 ) 0.048 ( 0.95 , 0.09 , 0.19 ) 0.048 quad(0.95,-0.09,-0.19)quad0.048\quad(0.95,-0.09,-0.19) \quad 0.048(0.95,0.09,0.19)0.048
Table 2-9. Design and application of a two-term leastsquares inverse filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b).
Fulter Design
Convolution of filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b) with input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) :
1 2 1 1 2 1 -(1)/(2)quad1-\frac{1}{2} \quad 1121 Actual Output Desired
Output
-(1)/(2)quad1 Actual Output Desired Output | $-\frac{1}{2} \quad 1$ | Actual Output | Desired | | :--- | :--- | :--- | :--- | | Output | | |
b b bbb a a aaa a / 2 a / 2 -a//2-a / 2a/2 1
b b bbb a a aaa b / 2 + a b / 2 + a -b//2+a-b / 2+ab/2+a 0
b b bbb a a aaa b b bbb 0
b a -a//2 1 b a -b//2+a 0 b a b 0 | $b$ | $a$ | | | $-a / 2$ | 1 | | ---: | ---: | ---: | ---: | ---: | ---: | | | $b$ | $a$ | | $-b / 2+a$ | 0 | | | $b$ | $a$ | $b$ | 0 | |
Filter Application
Least-Squares Filter ( 0.95 , 0.19 ) ( 0.95 , 0.19 ) (-0.95,-0.19)(-0.95,-0.19)(0.95,0.19)
Input Wavelet ( 0.5 , 1 ) ( 0.5 , 1 ) (-0.5,1)(-0.5,1)(0.5,1)
Actual Output ( 0.24 , 0.38 , 0.19 ) ( 0.24 , 0.38 , 0.19 ) quad(0.24,-0.38,-0.19)\quad(0.24,-0.38,-0.19)(0.24,0.38,0.19)
Desired Output ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) quad(1,0,0)\quad(1,0,0)(1,0,0)
Table 2-10. Error in two-term inverse and leastsquares filtering.
Input: ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1)
Desired Output: ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0)
Inverse Filter ( 1 , 0 , 4 ) ( 1 , 0 , 4 ) (1,0,-4)(1,0,-4)(1,0,4)
16
Least-Squares Filter ( 0 . 2 4 , 0.38 , 0 . 1 9 ) 0.762 ( 0 . 2 4 , 0.38 , 0 . 1 9 ) 0.762 quad(0.24,-0.38,-0.19)quad0.762\quad(\mathbf{0 . 2 4},-0.38,-\mathbf{0 . 1 9}) \quad 0.762(0.24,0.38,0.19)0.762
By simplifying equation (2-17), taking the partial derivatives of quantity L L LLL with respect to a a aaa and b b bbb, and setting the results to zero, we obtain
5 2 a b = 1 5 2 a b = 1 (5)/(2)a-b=-1\frac{5}{2} a-b=-152ab=1
and
a + 5 2 b = 0 a + 5 2 b = 0 -a+(5)/(2)b=0-a+\frac{5}{2} b=0a+52b=0
Combine equations (2-18a,b) into a matrix form
( 5 / 2 1 1 5 / 2 ) ( a b ) = ( 1 0 ) . ( 2 19 ) 5 / 2 1 1 5 / 2 a b = 1 0 . ( 2 19 ) ([5//2,-1],[-1,5//2])([a],[b])=([-1],[0]).quad(2-19)\left(\begin{array}{cc} 5 / 2 & -1 \\ -1 & 5 / 2 \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{c} -1 \\ 0 \end{array}\right) . \quad(2-19)(5/2115/2)(ab)=(10).(219)
By solving for the filter coefficients, we obtain ( a , b ) ( a , b ) (a,b)(a, b)(a,b); ( 0.95 , 0.19 ) ( 0.95 , 0.19 ) (-0.95,-0.19)(-0.95,-0.19)(0.95,0.19). The design and application of this filter are summarized in Table 2-9.
Table 2-10 shows the results from the inverse filter and least-squares filter quantified. The error made by the least-squares filter is, again, much less than the error made by the truncated inverse filter. However, both filters yield larger erxors for input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) (Table 2 10 ) 2 10 ) 2-10)2-10)210) as compared to errors for wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) (Table 2-8). The reason for this is discussed next.

Minimum Phase

Two input wavelets, wavelet 1 : ( 1 , 1 2 ) 1 : 1 , 1 2 1:(1,-(1)/(2))1:\left(1,-\frac{1}{2}\right)1:(1,12) and wavelet 2 : ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1), were used for numerical analyses of the inverse filter and least-squares inverse filter in this section. The results indicate that the error in converting wavelet 1 to a zero-lag spike is less than the error in converting wavelet 2 (Tables 2-8 and 2-10).
Is this also true when the desired ouput is a delayed spke ( 0 , 1 , 0 ) ( 0 , 1 , 0 ) (0,1,0)(0,1,0)(0,1,0) ? The cumulative energy of the error L L LLL associated with the application of a two-term leastsquares filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b) (Table 2-11) to convert the input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) to a delayed spike ( 0 , 1 , 0 ) ( 0 , 1 , 0 ) (0,1,0)(0,1,0)(0,1,0) is
L = a 2 + [ ( b a 2 ) 1 ] 2 + ( b 2 ) 2 , ( 2 20 ) L = a 2 + b a 2 1 2 + b 2 2 , ( 2 20 ) L=a^(2)+[(b-(a)/(2))-1]^(2)+(-(b)/(2))^(2),quad(2-20)L=a^{2}+\left[\left(b-\frac{a}{2}\right)-1\right]^{2}+\left(-\frac{b}{2}\right)^{2}, \quad(2-20)L=a2+[(ba2)1]2+(b2)2,(220)
Table 2-11. Design and application of a two-term leastsquares inverse filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b).

Filter Design

Convolution of filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b) with input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) :
Table 2-12. Error in least-squares filtering.
Input Wavelet: ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12)
Desired Output Actual Output
Error
Energy
Error Energy| Error | | :---: | | Energy |
( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0) ( 0.95 , 0.09 , 0.19 ) ( 0.95 , 0.09 , 0.19 ) (0.95,-0.09,-0.19)(0.95,-0.09,-0.19)(0.95,0.09,0.19) 0.048
( 0 , 1 , 0 ) ( 0 , 1 , 0 ) (0,1,0)(0,1,0)(0,1,0) ( 0.09 , 0.81 , 0.38 ) ( 0.09 , 0.81 , 0.38 ) (-0.09,0.81,-0.38)(-0.09,0.81,-0.38)(0.09,0.81,0.38) 0.190
Desired Output Actual Output "Error Energy" (1,0,0) (0.95,-0.09,-0.19) 0.048 (0,1,0) (-0.09,0.81,-0.38) 0.190| Desired Output | Actual Output | Error <br> Energy | | :--- | ---: | :---: | | $(1,0,0)$ | $(0.95,-0.09,-0.19)$ | 0.048 | | $(0,1,0)$ | $(-0.09,0.81,-0.38)$ | 0.190 |
By simplifying equation (2-20), taking the partial derivatives of quantity L L LLL with respect to a a aaa and b b bbb, and setting the results to zero, we obtain
5 2 a b = 1 , ( 2 21 a ) 5 2 a b = 1 , ( 2 21 a ) (5)/(2)a-b=-1,quad(2-21 a)\frac{5}{2} a-b=-1, \quad(2-21 a)52ab=1,(221a)
and
a + 5 2 b = 2 a + 5 2 b = 2 -a+(5)/(2)b=2-a+\frac{5}{2} b=2a+52b=2
Combine equations (2-21a,b) into a matrix form
( 5 / 2 1 1 5 / 2 ) ( a b ) = ( 1 2 ) 5 / 2 1 1 5 / 2 a b = 1 2 ([5//2,-1],[-1,5//2])([a],[b])=([-1],[2])\left(\begin{array}{cc} 5 / 2 & -1 \\ -1 & 5 / 2 \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{c} -1 \\ 2 \end{array}\right)(5/2115/2)(ab)=(12)
By solving for the filter coefficients, we obtain ( a , b ) ( a , b ) (a,b)(a, b)(a,b) : ( 0.09 , 0.76 ) : ( 0.09 , 0.76 ) :(-0.09,0.76):(-0.09,0.76):(0.09,0.76). The design and application of this filter are summarized in Table 2-11.
Table 2-12 shows the results of the least-sqaures filtering to convert the input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) to zerolag (Table 2-7) and delayed spikes (Table 2-11). Note
Table 2-13. Design and application of a two-term leastsquares inverse filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b).

Filter Design

Convolution of filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b) with input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) :
1 Actual Output
Desired
Output
1 Actual Output Desired Output | | | | | :--- | :--- | :--- | | | 1 | Actual Output | | Desired | | | | Output | | |
Filter Application
Least-Squares Filter ( 0.76 , 0.09 ) ( 0.76 , 0.09 ) (0.76,-0.09)(0.76,-0.09)(0.76,0.09)
Input Wavelet ( 0.5 , 1 ) ( 0.5 , 1 ) (-0.5,1)(-0.5,1)(0.5,1)
Actual Output ( 0.38 , 0.81 , 0.09 ) ( 0.38 , 0.81 , 0.09 ) quad(-0.38,0.81,-0.09)\quad(-0.38,0.81,-0.09)(0.38,0.81,0.09)
Desired Output ( 0 , 1 , 0 ) ( 0 , 1 , 0 ) (0,1,0)(0,1,0)(0,1,0)
that the input wavelet is converted to a zero-lag spike with less error, and the corresponding actual output more closely resembles a zero-lag spike desired output.
We now examine the performance of the leastsquares filter with the input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1). The cumulative energy of the error L L LLL associated with the application of a two-term least-squares filter ( a , b ) ( a , b ) (a,b)(a, b)(a,b) (Table 2-13) to convert the input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) to a delayed spike ( 0 , 1 , 0 ) ( 0 , 1 , 0 ) (0,1,0)(0,1,0)(0,1,0) is
L = ( a 2 ) 2 + [ ( b 2 + a ) 1 ] 2 + b 2 L = a 2 2 + b 2 + a 1 2 + b 2 L=(-(a)/(2))^(2)+[(-(b)/(2)+a)-1]^(2)+b^(2)L=\left(-\frac{a}{2}\right)^{2}+\left[\left(-\frac{b}{2}+a\right)-1\right]^{2}+b^{2}L=(a2)2+[(b2+a)1]2+b2
By simplifying equation (2-23), taking the partial derivatives of quantity L L LLL with respect to a a aaa and b b bbb, and setting the results to zero, we obtain
5 2 a b = 2 5 2 a b = 2 (5)/(2)a-b=2\frac{5}{2} a-b=252ab=2
and
a + 5 2 b = 1 a + 5 2 b = 1 -a+(5)/(2)b=-1-a+\frac{5}{2} b=-1a+52b=1
Combine equations (2-24a,b) into a matrix form
( 5 / 2 1 1 5 / 2 ) ( a b ) = ( 2 1 ) 5 / 2 1 1 5 / 2 a b = 2 1 ([5//2,-1],[-1,5//2])([a],[b])=([2],[-1])\left(\begin{array}{cc} 5 / 2 & -1 \\ -1 & 5 / 2 \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{c} 2 \\ -1 \end{array}\right)(5/2115/2)(ab)=(21)
By solving for the filter coefficients, we obtain ( a , b ) ( a , b ) (a,b)(a, b)(a,b) : ( 0.76 , 0.09 ) : ( 0.76 , 0.09 ) :(0.76,-0.09):(0.76,-0.09):(0.76,0.09). The design and application of this filter are summarized in Table 2-13.
Table 2-14 shows the results of the least-squares filtering to convert the input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) to zerolag (Table 2-9) and delayed spikes (Table 2-13). Note that the input wavelet is converted to a delayed spike with less error, and the corresponding actual output more closely resembles a delayed spike desired output.
Table 2-14. Error in least-squares filtering.
Input Wavelet: ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1)
Desired Output Actual Output Error Energy
( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0) ( 0.24 , 0.38 , 0.19 ) ( 0.24 , 0.38 , 0.19 ) (0.24,-0.38,0.19)(0.24,-0.38,0.19)(0.24,0.38,0.19) 0.762
( 0 , 1 , 0 ) ( 0 , 1 , 0 ) (0,1,0)(0,1,0)(0,1,0) ( 0.38 , 0.81 , 0.09 ) ( 0.38 , 0.81 , 0.09 ) (-0.38,0.81,-0.09)(-0.38,0.81,-0.09)(0.38,0.81,0.09) 0.190
(1,0,0) (0.24,-0.38,0.19) 0.762 (0,1,0) (-0.38,0.81,-0.09) 0.190| $(1,0,0)$ | $(0.24,-0.38,0.19)$ | 0.762 | | :--- | :--- | :--- | | $(0,1,0)$ | $(-0.38,0.81,-0.09)$ | 0.190 |
Now, evaluate the results of the least-squares inverse filtering summarized in Tables 2-12 and 2-14. Wavelet 1 : ( 1 , 1 2 ) 1 : 1 , 1 2 1:(1,-(1)/(2))1:\left(1,-\frac{1}{2}\right)1:(1,12) is closer to being a zero-delay spike ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0) than wavelet 2 : ( 1 2 , 1 ) 2 : 1 2 , 1 2:(-(1)/(2),1)2:\left(-\frac{1}{2}, 1\right)2:(12,1). On the other hand, wavelet 2 is closer to being a delayed spike ( 0 , 1 , 0 ) ( 0 , 1 , 0 ) (0,1,0)(0,1,0)(0,1,0) than wavelet 1 . We conclude that the error is reduced if the desired output closely resembles the energy distribution in the input series. Wavelet 1 has more energy at the onset, while wavelet 2 has more energy concentrated at the end.
Figure 2.2-2 shows three wavelets with the same amplitude spectrum, but with different phase-lag spectra. As a result, their shapes differ. (From Section 1.1, we know that the shape of a wavelet can be altered by changing the phase spectrum without modifying the amplitude spectrum.) The wavelet on top has more energy concentrated at the onset, the wavelet in the middle has its energy concentrated at the center, and the wavelet at the bottom has most of its energy concentrated at the end.
We say that a wavelet is mentmum phase if its en* ergy is maximally concentrated at its onset. Similarly, a wavelet is maximum phase if its energy is maximally concentrated at its end. Finally, in all in-between situations, the wavelet is mared phase. Note that a wavelet is defined as a transient waveform with a finite duration it is realaxable. A minimum-phase wavelet is one-sided - it is zero before t = 0 t = 0 t=0t=0t=0. A wavelet that is zero for t < 0 t < 0 t < 0t<0t<0 is called causal. These definitions are consistent with intuition - physical systems respond to an excitation only after that excitation. Their response also is of finite duration. In summary, a mannmum-phase wavelet is realizable and causal.
These observations are quantified by considering the following four, three-point wavelets (Robinson, 1966):
Wavelet A : ( 4 , 0 , 1 ) A : ( 4 , 0 , 1 ) A:(4,0,-1)A:(4,0,-1)A:(4,0,1)
Wavelet B : ( 2 , 3 , 2 ) B : ( 2 , 3 , 2 ) B:(2,3,-2)B:(2,3,-2)B:(2,3,2)
Wevelet C : ( 2 , 3 , 2 ) C : ( 2 , 3 , 2 ) C:(-2,3,2)C:(-2,3,2)C:(2,3,2)
Wavelet D : ( 1 , 0 , 4 ) D : ( 1 , 0 , 4 ) D:(-1,0,4)D:(-1,0,4)D:(1,0,4)
FIG. 2.2-2. A wavelet has a finite duration. If its energy is maximally front-losded, then it is minimum-phase (top). If its energy is concentrated mostly in the middle, then it is mxed-phase (middle). Finally, if its energy is maximally cnd-loaded, then the wavelet is maximum-phase. A quantitative analysis of this phase concept is provided in Figure 22 3 22 3 22-322-3223.
Compute the cumulative energy of each wavelet at any one time. Cumulative energy is computed by adding squared amplitudes as shown in Table 2-15. These values are plotted in Figure 2.2-3. Note that all four wavelets have the same amount of total energy 17 units. Howevcr, the rate at which the energy builds
Table 2-15. Cumulative energy of wavelets A , B , C A , B , C A,B,CA, B, CA,B,C, and D D DDD at time samples 0,1 and 2 .
Wavelet 0 1 2
A A AAA 16 16 17
B B BBB 4 13 17
C C CCC 4 13 17
D D DDD 1 1 17
Wavelet 0 1 2 A 16 16 17 B 4 13 17 C 4 13 17 D 1 1 17| Wavelet | 0 | 1 | 2 | | :---: | ---: | ---: | ---: | | $A$ | 16 | 16 | 17 | | $B$ | 4 | 13 | 17 | | $C$ | 4 | 13 | 17 | | $D$ | 1 | 1 | 17 |
FIG. 2,2-3. A quantitative analysis of the minimum- and maximum-phase concept. The fastest rate of energy build u p u p up\mathrm{up}up in time occurs when the wavelet is minimum-phase (A). The slowest rate occurs when the wavelet is maxmum-phase (D).
up is significantly different for each wavelet. For example, with wavelet A A AAA, the energy builds up rapidly close to its total value at the very first time lag. The energy for wavelets B B BBB and C C CCC builds up relatively slowly. Finally, the energy accumulates at the slowest rate for wavelet D D DDD. From Figure 2.2-3, note that the energy curves for wavelets A A AAA and D D DDD form the upper and lower boundaries. Wavelet A A AAA has the least energy deloy, while wavelet D D DDD has the largest energy delay.
FIG. 2.2-4. All wavelets referred to in Figure 2.2-3 ( A , B A , B A,BA, BA,B, C C CCC, and D D DDD ) have the same smplitude spectrum as shown above (Adapted from Robinson, 1966).
FIG. 2.2-5. Phase-lag spectra of the wavelets referred to 10 Figure 2.2-3. They have the common ampltude spectrum of Figure 2.2-4 (Adapted from Robinson, 1966).
Given a fixed amplitude spectrum as in Figure 2.24 , the wavelet with the least energy delay is called minımum delay, while the wavelet with the most energy delay is called maximum delay. This is the basis for Robinson's energy delay theorem: A A AAA minmum-phase wavelet has the least energy delay.
Time delay is equivalent to a phase-lag. Figure 2.25 shows the phase spectra of the four wavelets. Note that wavelet A A AAA has the least phase change across the frequency axis; we say it is minumum phase. Wavelet D D DDD has the largest phase change; we say it is maxumum phase. Finally, wavelets B B BBB and C C CCC have phase changes between the two extremes; hence, they are mised phase.
Since all four wavelets have the same amplitude spectrum (Figure 2.2-4) and the same power spectrum, they should have the same autocorrelation. This is verified as shown in Table 2-16, where only one side of the autocorrelation is tabulated, since a real time series has a symmetric autocorrelation (Section 1.1).
Note that zero lag of the autocorrelation (Table 216) is equal to the total energy (Table 2-15) contained in each wavelet -17 units. This is true for any wavelet. In fact, Parseval's theorem states that the area under the power spectrum is equal to the zero-lag value of the autocorrelation function (Section A.1).
The process by which the seismic wavelet is compressed to a zero-lag spike is called spiking deconvolution. In this section, filters that achieve this goal were studied - the inverse and the least-squares inverse filters. Their performance depends not only on filter length, but also on whether the input wavelet is minimum phase.
Table 2-16. Autocorrelation lags of wavelets A , B , C A , B , C A,B,CA, B, CA,B,C, and D D DDD.
Wavelet A A AAA
4 0 -1 Output
4 0 -1 17
4 0 -1 0
4 0 -1 -4
4 0 -1 Output 4 0 -1 17 4 0 -1 0 4 0 -1 -4| 4 | 0 | -1 | | | Output | | ---: | ---: | ---: | ---: | ---: | ---: | | 4 | 0 | -1 | | | 17 | | | 4 | 0 | -1 | | 0 | | | | 4 | 0 | -1 | -4 |
Wavelet B B BBB
2 3 -2 Output
2 3 -2 17
2 3 -2 0
2 3 -2 -4
2 3 -2 Output 2 3 -2 17 2 3 -2 0 2 3 -2 -4| 2 | 3 | -2 | | | Output | | ---: | ---: | ---: | ---: | ---: | ---: | | 2 | 3 | -2 | | | 17 | | | 2 | 3 | -2 | | 0 | | | | 2 | 3 | -2 | -4 |
Wavelet C C CCC
-2 3 2 Output
-2 3 2 17
-2 3 2 0
-2 3 2 -4
-2 3 2 Output -2 3 2 17 -2 3 2 0 -2 3 2 -4| -2 | 3 | 2 | | | Output | | ---: | ---: | ---: | ---: | ---: | ---: | | -2 | 3 | 2 | | | 17 | | | -2 | 3 | 2 | | 0 | | | | -2 | 3 | 2 | -4 |
Wavelet D D DDD
-1 0 4 Output
-1 0 4 17
-1 0 4 0
-1 0 4 -4
-1 0 4 Output -1 0 4 17 -1 0 4 0 -1 0 4 -4| -1 | 0 | 4 | | | Output | | ---: | ---: | ---: | ---: | ---: | ---: | | -1 | 0 | 4 | | | 17 | | | -1 | 0 | 4 | | 0 | | | | -1 | 0 | 4 | -4 |
The spiking deconvolution operator is strictly the inverse of the wavelet. If the wavelet were minimum phase, then we would get a stable inverse, which also is minimum phase. The term stable means that the filter coefficients form a convergent series. Specifically, the coefficients decrease in time (and vanish at t = t = t=oot=\inftyt= ); therefore, the filter has finite energy. This is the case for the wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) with an inverse ( 1 , 1 2 , 1 4 , ) 1 , 1 2 , 1 4 , (1,(1)/(2),(1)/(4),dots)\left(1, \frac{1}{2}, \frac{1}{4}, \ldots\right)(1,12,14,). The inverse is a stable spiking deconvolution filter. On the other hand, if the wavelet were maximum phase, then it does not have a stable inverse. This is the case for the wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1), whose inverse is given by the divergent series ( 2 , 4 , 8 , ) ( 2 , 4 , 8 , ) (-2,-4,-8,dots)(-2,-4,-8, \ldots)(2,4,8,). Finally, a mixed-phase wavelet does not have a stable inverse. This discussion leads us to assumption 7 .
Assumption 7. The seismic wavelet is mininum phase. Therefore, it has a mininurn-phase inverse.
Now, a summary of the implications of the underlying assumptions for deconvolution stated in Sections 2.1 and 2.2 is appropriate.
(a) Assumptions 1, 2, and 3 allow formulating the convolutional model of the 1-D seismogram by equation (2-2).
(b) Assumption 4 eliminates the unknown noise term in equation (2-2a) and reduces it to equation (23a).
(c) Assumption 5 is the basis for deterministic deconvolution - it allows estimation of the earth's reflectivity series directly from the 1-D seismogram described by equation (2-3a).
(d) Assumption 6 is the basis for statistical deconvolution - it allows estimates for the autocorrelogram and amplitude spectrum of the normally unknown wavelet in equation (2-3a) from the known recorded 1 -D seismogram.
(e) Finally, assumption 7 provides a minimum-phase estimate of the phase spectrum of the seismic wavelet from its amplitude spectrum, which is estimated from the recorded seismogram by way of assumption 6 .
Once the amplitude and phase spectra of the seismic wavelet are statistically estimated from the recorded seismogram, its least-squares inverse - spiking deconvolution operator, is computed using optimum Wiener filters (Section 2.3). When applied to the wavelet, the filter converts it to a zero-delay spike. When applied to the seismogram, the filter yields the earth's impulse response (equation 2-4). In Section 2.3, we show that a known wavelet can be converted into a delayed spike even if it is not minimum phase.

2.3 OPTIMUM WIENER FILTERS

Return to the desired output - the zero-delay spike ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0), that was considered when studying inverse and least-square filters (Section 2.2). Rewrite equation (216), whtch we solved to obtain the least-squares inverse fiter, as follows:
2 ( 5 / 4 1 / 2 1 / 2 5 / 4 ) ( a b ) = ( 2 0 ) 2 5 / 4 1 / 2 1 / 2 5 / 4 a b = 2 0 2([5//4,-1//2],[-1//2,5//4])([a],[b])=([2],[0])2\left(\begin{array}{cc} 5 / 4 & -1 / 2 \\ -1 / 2 & 5 / 4 \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{l} 2 \\ 0 \end{array}\right)2(5/41/21/25/4)(ab)=(20)
Divide both sides by 2 to obtain
( 5 / 4 1 / 2 1 / 2 5 / 4 ) ( a b ) = ( 1 0 ) . 5 / 4 1 / 2 1 / 2 5 / 4 a b = 1 0 ([5//4,-1//2],[-1//2,5//4])([a],[b])=([1],[0])". "\left(\begin{array}{cc} 5 / 4 & -1 / 2 \\ -1 / 2 & 5 / 4 \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{l} 1 \\ 0 \end{array}\right) \text {. }(5/41/21/25/4)(ab)=(10)
The autocorrelation of the input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) is shown in Table 2-17. Note that the autocorrelation lags are the same as the first column of the 2 × 2 2 × 2 2xx22 \times 22×2 matrix on the left side of equation (2-27).
Now compute the crosscorrelation of the desired output ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0) with the input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) (Table 2-18). The crosscorrelation lags are the same as the column matrix on the right side of equation (2-27).
Table 2-17. Autocorrelation lags of input wavelet ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12).
1 1 2 1 2 -(1)/(2)-\frac{1}{2}12 Output
1 1 2 1 2 -(1)/(2)-\frac{1}{2}12 5 4 5 4 (5)/(4)\frac{5}{4}54
1 1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 2 1 2 -(1)/(2)-\frac{1}{2}12
1 -(1)/(2) Output 1 -(1)/(2) (5)/(4) 1 -(1)/(2) -(1)/(2)| 1 | $-\frac{1}{2}$ | | Output | | ---: | ---: | ---: | ---: | | 1 | $-\frac{1}{2}$ | $\frac{5}{4}$ | | | | 1 | $-\frac{1}{2}$ | $-\frac{1}{2}$ |
Table 2-18. Crosscorrelation lags of desired output ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0) with input wavelet ( 1 , I 2 ) 1 , I 2 (1,-(I)/(2))\left(1,-\frac{\mathrm{I}}{2}\right)(1,I2).
1 0 0 Output
1 1 2 1 2 -(1)/(2)-\frac{1}{2}12 1
1 1 2 1 2 -(1)/(2)-\frac{1}{2}12 0
1 0 0 Output 1 -(1)/(2) 1 1 -(1)/(2) 0| 1 | 0 | 0 | Output | | ---: | ---: | ---: | ---: | | 1 | $-\frac{1}{2}$ | | 1 | | | 1 | $-\frac{1}{2}$ | 0 |
In general, the elements of the matrix on the left side of equation (2-27) are the lags of the autocorrelation of the input wavelet, while the elements of the column matrix on the right side are the lags of the crosscorrelation of the desired output with the input wavelet.
Now perform similar operations for wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1). By rewriting the matrix equation (2-19), we obtain
2 ( 5 / 4 1 / 2 1 / 2 5 / 4 ) ( a b ) = ( 1 0 ) 2 5 / 4 1 / 2 1 / 2 5 / 4 a b = 1 0 2([5//4,-1//2],[-1//2,5//4])([a],[b])=([-1],[0])2\left(\begin{array}{cc} 5 / 4 & -1 / 2 \\ -1 / 2 & 5 / 4 \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{c} -1 \\ 0 \end{array}\right)2(5/41/21/25/4)(ab)=(10)
Divide both sides by 2 to obtain
( 5 / 4 1 / 2 1 / 2 5 / 4 ) ( a b ) = ( 1 / 2 0 ) 5 / 4 1 / 2 1 / 2 5 / 4 a b = 1 / 2 0 ([5//4,-1//2],[-1//2,5//4])([a],[b])=([-1//2],[0])\left(\begin{array}{cc} 5 / 4 & -1 / 2 \\ -1 / 2 & 5 / 4 \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{c} -1 / 2 \\ 0 \end{array}\right)(5/41/21/25/4)(ab)=(1/20)
The autocorrelation of wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) is given in Table 2-19. The elements of the matrix on the left side of equation (2-29) are the autocorrelation lags of the input wavelet. Note that autocorrelation of wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) is identical to that of wavelet ( 1 , 1 2 1 , 1 2 (1,-(1)/(2):}\left(1,-\frac{1}{2}\right.(1,12 ) (Table 2-17). As discussed in Section 2.2, an important property of a group of wavelets with the same amplitude spectrum is that they also have the same autocorrelation.
The crosscorrelation of the desired output ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0) with input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) is given in Table 2 20 2 20 2-202-20220. Note that the right side of equation (2-29) is the same as the crosscorrelation lags.
Table 2-19. Autocorrelation lags of input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1).
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 Output
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 5 4 5 4 (5)/(4)\frac{5}{4}54
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 1 2 1 2 -(1)/(2)-\frac{1}{2}12
-(1)/(2) 1 Output -(1)/(2) 1 (5)/(4) -(1)/(2) 1 -(1)/(2)| $-\frac{1}{2}$ | 1 | | Output | | :---: | :---: | :---: | :---: | | $-\frac{1}{2}$ | 1 | | $\frac{5}{4}$ | | | $-\frac{1}{2}$ | 1 | $-\frac{1}{2}$ |
Table 2-20. Crosscorrelation lags of desired output ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0) with input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1).
1 0 0 Output
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 1 2 1 2 -(1)/(2)-\frac{1}{2}12
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 0
1 0 0 Output -(1)/(2) 1 -(1)/(2) -(1)/(2) 1 0| 1 | 0 | 0 | Output | | ---: | ---: | ---: | ---: | | $-\frac{1}{2}$ | 1 | $-\frac{1}{2}$ | | | | $-\frac{1}{2}$ | 1 | 0 |
Matrix equations (2-27) and (2-29) were used to derive the least-squares inverse filters (Section 2.2). These filters then were applied to the input wavelets to compress them to zero-lag spike. The matrices on the left in equations (2-27) and (2-29) are made up of the autocorreiation lags of the input wavelets. Additionally, the column matrices on the right are made up of lags of the crosscorrelation of the desired output - a zerolag spike, with the input wavelets. These observations were generalized by Wiener to derive filters that convert the input to any desired output (Robinson and Treitcl, 1980).
The general form of the matrix equation such as equation (2-29) for a filter of length n n nnn is (Section B.5):
( r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r 2 r 2 r 0 r n 3 r n 1 r n 2 r n 3 r 0 ) ( a 0 a 1 a 2 a n 1 ) = ( g 0 g 1 g 2 g n 1 ) r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r 2 r 2 r 0 r n 3 r n 1 r n 2 r n 3 r 0 a 0 a 1 a 2 a n 1 = g 0 g 1 g 2 g n 1 ([r_(0),r_(1),r_(2),cdots,r_(n-1)],[r_(1),r_(0),r_(1),cdots,r_(n-2)],[r_(2),r_(2),r_(0),cdots,r_(n-3)],[vdots,vdots,vdots,ddots,vdots],[r_(n-1),r_(n-2),r_(n-3),cdots,r_(0)])([a_(0)],[a_(1)],[a_(2)],[vdots],[a_(n-1)])=([g_(0)],[g_(1)],[g_(2)],[vdots],[g_(n-1)])\left(\begin{array}{ccccc} r_{0} & r_{1} & r_{2} & \cdots & r_{n-1} \\ r_{1} & r_{0} & r_{1} & \cdots & r_{n-2} \\ r_{2} & r_{2} & r_{0} & \cdots & r_{n-3} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n-1} & r_{n-2} & r_{n-3} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} a_{0} \\ a_{1} \\ a_{2} \\ \vdots \\ a_{n-1} \end{array}\right)=\left(\begin{array}{c} g_{0} \\ g_{1} \\ g_{2} \\ \vdots \\ g_{n-1} \end{array}\right)(r0r1r2rn1r1r0r1rn2r2r2r0rn3rn1rn2rn3r0)(a0a1a2an1)=(g0g1g2gn1)
Here r 1 , a 2 r 1 , a 2 r_(1),a_(2)r_{1}, a_{2}r1,a2, and g t , i = 0 , 1 , 2 , , n 1 g t , i = 0 , 1 , 2 , , n 1 g_(t),i=0,1,2,dots,n-1g_{t}, i=0,1,2, \ldots, n-1gt,i=0,1,2,,n1 are the autocorrelation lags of the input wavelet, the Wiener filter coefficients, and the crosscorrelation lags of the desired output with the input wavelet, respectively.
The optimum Wiener filter ( a 0 , a 1 , a 2 , , a 7 1 ) a 0 , a 1 , a 2 , , a 7 1 (a_(0),a_(1),a_(2),dots,a_(7-1))\left(a_{0}, a_{1}, a_{2}, \ldots, a_{7-1}\right)(a0,a1,a2,,a71) is optimum in that the least-squares error between the actual and desired outputs is minimum. When the desired output is the zero-lag spike ( 1 , 0 , 0 , , 0 ) ( 1 , 0 , 0 , , 0 ) (1,0,0,dots,0)(1,0,0, \ldots, 0)(1,0,0,,0), then the Wiener filter is identical to the least-squares inverse filter. In other words, the least-squares inverse filter really is a special case of the Wiener filter.
The Wiener filter applies to a large class of problems in which any desired output can be considered, not just the zero-lag spike. Five choices for the desired output are:
Type 1: Zero-lag spike,
Type 2: Spike at arbitrary lag,
Type 3: Time-advanced form of input series,
Type 4: Zero-phase wavelet,
Type 5: Any desired arbitrary shape.
These desired output forms will be discussed in the following sections.
The general form of the normal equations (2-30) was arrived at through numerical exampies for the special case where the desired output was a zero-lag spike. Section B. 5 provides a concise mathematical treatment of the optimum Wiener filters. Figure 2.3-1 outlines the design and application of Wiener filter.
Dotermination of the Wiener filter coefficients requires solution of the so-called normal equations (230). From equation (2-30), note that the autocorrelation matrix is symmetric. This special matrix, called the Toeplitz matrix, can be solved by Levinson recursion, a computationally efficient scheme (Section B.6). To do this, compute a two-point filter, derive from it a three-point filter, and so or, until the n-point filter is derived (Clacrbout, 1976). In practice, filtering algorithms based on the optimum Wiener filtcr theory are known as Wiener-Levinson algorithms.

Spiking Deconvolution

The process with type 1 desired output (zero-lag spike) is called spiking deconvolution. Crosscorrelation of the desired spike ( 1 , 0 , 0 , , 0 ) ( 1 , 0 , 0 , , 0 ) (1,0,0,dots,0)(1,0,0, \ldots, 0)(1,0,0,,0) with input wavelet ( x 0 , x 1 , x 2 , , x n 1 ) x 0 , x 1 , x 2 , , x n 1 (x_(0),x_(1),x_(2),dots,x_(n-1))\left(x_{0}, x_{1}, x_{2}, \ldots, x_{n-1}\right)(x0,x1,x2,,xn1) yields the series ( x 0 , 0 , 0 , , 0 ) x 0 , 0 , 0 , , 0 (x_(0),0,0,dots,0)\left(x_{0}, 0,0, \ldots, 0\right)(x0,0,0,,0).
FIG. 2.3-1. A flowchart for Wiener filter design and applcation.
The generalized form of the normal equations (2-30) takes the special form:
( r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r 2 r 1 r 0 r n 3 r n 1 r n 2 r n 3 r 0 ) ( a 0 a 1 a 2 a n 1 ) = ( 1 0 0 0 ) r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r 2 r 1 r 0 r n 3 r n 1 r n 2 r n 3 r 0 a 0 a 1 a 2 a n 1 = 1 0 0 0 ([r_(0),r_(1),r_(2),cdots,r_(n-1)],[r_(1),r_(0),r_(1),cdots,r_(n-2)],[r_(2),r_(1),r_(0),cdots,r_(n-3)],[vdots,vdots,vdots,ddots,vdots],[r_(n-1),r_(n-2),r_(n-3),cdots,r_(0)])([a_(0)],[a_(1)],[a_(2)],[vdots],[a_(n-1)])=([1],[0],[0],[vdots],[0])\left(\begin{array}{ccccc} r_{0} & r_{1} & r_{2} & \cdots & r_{n-1} \\ r_{1} & r_{0} & r_{1} & \cdots & r_{n-2} \\ r_{2} & r_{1} & r_{0} & \cdots & r_{n-3} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n-1} & r_{n-2} & r_{n-3} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} a_{0} \\ a_{1} \\ a_{2} \\ \vdots \\ a_{n-1} \end{array}\right)=\left(\begin{array}{c} 1 \\ 0 \\ 0 \\ \vdots \\ 0 \end{array}\right)(r0r1r2rn1r1r0r1rn2r2r1r0rn3rn1rn2rn3r0)(a0a1a2an1)=(1000)
Equation (2-31) was scaled by ( 1 / x 0 ) 1 / x 0 {:1//x_(0))\left.1 / x_{0}\right)1/x0). The leastsquares inverse filter, which was discussed in Section 2.2, has the same form as the matrix equation (2-31). Therefore, spiking deconvolution is mathematically identical to least-squares inverse filtering. A distinction, however, is made in practice between the two types of filtering. The autocorrelation matrix on the left side of equation (2-31) is computed from the input seismogram (assumption 6) in the case of spiking deconvolution (statistical deconvolution), wheress it is computed directly from the known source wavelet in the case of least-squares inverse filtering (deterministuc deconvolution).
Figure 2.3-2 is a summary of spiking deconvolution based on the Wiener-Levinson algorithm. Frame (a) is the input mixed-phase wavelet. Its amplitude spectrum shown in frame (b) indicates that the wavelet has most of its energy confined to a 10 10 10-10-10 to 50 H z 50 H z 50-Hz50-\mathrm{Hz}50Hz range. The autocorrelation function shown in frame (d) is used in equation (2-31) to compute the spiking deconvolution operator shown in frame (e). The amplitude spectrum of the operator shown in frame (f) is approximately the inverse of the amplitude spectrum of the input wavelet shown in frame (b). (The approximation improves as operator length increases.) This should be expected, since the goal of spiking deconvolution is to flatten the output spectrum. Application of this operator to the input wavelet gives the result shown in frame (k).
Ideally, we would like to get a zero-lag spike, as shown in frame (n). What went wrong? Assumption 7 was violated by the mixed-phase input wavelet shown in frame (a). Frane (h) shows the inverse of the deconvolution operator. This is the minimum-phase equivalent of the input mixed-phase wavelet in frame (a). Both wavelets have the same amplitude spectrum shown in frames (b) and (i), but their phase spectra are significantly different as shown in frames (c) and (j). Since spiking deconvolution is equivalent to least-squares inverse filtcring, the minimum-phase equivalent is merely the inverse of the deconvolution operator. Therefore, the amplitude spectrum of the operator is the inverse of the amplitude spectrum of the minimum-phase equivalent as shown in frames (f) and (i), and the phase spectrum of the operator is the negative of the phase spectrum of the minimum-phase wavelet as shown in frames (g) and (j). One way to extract the seismic wavelet, provided it is minimum phase, is to compute the spiking deconvolution operator and find its inverse.
In conclusion, if the input wavelet is not minimum phase, then spiking deconvolution cannot convert it to a perfect zero-lag spike as in frame (k). Although the amplitude spectrun is virtually flat as shown in frame (l), the phase spectrum of the output is not minimum phase as shown in frame (m). Finally, note that the spiking deconvolution operator is the inverse of the minimumphase equivalent of the input wavelet. This wavelet may or may not be minimum phase.

Prewhitening

From the preceding section, we know that the amplitude spectrum of the spiking deconvolution operator is (approximately) the inverse of the amplitude spectrum of the input wavelet. This is sketched in Figure 2.3-3. What if we had zeroes in the amplitude spectrum of the input wavelet? To study this, apply a minimum-phase band-pass filter (Exercise 2-10) with a wide passband ( 3 108 H z ) ( 3 108 H z ) (3-108Hz)(3-108 \mathrm{~Hz})(3108 Hz) to the minimum-phase wavelet of Figure 2.3-2, as shown in frame (h). Deconvolution of the filtered wavelet does not produce a perfect spike; instead, a spike accompanied by a high-frequency pre-and postcursor results (Figure 2.3-4). This poor result occurs because the deconvolution operator tries to boost the absent frequencies, as seen from the amplitude spectrum of the output. Can this problem occur in a recorded seismogram? Situations in which the input amplitude spectrum has zeroes rarely occur. There is always noise in the seismogram and it is additive in both the time and frequency domains. Moreover, numerical noise, which also is additive in the frequency domain, is generated during processing. However, to ensure numerical stability, an artificial level of whate nonse is added to the amplitude spectrum of the input seismogram before deconvolution. This is called prewhetenng and is referred to in Figure 2.3-3.
If the percent prewhitening is given by a scalar, 0 0 0 <=0 \leq0 ϵ < 1 ϵ < 1 epsilon < 1\epsilon<1ϵ<1, then the normal equations (2-31) are modified as follows:
( β r 0 r 1 r 2 r n 1 r 1 β r 0 r 1 r n 2 r 2 r 1 β r 0 r n 3 r n 1 r n 2 r n 3 β r 0 ) ( a 0 a 1 a 2 a n 1 ) = ( 1 0 0 0 ) , β r 0 r 1 r 2 r n 1 r 1 β r 0 r 1 r n 2 r 2 r 1 β r 0 r n 3 r n 1 r n 2 r n 3 β r 0 a 0 a 1 a 2 a n 1 = 1 0 0 0 , ([betar_(0),r_(1),r_(2),cdots,r_(n-1)],[r_(1),betar_(0),r_(1),cdots,r_(n-2)],[r_(2),r_(1),betar_(0),cdots,r_(n-3)],[vdots,vdots,vdots,ddots,vdots],[r_(n-1),r_(n-2),r_(n-3),cdots,betar_(0)])([a_(0)],[a_(1)],[a_(2)],[vdots],[a_(n-1)])=([1],[0],[0],[vdots],[0]),\left(\begin{array}{ccccc} \beta r_{0} & r_{1} & r_{2} & \cdots & r_{n-1} \\ r_{1} & \beta r_{0} & r_{1} & \cdots & r_{n-2} \\ r_{2} & r_{1} & \beta r_{0} & \cdots & r_{n-3} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n-1} & r_{n-2} & r_{n-3} & \cdots & \beta r_{0} \end{array}\right)\left(\begin{array}{c} a_{0} \\ a_{1} \\ a_{2} \\ \vdots \\ a_{n-1} \end{array}\right)=\left(\begin{array}{c} 1 \\ 0 \\ 0 \\ \vdots \\ 0 \end{array}\right),(βr0r1r2rn1r1βr0r1rn2r2r1βr0rn3rn1rn2rn3βr0)(a0a1a2an1)=(1000),
(a)
(b)
(c)
FIG. 2.3-3. Prewhitening amounts to adding a bias to the amplitude spectrum of the seismogram to be deconvolved. This prevents dividing by zero since the amplitude spectrum of the inverse filter (middle) is the inverse of that of the seismogram (left). Convolution of the filter with the seismogram is equivalent to multiplying their respective amplitude spectra - this yields nearly a white spectrum (right).
where β = 1 + ε β = 1 + ε beta=1+epsi\beta=1+\varepsilonβ=1+ε. Adding a constant ε r 0 ε r 0 epsir_(0)\varepsilon r_{0}εr0 to the zero lag of the autocorrelation function is the same as adding white noise to the spectrum, with its total energy equal to that constant. The effect of the prewhitening level on performance of deconvolution is discussed in Section 2.4 .

Wavelet Processing by Shaping Filters

Spiking deconvolution had trouble compressing wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) to a zero-lag spike ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0) (Table 2-14). In terms of energy distribution, this input wevelet is more similar to a delayed spike, such as ( 0 , 1 , 0 ) ( 0 , 1 , 0 ) (0,1,0)(0,1,0)(0,1,0), than it is to a zero-lag spike, ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0). Therefore, is filter that converts wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) to a delayed spike would yield less error than the filter that shapes it to a zero-lag spike (Table 2-14).
Recast the filter design and application outlined in Table 2-13 in terms of optimum Wiener filters by following the flowchart in Figure 2.3-1. First, compute the crosscorrelation (Table 2-21). From Table 2-19, we know the autocorrelation of the input wavelet. By substituting the results from Tables 2-19 and 2-21 into the matrix equation (2-30), we get
( 5 / 4 1 / 2 1 / 2 5 / 4 ) ( a b ) = ( 1 1 / 2 ) 5 / 4 1 / 2 1 / 2 5 / 4 a b = 1 1 / 2 ([5//4,-1//2],[-1//2,5//4])([a],[b])=([1],[-1//2])\left(\begin{array}{cc} 5 / 4 & -1 / 2 \\ -1 / 2 & 5 / 4 \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{c} 1 \\ -1 / 2 \end{array}\right)(5/41/21/25/4)(ab)=(11/2)
By solving for the filter coefficients, we obtain ( a , b ) ( a , b ) (a,b)(a, b)(a,b) : ( 16 21 , 2 21 ) 16 21 , 2 21 ((16)/(21),-(2)/(21))\left(\frac{16}{21},-\frac{2}{21}\right)(1621,221). This filter is applied to the input wavelet as shown in Table 2-22. As we would expect, the output is the same as that of the least-squares filter (Table 2-13). Note that, from Table 2-14, the energy of the leastsquares error between the actual and desired outputs was 0.190 and 0.762 for a delayed spike and a zerolag spike desired output, respectively. This shows that there is less error when converting wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) to the delayed spike ( 0 , 1 , 0 ) ( 0 , 1 , 0 ) (0,1,0)(0,1,0)(0,1,0) than to zero-lag spike ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) (1,0,0)(1,0,0)(1,0,0).
In general, for any given input wavelet, a series of desired outputs can be defined as delayed spikes. The least-squares errors then can be plotted as a function of delay. The delay (lag) that corresponds to the least error is chosen to define the desired delayed spike output. The actual output from the Wiener filter using this optimum delayed spike should be the most compact possible result.
Table 2-21. Crosscorrelation lags of desired output ( 0 , 1 , 0 ) ( 0 , 1 , 0 ) (0,1,0)(0,1,0)(0,1,0) with input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1).
0 1 0 Output
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 1
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 1 2 1 2 -(1)/(2)-\frac{1}{2}12
0 1 0 Output -(1)/(2) 1 1 -(1)/(2) 1 -(1)/(2)| 0 | 1 | 0 | Output | | ---: | ---: | ---: | ---: | | $-\frac{1}{2}$ | 1 | 1 | | | | $-\frac{1}{2}$ | 1 | $-\frac{1}{2}$ |
Table 2-22. Convolution of input wavelet ( 1 2 , 1 ) 1 2 , 1 (-(1)/(2),1)\left(-\frac{1}{2}, 1\right)(12,1) with filter coefficients ( 16 21 , 2 21 ) 16 21 , 2 21 ((16)/(21),-(2)/(21))\left(\frac{16}{21},-\frac{2}{21}\right)(1621,221).
1 2 1 2 -(1)/(2)-\frac{1}{2}12 1 Output
2 21 2 21 -(2)/(21)-\frac{2}{21}221 16 21 16 21 -(16)/(21)-\frac{16}{21}1621 -0.38
2 21 2 21 -(2)/(21)-\frac{2}{21}221 16 21 16 21 -(16)/(21)-\frac{16}{21}1621 0.81
2 21 2 21 -(2)/(21)-\frac{2}{21}221 16 21 16 21 -(16)/(21)-\frac{16}{21}1621 -0.09
-(1)/(2) 1 Output -(2)/(21) -(16)/(21) -0.38 -(2)/(21) -(16)/(21) 0.81 -(2)/(21) -(16)/(21) -0.09| | $-\frac{1}{2}$ | 1 | | Output | | :---: | :---: | :---: | :---: | :---: | | $-\frac{2}{21}$ | $-\frac{16}{21}$ | | | -0.38 | | | $-\frac{2}{21}$ | $-\frac{16}{21}$ | | 0.81 | | | | $-\frac{2}{21}$ | $-\frac{16}{21}$ | -0.09 |

Autocorrelograms

Amplitude Spectra
FIG. 2.3-4. (a) Minimum-phase wavelet, (b) after band-pass filtering, (c) followed by deconvolution. The amplitude spectrum of the band-pass filtered wavelet is zero above 108 H z 108 H z 108Hz108 \mathrm{~Hz}108 Hz (middle row); therefore, the inverse filter derived from it ylelds unstable results (bottom row). The time delays on the wavelets in the left frames of the middle and bottom rows are for display purposes only.
The process that has a type 5 desired output (any desired arbitrary shape) is called wavelet shaping. The filter that does this is called a Wiener shaping filter. In fact, type 2 (delayed spike) and type 4 (zero-phase wavelet) desired outputs are special cases of the more general wavelet shaping.
Figure 2.3-5 shows a series of wavelet shapings that use delayed spikes as desired outputs. The input is a mixed-phase wavelet. Filter length was held constant in all eight cases. Note that the zero-delay spike case (spiking deconvolution) does not always yield the best result (Figure 2.3-5a). A delay in the neighborhood of 60 ms (Figure 2.3-5e) seems to yield an output that is closest to being a perfect spike. Typically, the process is not very sensitive to the amount of delay once it is close to the optimum delay, If the input wavelet were minimum-phase, then the optimum delay of the desired output spike generally is zero. On the other hand, if the input wavelet were mixed-phase, as illustrated in Figure 2.3-5, then the optimum delay is nonzero. Finally, if the input wavelet were maximum-phase, then the optimum delay is the length of that wavelet (Robinson and Treitel, 1980).
Can we not delay the desired spike output (Figure 2.3-5) and obtain a better result than we obtained from spiking deconvolution? This goal is achieved by applying a constant-time shift ( 60 m s 60 m s 60ms60 \mathrm{~ms}60 ms in Figure 2.3-5) to a delayed spike result. Better yet, the same result can be obtained by shifting the shaping filter operator as much as the delay in the spike and applying it to the input wavelet. Such a filter operator is two-sided (noncausal), since it has coefficients for negative and positive time values. The one-sided filter defined along the positive time axis has an anticzpation component, while the filter defined along the negative time axis has a memory component (Rohinson and Treitel, 1980). The twosided filter has an anticipation component and a memory component. Figure 2.3-6 shows a series of shaping filterings with two-sided Wiener filters for various spike delay values.
FIG. 2.3-5. Shaping filterıng. (0) Input wavelet, (1) desired output, (2) shaping filter operator, (3) actual output. Here, the purpose is to convert the mixed-phased wavelet (0) to a series of delayed spikes as shown in (a) through (h) by using a one-sided operator (anticipation component only). The best result is with a 60 m s 60 m s 60-ms60-\mathrm{ms}60ms delay (e).
Figure 2.3-7 shows examples of wavelet shaping. The input wavelet represented by trace (b) is the same mixed-phase wavelet as in Figure 2.3-6 (top left frame). This wavelet is shaped into zero-phese wavelets with three different bandwidths represented by traces (c), (d) and (e). This process commonly is referred to as dephasing. Figure 2.3-7 shows another wavelet shaping in which the input wavelet is converted to its minimumphase equivalent represented by trace (f). This conversion is often applied to recorded air-gun signatures.
Figure 2.3-8 shows examples of a recorded airgun signature that was shaped into its minimum-phase equivalent and into a spike. When the input is the recorded signature, then the wavelet shapings in Figure 2,3-8 are called signature processing.
Wavelet shaping requires knowledge of the input wavelet to compute the crosscorrelation column on the right side of equation (2-30). If it is unknown, which is the case in reality, then the minimum-phase equivalent of the input wavelet can be estimated statistically from the data. This minimurn-phase estimate then is shaped to a zero-phase wavelet.
FIG. 2.3-6. Shaping filtering. (0) Input wavelet, (1) desired output, (2) sheping filter operator, (3) actual output. Here, the purpose is to convert the mixed-phase wavelet (0) to a series of delayed spikes as shown in (a) through (h) using a two-sided operator (with mernory and anticipation components). The best result is obtained with a zero-delay spike using a two-sided filter (a),
Wavelet processing is a term that is used with flexibility. The most common mearing refers to estimating (somehow) the basic wavelet embedded in the seismogram, designing a shaping filter to convert the estimated wavelet to a desired form, usually a broad-band zeto-phase wavelet (Figure 2.3-8), and finally, applying the shaping filter to the seismogram. Another type of wavelet processing involves wavelet shaping in which the desired output is the zero-phase wavelet with the same amplitude spectrum os that of the input wavelet (Figure 2.3-9). Note that this type of wavelet processing does not try to flatten the spectrum, but only tries to correct for the phase of the input wavelet, which soraetimes is assumed to be minirnum-phase.

Predictive Deconvolution

The type 3 desired output, a time-advanced form of the input series, suggests a prediction process. Given the input x ( t ) x ( t ) x(t)x(t)x(t), we want to predict its value at some future time ( t + α ) ( t + α ) (t+alpha)(t+\alpha)(t+α), where α α alpha\alphaα is prediction lag. Wiener showed
FIG. 2.3-7. Shaping filtering with various desired outputs. (a) Impulse response, (b) input seismogram. Here, (c), (d) and (e) show three possible desired outputs that are band-limited zero-phase wavelets, whlle (f) shows a desired output that is the minimum-phase equivalent of the input wavelet (b). Finally, (g) and (h) are desired outputs that are band-pass filtered versions of ( f f f\mathrm{f}f ).
that the filter used to estimate x ( t + α ) x ( t + α ) x(t+alpha)x(t+\alpha)x(t+α) can be computed by using a special form of the matrix equation (2-30) (Robinson and Treitel, 1980). Since the desired output x ( t + α ) x ( t + α ) x(t+alpha)x(t+\alpha)x(t+α) is the time-advanced version of the input x ( t ) x ( t ) x(t)x(t)x(t), we need to specialize the right side of equation (2-30) for the prediction problem.
Consider a five-point input time series x ( t ) x ( t ) x(t)x(t)x(t) : ( x 0 , x 1 , x 2 , x 3 , x 4 ) x 0 , x 1 , x 2 , x 3 , x 4 (x_(0),x_(1),x_(2),x_(3),x_(4))\left(x_{0}, x_{1}, x_{2}, x_{3}, x_{4}\right)(x0,x1,x2,x3,x4), and set α = 2 α = 2 alpha=2\alpha=2α=2. The autocorrelation of the input series is cornputed in Table 2-23, and the crosscorrelation between the desired output x ( t + 2 ) x ( t + 2 ) x(t+2)x(t+2)x(t+2) and the input x ( t ) x ( t ) x(t)x(t)x(t) is computed in Table 2-24. Compare the results in Tables 2-23 and 2-24, and note that g i = r i + α g i = r i + α g_(i)=r_(i+alpha)g_{i}=r_{i+\alpha}gi=ri+α for α = 2 α = 2 alpha=2\alpha=2α=2 and i = 0 , 1 , 2 , 3 , 4 i = 0 , 1 , 2 , 3 , 4 i=0,1,2,3,4i=0,1,2,3,4i=0,1,2,3,4.
Equation (2-30), for this special case, is rewritten as follows:
( r 0 r 1 r 2 r 3 r 4 r 1 r 0 r 1 r 2 r 3 r 2 r 1 r 0 r 1 r 2 r 3 r 2 r 1 r 0 r 1 r 4 r 3 r 2 r 1 r 0 ) ( a 0 a 1 a 2 a 3 a 4 ) = ( r 2 r 3 r 4 r 5 r 6 ) . r 0 r 1 r 2 r 3 r 4 r 1 r 0 r 1 r 2 r 3 r 2 r 1 r 0 r 1 r 2 r 3 r 2 r 1 r 0 r 1 r 4 r 3 r 2 r 1 r 0 a 0 a 1 a 2 a 3 a 4 = r 2 r 3 r 4 r 5 r 6 . ([r_(0),r_(1),r_(2),r_(3),r_(4)],[r_(1),r_(0),r_(1),r_(2),r_(3)],[r_(2),r_(1),r_(0),r_(1),r_(2)],[r_(3),r_(2),r_(1),r_(0),r_(1)],[r_(4),r_(3),r_(2),r_(1),r_(0)])([a_(0)],[a_(1)],[a_(2)],[a_(3)],[a_(4)])=([r_(2)],[r_(3)],[r_(4)],[r_(5)],[r_(6)]).\left(\begin{array}{lllll} r_{0} & r_{1} & r_{2} & r_{3} & r_{4} \\ r_{1} & r_{0} & r_{1} & r_{2} & r_{3} \\ r_{2} & r_{1} & r_{0} & r_{1} & r_{2} \\ r_{3} & r_{2} & r_{1} & r_{0} & r_{1} \\ r_{4} & r_{3} & r_{2} & r_{1} & r_{0} \end{array}\right)\left(\begin{array}{l} a_{0} \\ a_{1} \\ a_{2} \\ a_{3} \\ a_{4} \end{array}\right)=\left(\begin{array}{l} r_{2} \\ r_{3} \\ r_{4} \\ r_{5} \\ r_{6} \end{array}\right) .(r0r1r2r3r4r1r0r1r2r3r2r1r0r1r2r3r2r1r0r1r4r3r2r1r0)(a0a1a2a3a4)=(r2r3r4r5r6).
The prediction filter coefficients a ( t ) : ( a 0 , a 1 a ( t ) : a 0 , a 1 a(t):(a_(0),a_(1):}a(t):\left(a_{0}, a_{1}\right.a(t):(a0,a1, a 2 , a 3 , a 4 a 2 , a 3 , a 4 a_(2),a_(3),a_(4)a_{2}, a_{3}, a_{4}a2,a3,a4 ) can be computed from equation (2-34) and applied to the input series x ( t ) : ( x 0 , x 1 , x 2 , x 3 , x 4 ) x ( t ) : x 0 , x 1 , x 2 , x 3 , x 4 x(t):(x_(0),x_(1),x_(2),x_(3),x_(4))x(t):\left(x_{0}, x_{1}, x_{2}, x_{3}, x_{4}\right)x(t):(x0,x1,x2,x3,x4) to compute the actual output y ( t ) : { y 0 , y 1 , y 2 , y 3 , y 4 ) y ( t ) : y 0 , y 1 , y 2 , y 3 , y 4 y(t):{y_(0),y_(1),y_(2),y_(3),y_(4))y(t):\left\{y_{0}, y_{1}, y_{2}, y_{3}, y_{4}\right)y(t):{y0,y1,y2,y3,y4) (Table 2-25). We want to predict the time-advanced form of the input; hence, the actual output is an estimate of the series x ( t + α ) : ( x 2 , x 3 , x 4 ) x ( t + α ) : x 2 , x 3 , x 4 x(t+alpha):(x_(2),x_(3),x_(4))x(t+\alpha):\left(x_{2}, x_{3}, x_{4}\right)x(t+α):(x2,x3,x4), where α = 2 α = 2 alpha=2\alpha=2α=2. The prediction error series e ( t ) = x ( t + α ) y ( t ) : { e 2 , e 3 , e 4 , e 5 , e 6 ) e ( t ) = x ( t + α ) y ( t ) : e 2 , e 3 , e 4 , e 5 , e 6 e(t)=x(t+alpha)-y(t):{e_(2),e_(3),e_(4),e_(5),e_(6))e(t)=x(t+\alpha)-y(t):\left\{e_{2}, e_{3}, e_{4}, e_{5}, e_{6}\right)e(t)=x(t+α)y(t):{e2,e3,e4,e5,e6) is given in Table 2-26.
The results in Table 2-26 suggest that the error series can be obtained more directly by convolving the input series x ( t ) : ( x 0 , x 1 , x 2 , x 3 , x 4 ) x ( t ) : x 0 , x 1 , x 2 , x 3 , x 4 x(t):(x_(0),x_(1),x_(2),x_(3),x_(4))x(t):\left(x_{0}, x_{1}, x_{2}, x_{3}, x_{4}\right)x(t):(x0,x1,x2,x3,x4) with a filter with coefficients ( 1 , 0 , a 0 , a 1 , a 2 , a 3 , a 4 ) 1 , 0 , a 0 , a 1 , a 2 , a 3 , a 4 (1,0,-a_(0),-a_(1),-a_(2),-a_(3),-a_(4))\left(1,0,-a_{0},-a_{1},-a_{2},-a_{3},-a_{4}\right)(1,0,a0,a1,a2,a3,a4) (Table 2-27). The results for ( e 2 , e 3 , e 4 , e 5 , e 6 ) e 2 , e 3 , e 4 , e 5 , e 6 (e_(2),e_(3),e_(4),e_(5),e_(6))\left(e_{2}, e_{3}, e_{4}, e_{5}, e_{6}\right)(e2,e3,e4,e5,e6) are identical (Tables 2-26 and 2-27). Since the series ( a 0 , a 1 , a 2 , a 3 , a 4 ) a 0 , a 1 , a 2 , a 3 , a 4 (a_(0),a_(1),a_(2),a_(3),a_(4))\left(a_{0}, a_{1}, a_{2}, a_{3}, a_{4}\right)(a0,a1,a2,a3,a4) is called the prediction filter, it is natural to call the series ( 1 , 0 , a 0 , a 1 , a 2 , a 3 , a 4 ) 1 , 0 , a 0 , a 1 , a 2 , a 3 , a 4 (1,0,-a_(0),-a_(1),-a_(2),-a_(3),-a_(4))\left(1,0,-a_{0},-a_{1},-a_{2},-a_{3},-a_{4}\right)(1,0,a0,a1,a2,a3,a4) the prediction error filter. When applied to the input series, this filter yields the error series in the prediction process (Table 2-27).
FIG. 2.3-8. Signature processing: (a) Recorded signature, (b) desired output, (c) shaping operator, (d) shaped signature. The desired output is a zero-delay spike (top) and the minimum-phase equivalent of the recorded signature (bottom).
Table 2-23. Autocorrelation lags of input series x ( t ) x ( t ) x(t)x(t)x(t) : ( x 0 , x 1 , x 2 , x 3 , x 4 ) x 0 , x 1 , x 2 , x 3 , x 4 (x_(0),x_(1),x_(2),x_(3),x_(4))\left(x_{0}, x_{1}, x_{2}, x_{3}, x_{4}\right)(x0,x1,x2,x3,x4).
r 0 = x 0 2 + x 1 2 + x 2 2 + x 3 2 + x 4 2 r 1 = x 0 x 1 + x 1 x 2 + x 2 x 3 + x 3 x 4 r 2 = x 0 x 2 + x 1 x 3 + x 2 x 4 r 3 = x 0 x 3 + x 1 x 4 r 4 = x 0 x 4 r 5 = 0 r 6 = 0 r 0 = x 0 2 + x 1 2 + x 2 2 + x 3 2 + x 4 2 r 1 = x 0 x 1 + x 1 x 2 + x 2 x 3 + x 3 x 4 r 2 = x 0 x 2 + x 1 x 3 + x 2 x 4 r 3 = x 0 x 3 + x 1 x 4 r 4 = x 0 x 4 r 5 = 0 r 6 = 0 {:[r_(0)=x_(0)^(2)+x_(1)^(2)+x_(2)^(2)+x_(3)^(2)+x_(4)^(2)],[r_(1)=x_(0)x_(1)+x_(1)x_(2)+x_(2)x_(3)+x_(3)x_(4)],[r_(2)=x_(0)x_(2)+x_(1)x_(3)+x_(2)x_(4)],[r_(3)=x_(0)x_(3)+x_(1)x_(4)],[r_(4)=x_(0)x_(4)],[r_(5)=0],[r_(6)=0]:}\begin{aligned} & r_{0}=x_{0}^{2}+x_{1}^{2}+x_{2}^{2}+x_{3}^{2}+x_{4}^{2} \\ & r_{1}=x_{0} x_{1}+x_{1} x_{2}+x_{2} x_{3}+x_{3} x_{4} \\ & r_{2}=x_{0} x_{2}+x_{1} x_{3}+x_{2} x_{4} \\ & r_{3}=x_{0} x_{3}+x_{1} x_{4} \\ & r_{4}=x_{0} x_{4} \\ & r_{5}=0 \\ & r_{6}=0 \end{aligned}r0=x02+x12+x22+x32+x42r1=x0x1+x1x2+x2x3+x3x4r2=x0x2+x1x3+x2x4r3=x0x3+x1x4r4=x0x4r5=0r6=0
Table 2-24. Crosscorrelation of desired output x ( t + x ( t + x(t+x(t+x(t+ α ) : ( x 2 , x 3 , x 4 ) , α = 2 α ) : x 2 , x 3 , x 4 , α = 2 alpha):(x_(2),x_(3),x_(4)),alpha=2\alpha):\left(x_{2}, x_{3}, x_{4}\right), \alpha=2α):(x2,x3,x4),α=2, with input x ( t ) : ( x 0 , x 1 , x 2 x ( t ) : x 0 , x 1 , x 2 x(t):(x_(0),x_(1),x_(2):}x(t):\left(x_{0}, x_{1}, x_{2}\right.x(t):(x0,x1,x2, x 3 , x 4 ) x 3 , x 4 {:x_(3),x_(4))\left.x_{3}, x_{4}\right)x3,x4).
g 0 = x 0 x 2 + x 1 x 3 + x 2 x 4 g 1 = x 0 x 3 + x 1 x 4 g 2 = x 0 x 4 g 3 = 0 g 4 = 0 g 0 = x 0 x 2 + x 1 x 3 + x 2 x 4 g 1 = x 0 x 3 + x 1 x 4 g 2 = x 0 x 4 g 3 = 0 g 4 = 0 {:[g_(0)=x_(0)x_(2)+x_(1)x_(3)+x_(2)x_(4)],[g_(1)=x_(0)x_(3)+x_(1)x_(4)],[g_(2)=x_(0)x_(4)],[g_(3)=0],[g_(4)=0]:}\begin{aligned} & g_{0}=x_{0} x_{2}+x_{1} x_{3}+x_{2} x_{4} \\ & g_{1}=x_{0} x_{3}+x_{1} x_{4} \\ & g_{2}=x_{0} x_{4} \\ & g_{3}=0 \\ & g_{4}=0 \end{aligned}g0=x0x2+x1x3+x2x4g1=x0x3+x1x4g2=x0x4g3=0g4=0
Table 2-25. Convolution of prediction filter a ( t ) : ( a 0 a ( t ) : a 0 a(t):(a_(0):}a(t):\left(a_{0}\right.a(t):(a0, a 1 , a 2 , a 3 , a 4 ) a 1 , a 2 , a 3 , a 4 {:a_(1),a_(2),a_(3),a_(4))\left.a_{1}, a_{2}, a_{3}, a_{4}\right)a1,a2,a3,a4) with input series x ( t ) : ( x 0 , x 1 , x 2 , x 3 , x 4 ) x ( t ) : x 0 , x 1 , x 2 , x 3 , x 4 x(t):(x_(0),x_(1),x_(2),x_(3),x_(4))x(t):\left(x_{0}, x_{1}, x_{2}, x_{3}, x_{4}\right)x(t):(x0,x1,x2,x3,x4) to compute actual output y ( t ) : ( y 0 , y 1 , y 2 , y 3 , y 4 ) y ( t ) : y 0 , y 1 , y 2 , y 3 , y 4 y(t):(y_(0),y_(1),y_(2),y_(3),y_(4))y(t):\left(y_{0}, y_{1}, y_{2}, y_{3}, y_{4}\right)y(t):(y0,y1,y2,y3,y4).
y 0 = a 0 x 0 y 1 = a 1 x 0 + a 0 x 1 y 2 = a 2 x 0 + a 1 x 1 + a 0 x 2 y 3 = a 3 x 0 + a 2 x 1 + a 1 x 2 + a 0 x 3 y 4 = a 4 x 0 + a 3 x 1 + a 2 x 2 + a 1 x 3 + a 0 x 4 y 0 = a 0 x 0 y 1 = a 1 x 0 + a 0 x 1 y 2 = a 2 x 0 + a 1 x 1 + a 0 x 2 y 3 = a 3 x 0 + a 2 x 1 + a 1 x 2 + a 0 x 3 y 4 = a 4 x 0 + a 3 x 1 + a 2 x 2 + a 1 x 3 + a 0 x 4 {:[y_(0)=a_(0)x_(0)],[y_(1)=a_(1)x_(0)+a_(0)x_(1)],[y_(2)=a_(2)x_(0)+a_(1)x_(1)+a_(0)x_(2)],[y_(3)=a_(3)x_(0)+a_(2)x_(1)+a_(1)x_(2)+a_(0)x_(3)],[y_(4)=a_(4)x_(0)+a_(3)x_(1)+a_(2)x_(2)+a_(1)x_(3)+a_(0)x_(4)]:}\begin{aligned} & y_{0}=a_{0} x_{0} \\ & y_{1}=a_{1} x_{0}+a_{0} x_{1} \\ & y_{2}=a_{2} x_{0}+a_{1} x_{1}+a_{0} x_{2} \\ & y_{3}=a_{3} x_{0}+a_{2} x_{1}+a_{1} x_{2}+a_{0} x_{3} \\ & y_{4}=a_{4} x_{0}+a_{3} x_{1}+a_{2} x_{2}+a_{1} x_{3}+a_{0} x_{4} \end{aligned}y0=a0x0y1=a1x0+a0x1y2=a2x0+a1x1+a0x2y3=a3x0+a2x1+a1x2+a0x3y4=a4x0+a3x1+a2x2+a1x3+a0x4
Table 2-26. The error series e ( t ) = x ( t + α ) y ( t ) e ( t ) = x ( t + α ) y ( t ) e(t)=x(t+alpha)-y(t)e(t)=x(t+\alpha)-y(t)e(t)=x(t+α)y(t) : ( e 2 , e 3 , e 4 , e 5 , e 6 ) , α = 2 e 2 , e 3 , e 4 , e 5 , e 6 , α = 2 (e_(2),e_(3),e_(4),e_(5),e_(6)),alpha=2\left(e_{2}, e_{3}, e_{4}, e_{5}, e_{6}\right), \alpha=2(e2,e3,e4,e5,e6),α=2. For y ( t ) y ( t ) y(t)y(t)y(t), see Table 2-25.
e 2 = x 2 a 0 x 0 e 3 = x 3 a 1 x 0 a 0 x 1 e 4 = x 4 a 2 x 0 a 1 x 1 a 0 x 2 e 5 = 0 a 3 x 0 a 2 x 1 a 1 x 2 a 0 x 3 e 6 = 0 a 4 x 0 a 3 x 1 a 2 x 2 a 1 x 3 a 0 x 4 e 2 = x 2 a 0 x 0 e 3 = x 3 a 1 x 0 a 0 x 1 e 4 = x 4 a 2 x 0 a 1 x 1 a 0 x 2 e 5 = 0 a 3 x 0 a 2 x 1 a 1 x 2 a 0 x 3 e 6 = 0 a 4 x 0 a 3 x 1 a 2 x 2 a 1 x 3 a 0 x 4 {:[e_(2)=x_(2)-a_(0)x_(0)],[e_(3)=x_(3)-a_(1)x_(0)-a_(0)x_(1)],[e_(4)=x_(4)-a_(2)x_(0)-a_(1)x_(1)-a_(0)x_(2)],[e_(5)=0-a_(3)x_(0)-a_(2)x_(1)-a_(1)x_(2)-a_(0)x_(3)],[e_(6)=0-a_(4)x_(0)-a_(3)x_(1)-a_(2)x_(2)-a_(1)x_(3)-a_(0)x_(4)]:}\begin{aligned} & e_{2}=x_{2}-a_{0} x_{0} \\ & e_{3}=x_{3}-a_{1} x_{0}-a_{0} x_{1} \\ & e_{4}=x_{4}-a_{2} x_{0}-a_{1} x_{1}-a_{0} x_{2} \\ & e_{5}=0-a_{3} x_{0}-a_{2} x_{1}-a_{1} x_{2}-a_{0} x_{3} \\ & e_{6}=0-a_{4} x_{0}-a_{3} x_{1}-a_{2} x_{2}-a_{1} x_{3}-a_{0} x_{4} \end{aligned}e2=x2a0x0e3=x3a1x0a0x1e4=x4a2x0a1x1a0x2e5=0a3x0a2x1a1x2a0x3e6=0a4x0a3x1a2x2a1x3a0x4
Table 2-27. Convolution of prediction error filter coefficients ( 1 , 0 , a 0 , a 1 , a 2 , a 3 , a 4 ) 1 , 0 , a 0 , a 1 , a 2 , a 3 , a 4 (1,0,-a_(0),-a_(1),-a_(2),-a_(3),-a_(4))\left(1,0,-a_{0},-a_{1},-a_{2},-a_{3},-a_{4}\right)(1,0,a0,a1,a2,a3,a4) with input series τ ( t ) : ( x 0 , x 1 , x 2 , x 3 , x 4 ) τ ( t ) : x 0 , x 1 , x 2 , x 3 , x 4 tau(t):(x_(0),x_(1),x_(2),x_(3),x_(4))\tau(t):\left(x_{0}, x_{1}, x_{2}, x_{3}, x_{4}\right)τ(t):(x0,x1,x2,x3,x4).
e 0 = x 0 e 1 = x 1 e 2 = x 2 a 0 x 0 e 3 = x 3 a 1 x 0 a 0 x 1 e 4 = x 4 a 2 x 0 a 1 x 1 a 0 x 2 e 5 = 0 a 3 x 0 a 2 x 1 a 1 x 2 a 0 x 3 e 6 = 0 a 4 x 0 a 3 x 1 a 2 x 2 a 1 x 3 a 0 x 4 e 0 = x 0 e 1 = x 1 e 2 = x 2 a 0 x 0 e 3 = x 3 a 1 x 0 a 0 x 1 e 4 = x 4 a 2 x 0 a 1 x 1 a 0 x 2 e 5 = 0 a 3 x 0 a 2 x 1 a 1 x 2 a 0 x 3 e 6 = 0 a 4 x 0 a 3 x 1 a 2 x 2 a 1 x 3 a 0 x 4 {:[e_(0)=x_(0)],[e_(1)=x_(1)],[e_(2)=x_(2)-a_(0)x_(0)],[e_(3)=x_(3)-a_(1)x_(0)-a_(0)x_(1)],[e_(4)=x_(4)-a_(2)x_(0)-a_(1)x_(1)-a_(0)x_(2)],[e_(5)=0-a_(3)x_(0)-a_(2)x_(1)-a_(1)x_(2)-a_(0)x_(3)],[e_(6)=0-a_(4)x_(0)-a_(3)x_(1)-a_(2)x_(2)-a_(1)x_(3)-a_(0)x_(4)]:}\begin{aligned} & e_{0}=x_{0} \\ & e_{1}=x_{1} \\ & e_{2}=x_{2}-a_{0} x_{0} \\ & e_{3}=x_{3}-a_{1} x_{0}-a_{0} x_{1} \\ & e_{4}=x_{4}-a_{2} x_{0}-a_{1} x_{1}-a_{0} x_{2} \\ & e_{5}=0-a_{3} x_{0}-a_{2} x_{1}-a_{1} x_{2}-a_{0} x_{3} \\ & e_{6}=0-a_{4} x_{0}-a_{3} x_{1}-a_{2} x_{2}-a_{1} x_{3}-a_{0} x_{4} \end{aligned}e0=x0e1=x1e2=x2a0x0e3=x3a1x0a0x1e4=x4a2x0a1x1a0x2e5=0a3x0a2x1a1x2a0x3e6=0a4x0a3x1a2x2a1x3a0x4
FIG. 2.3-9. Wavelet processing. An autocorrelogram (a), estimated from the seismic trace, is used after smoothing (b) to compute the spiking deconvolution operator (d). Here (c) is just a onc-sided version of (b). The inverse of the operator (d) is the minimum-phase wavelet (e), which is sometimes assumed to be the basic wavelet contained in the original seismic trace. It is easy to compute its zero-phase equivalent (f) and design a shaping filter (g) that converts the minimum-phase wavelet (e) to the zero-phase wavelet (f). The actual output is (h), which should be compared with (f). The zero-phase equivalent (f) has the same amplitude spectrum as the minimum-phase wavelet (e).
Why place so much emphasis on the error series? Consider the prediction process as it relates to a seismic trace. From the past values of a time series up to time t t ttt, a future value can be predicted at time t + α t + α t+alphat+\alphat+α, where α α alpha\alphaα is the prediction lag. A seismic trace often has a predictable component (multiples) with a periodic rate
FIG. 2.3-10. A flowchart for predictive deconvolution using a prediction filter.
of occurrence. According to assumption 6, anything else, such as primary reflections, is unpredictable.
Some may claim that reflections are predictable as well; this may be the case if deposition is cyclic. However, this type of deposition is not often encountered. While the prediction filter yields the predictable component (the multiples) of a seismic trace, the remaining unpredictable part, the error series, is essentially the reflection series.
Equation (2-34) can be generalized for the case of an n n nnn-long prediction filter and an α α alpha\alphaα-long prediction lag.
( r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r 2 r 1 r 0 r n 3 r n 1 r n 2 r n 3 r 0 ) ( a 0 a 1 a 2 a n 1 ) = ( r α r α + 1 r α + 2 r α + n 1 ) r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r 2 r 1 r 0 r n 3 r n 1 r n 2 r n 3 r 0 a 0 a 1 a 2 a n 1 = r α r α + 1 r α + 2 r α + n 1 ([r_(0),r_(1),r_(2),cdots,r_(n-1)],[r_(1),r_(0),r_(1),cdots,r_(n-2)],[r_(2),r_(1),r_(0),cdots,r_(n-3)],[vdots,vdots,vdots,ddots,vdots],[r_(n-1),r_(n-2),r_(n-3),cdots,r_(0)])([a_(0)],[a_(1)],[a_(2)],[vdots],[a_(n-1)])=([r_(alpha)],[r_(alpha+1)],[r_(alpha+2)],[vdots],[r_(alpha+n-1)])\left(\begin{array}{ccccc} r_{0} & r_{1} & r_{2} & \cdots & r_{n-1} \\ r_{1} & r_{0} & r_{1} & \cdots & r_{n-2} \\ r_{2} & r_{1} & r_{0} & \cdots & r_{n-3} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n-1} & r_{n-2} & r_{n-3} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} a_{0} \\ a_{1} \\ a_{2} \\ \vdots \\ a_{n-1} \end{array}\right)=\left(\begin{array}{c} r_{\alpha} \\ r_{\alpha+1} \\ r_{\alpha+2} \\ \vdots \\ r_{\alpha+n-1} \end{array}\right)(r0r1r2rn1r1r0r1rn2r2r1r0rn3rn1rn2rn3r0)(a0a1a2an1)=(rαrα+1rα+2rα+n1)
Note that design of the prediction filters requires only autocorrelation of the input series.
There are two approaches to predictive deconvolution:
(1) The prediction filter ( a 0 , a 1 , a 2 , , a n 1 ) a 0 , a 1 , a 2 , , a n 1 (a_(0),a_(1),a_(2),dots,a_(n-1))\left(a_{0}, a_{1}, a_{2}, \ldots, a_{n-1}\right)(a0,a1,a2,,an1) may be designed using equation (2-35) and applied on input series as described in Figure 2.3-10.
(2) Alternatively, the prediction error filter ( 1 , 0 , 0 , ( 1 , 0 , 0 , (1,0,0,dots(1,0,0, \ldots(1,0,0,, 0 , a 0 , a 1 , a 2 , , a n 1 0 , a 0 , a 1 , a 2 , , a n 1 0,-a_(0),-a_(1),-a_(2),dots,-a_(n-1)0,-a_{0},-a_{1},-a_{2}, \ldots,-a_{n-1}0,a0,a1,a2,,an1 ) can be designed and convolved with the input series as described in Figure 2.3-11.
Now consider the special case of unit prediction lag, α = 1 α = 1 alpha=1\alpha=1α=1. For n = 5 n = 5 n=5n=5n=5, equation (2-35) takes the following form:
FIG. 2.3-11, A fiowchart for predictive deconvolution using a prediction error filter.
( r 0 r 1 r 2 r 3 r 4 r 1 r 0 r 1 r 2 r 3 r 2 r 1 r 0 r 1 r 2 r 3 r 2 r 1 r 0 r 1 r 4 r 3 r 2 r 1 r 0 ) ( a 0 a 1 a 2 a 3 a 4 ) = ( r 1 r 2 r 3 r 4 r 5 ) ( 2 36 ) r 0 r 1 r 2 r 3 r 4 r 1 r 0 r 1 r 2 r 3 r 2 r 1 r 0 r 1 r 2 r 3 r 2 r 1 r 0 r 1 r 4 r 3 r 2 r 1 r 0 a 0 a 1 a 2 a 3 a 4 = r 1 r 2 r 3 r 4 r 5 ( 2 36 ) ([r_(0),r_(1),r_(2),r_(3),r_(4)],[r_(1),r_(0),r_(1),r_(2),r_(3)],[r_(2),r_(1),r_(0),r_(1),r_(2)],[r_(3),r_(2),r_(1),r_(0),r_(1)],[r_(4),r_(3),r_(2),r_(1),r_(0)])([a_(0)],[a_(1)],[a_(2)],[a_(3)],[a_(4)])=([r_(1)],[r_(2)],[r_(3)],[r_(4)],[r_(5)])*(2-36)\left(\begin{array}{lllll} r_{0} & r_{1} & r_{2} & r_{3} & r_{4} \\ r_{1} & r_{0} & r_{1} & r_{2} & r_{3} \\ r_{2} & r_{1} & r_{0} & r_{1} & r_{2} \\ r_{3} & r_{2} & r_{1} & r_{0} & r_{1} \\ r_{4} & r_{3} & r_{2} & r_{1} & r_{0} \end{array}\right)\left(\begin{array}{l} a_{0} \\ a_{1} \\ a_{2} \\ a_{3} \\ a_{4} \end{array}\right)=\left(\begin{array}{l} r_{1} \\ r_{2} \\ r_{3} \\ r_{4} \\ r_{5} \end{array}\right) \cdot(2-36)(r0r1r2r3r4r1r0r1r2r3r2r1r0r1r2r3r2r1r0r1r4r3r2r1r0)(a0a1a2a3a4)=(r1r2r3r4r5)(236)
By augmenting the right side to the left side, we obtain:
( r 1 r 0 r 1 r 2 r 3 r 4 r 2 r 1 r 0 r 1 r 2 r 3 r 3 r 2 r 1 r 0 r 1 r 2 r 4 r 3 r 2 r 1 r 0 r 1 r 5 r 4 r 3 r 2 r 1 r 0 ) ( 1 a 0 a 1 a 2 a 3 a 4 ) = ( 0 0 0 0 0 0 ) r 1 r 0 r 1 r 2 r 3 r 4 r 2 r 1 r 0 r 1 r 2 r 3 r 3 r 2 r 1 r 0 r 1 r 2 r 4 r 3 r 2 r 1 r 0 r 1 r 5 r 4 r 3 r 2 r 1 r 0 1 a 0 a 1 a 2 a 3 a 4 = 0 0 0 0 0 0 ([-r_(1),r_(0),r_(1),r_(2),r_(3),r_(4)],[-r_(2),r_(1),r_(0),r_(1),r_(2),r_(3)],[-r_(3),r_(2),r_(1),r_(0),r_(1),r_(2)],[-r_(4),r_(3),r_(2),r_(1),r_(0),r_(1)],[-r_(5),r_(4),r_(3),r_(2),r_(1),r_(0)])([1],[a_(0)],[a_(1)],[a_(2)],[a_(3)],[a_(4)])=([0],[0],[0],[0],[0],[0])\left(\begin{array}{llllll} -r_{1} & r_{0} & r_{1} & r_{2} & r_{3} & r_{4} \\ -r_{2} & r_{1} & r_{0} & r_{1} & r_{2} & r_{3} \\ -r_{3} & r_{2} & r_{1} & r_{0} & r_{1} & r_{2} \\ -r_{4} & r_{3} & r_{2} & r_{1} & r_{0} & r_{1} \\ -r_{5} & r_{4} & r_{3} & r_{2} & r_{1} & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ a_{0} \\ a_{1} \\ a_{2} \\ a_{3} \\ a_{4} \end{array}\right)=\left(\begin{array}{l} 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \end{array}\right)(r1r0r1r2r3r4r2r1r0r1r2r3r3r2r1r0r1r2r4r3r2r1r0r1r5r4r3r2r1r0)(1a0a1a2a3a4)=(000000)
Add one row and move the negative sign to the column matrix that represents the filter coefficients to get:
( r 0 r 1 r 2 r 3 r 4 r 5 r 1 r 0 r 1 r 2 r 3 r 4 r 2 r 1 r 0 r 1 r 2 r 3 r 3 r 2 r 1 r 0 r 1 r 2 r 4 r 3 r 2 r 1 r 0 r 1 r 5 r 4 r 3 r 2 r 1 r 0 ) ( 1 a 0 a 1 a 2 a 3 a 4 ) = ( L 0 0 0 0 0 ) . r 0 r 1 r 2 r 3 r 4 r 5 r 1 r 0 r 1 r 2 r 3 r 4 r 2 r 1 r 0 r 1 r 2 r 3 r 3 r 2 r 1 r 0 r 1 r 2 r 4 r 3 r 2 r 1 r 0 r 1 r 5 r 4 r 3 r 2 r 1 r 0 1 a 0 a 1 a 2 a 3 a 4 = L 0 0 0 0 0 . ([r_(0),r_(1),r_(2),r_(3),r_(4),r_(5)],[r_(1),r_(0),r_(1),r_(2),r_(3),r_(4)],[r_(2),r_(1),r_(0),r_(1),r_(2),r_(3)],[r_(3),r_(2),r_(1),r_(0),r_(1),r_(2)],[r_(4),r_(3),r_(2),r_(1),r_(0),r_(1)],[r_(5),r_(4),r_(3),r_(2),r_(1),r_(0)])([1],[-a_(0)],[-a_(1)],[-a_(2)],[-a_(3)],[-a_(4)])=([L],[0],[0],[0],[0],[0]).\left(\begin{array}{llllll} r_{0} & r_{1} & r_{2} & r_{3} & r_{4} & r_{5} \\ r_{1} & r_{0} & r_{1} & r_{2} & r_{3} & r_{4} \\ r_{2} & r_{1} & r_{0} & r_{1} & r_{2} & r_{3} \\ r_{3} & r_{2} & r_{1} & r_{0} & r_{1} & r_{2} \\ r_{4} & r_{3} & r_{2} & r_{1} & r_{0} & r_{1} \\ r_{5} & r_{4} & r_{3} & r_{2} & r_{1} & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ -a_{0} \\ -a_{1} \\ -a_{2} \\ -a_{3} \\ -a_{4} \end{array}\right)=\left(\begin{array}{l} L \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \end{array}\right) .(r0r1r2r3r4r5r1r0r1r2r3r4r2r1r0r1r2r3r3r2r1r0r1r2r4r3r2r1r0r1r5r4r3r2r1r0)(1a0a1a2a3a4)=(L00000).
where L = r 0 r 1 a 0 r 2 a 1 r 3 a 2 r 4 a 3 r 5 a 4 L = r 0 r 1 a 0 r 2 a 1 r 3 a 2 r 4 a 3 r 5 a 4 L=r_(0)-r_(1)a_(0)-r_(2)a_(1)-r_(3)a_(2)-r_(4)a_(3)-r_(5)a_(4)L=r_{0}-r_{1} a_{0}-r_{2} a_{1}-r_{3} a_{2}-r_{4} a_{3}-r_{5} a_{4}L=r0r1a0r2a1r3a2r4a3r5a4. Note that there are six unknowns, ( a 0 , a 1 , a 2 , a 4 , a 5 , L ) a 0 , a 1 , a 2 , a 4 , a 5 , L (a_(0),a_(1),a_(2),a_(4),a_(5),L)\left(a_{0}, a_{1}, a_{2}, a_{4}, a_{5}, L\right)(a0,a1,a2,a4,a5,L), and six equations. Solution of these equations yields the unit-delay prediction error filter ( 1 , a 0 , a 1 1 , a 0 , a 1 (1,-a_(0),-a_(1):}\left(1,-a_{0},-a_{1}\right.(1,a0,a1, a 2 , a 4 , a 5 ) a 2 , a 4 , a 5 {:-a_(2),-a_(4),-a_(5))\left.-a_{2},-a_{4},-a_{5}\right)a2,a4,a5), and the quantity L L L-L-L the error in the filtering process (Section B.5). We can rewrite equation
(2-38) as follows:
( r 0 r 1 r 2 r 3 r 4 r 5 r 1 r 0 r 1 r 2 r 3 r 4 r 2 r 1 r 0 r 1 r 2 r 3 r 3 r 2 r 1 r 0 r 1 r 2 r 4 r 3 r 2 r 1 r 0 r 1 r 5 r 4 r 3 r 2 r 7 r 0 ) ( b 0 b 1 b 2 b 3 b 4 b 5 ) = ( L 0 0 0 0 0 ) . r 0 r 1 r 2 r 3 r 4 r 5 r 1 r 0 r 1 r 2 r 3 r 4 r 2 r 1 r 0 r 1 r 2 r 3 r 3 r 2 r 1 r 0 r 1 r 2 r 4 r 3 r 2 r 1 r 0 r 1 r 5 r 4 r 3 r 2 r 7 r 0 b 0 b 1 b 2 b 3 b 4 b 5 = L 0 0 0 0 0 . ([r_(0),r_(1),r_(2),r_(3),r_(4),r_(5)],[r_(1),r_(0),r_(1),r_(2),r_(3),r_(4)],[r_(2),r_(1),r_(0),r_(1),r_(2),r_(3)],[r_(3),r_(2),r_(1),r_(0),r_(1),r_(2)],[r_(4),r_(3),r_(2),r_(1),r_(0),r_(1)],[r_(5),r_(4),r_(3),r_(2),r_(7),r_(0)])([b_(0)],[b_(1)],[b_(2)],[b_(3)],[b_(4)],[b_(5)])=([L],[0],[0],[0],[0],[0]).\left(\begin{array}{llllll} r_{0} & r_{1} & r_{2} & r_{3} & r_{4} & r_{5} \\ r_{1} & r_{0} & r_{1} & r_{2} & r_{3} & r_{4} \\ r_{2} & r_{1} & r_{0} & r_{1} & r_{2} & r_{3} \\ r_{3} & r_{2} & r_{1} & r_{0} & r_{1} & r_{2} \\ r_{4} & r_{3} & r_{2} & r_{1} & r_{0} & r_{1} \\ r_{5} & r_{4} & r_{3} & r_{2} & r_{7} & r_{0} \end{array}\right)\left(\begin{array}{l} b_{0} \\ b_{1} \\ b_{2} \\ b_{3} \\ b_{4} \\ b_{5} \end{array}\right)=\left(\begin{array}{c} L \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \end{array}\right) .(r0r1r2r3r4r5r1r0r1r2r3r4r2r1r0r1r2r3r3r2r1r0r1r2r4r3r2r1r0r1r5r4r3r2r7r0)(b0b1b2b3b4b5)=(L00000).
where b 0 = 1 , b 1 = a 2 b 0 = 1 , b 1 = a 2 b_(0)=1,b_(1)=-a_(2)b_{0}=1, b_{1}=-a_{2}b0=1,b1=a2, and i = 1 , 2 , 3 , 4 , 5 i = 1 , 2 , 3 , 4 , 5 i=1,2,3,4,5i=1,2,3,4,5i=1,2,3,4,5. This equation has a familiar structure. In fact, except for the scale factor L L LLL, it has the same form as equation (2-31), which yields the coefficients for the least-squares zero-delay inverse filter. This inverse filter is therefore the same as the prediction error filter with unit prediction lag, except for a scale factor. Hence, spiking decorivolution actually is a special case of predictive deconvolution with unit prediction lag.
We now know that predictive deconvolution is a general process that encompasses spiking deconvolution. In general, the following statement can be made: Geven an input wavelet of length ( n + α ) ( n + α ) (n+alpha)(n+\alpha)(n+α), the predrction error filter contracts i t i t iti tit to an α α alpha\alphaα-long wavelet, where α α alpha\alphaα is the prediction lag (Peacock and Treitel, 1969). When α = 1 α = 1 alpha=1\alpha=1α=1, the procedure is called spiking deconvolution.
Figure 2.3-12 interrelates the various filters discussed in this chapter and indicates the kind of process they imply. From Figure 2.3-12, note that Wiener filters can be used to solve a wide range of problems. In particular, predictive deconvolution is an integral part of seismic data processing that is aimed at compressing the seismic wavelet, thereby increasing temporal resolution. In the limit, it can be uscd to spike the sejsmaic wavelet and obtain an estimate for refloctivity.
2.3-12. A flowchart for interrelations between various deconvolution filters.

2.4 PREDICTIVE DECONVOLUTION IN PRACTICE

It now is appropriate to review the implications of the assumptions stated in Sections 2.1 and 2.2 that underlie the process of deconvolution within the context of predictive deconvolution.
(a) Assumptions 1, 2, and 3 arc the basis for the convolutional model of the recorded seismogram (Section 2.1). In practice, deconvolution often yields good results in areas where these three assumptions are not strictly valid.
(b) Assumption 3 can be reluxed in practice by considering a time-variant deconvolution (Section 2.6). In this technique, a seismogram is divided into a number of time gates, typically three or more. Deconvolution operators then are designed from each gate and convolved with data within that gate. Alternatively, time-variant spectral whitening can be used to account for nonstationarity (Section 2.6).
(c) Not much can be done about assumption 4. Howevcr, noise can be minimized in the recording process. Deconvolution operators can be designed using time gates and frequency bands with low noise levels. Poststack deconvolution can be used in an effort to take advantage of the noise reduction inherent in the stacking process
(d) If the source wavelet were minimum-phase and known (assumption 5), then a perfect result could be obtained from deconvolution in the noise-free case as in trace (c) of Figures 2.4-1 and 2.4-2.
(e) If assumption 6 were violated and if the source waveform were not known, then you would have problems as in trace (d) of Figures 2.4-1 and 2.4-2.
(f) The quality of the output from spiking deconvolution is degraded further when the source wavelet is not minimum-phase as in Figures 2.4-3 and 2.4-4; that is, when assumption 7 is violated.
(g) Finally, in addition to violating assumptions 5 and 7 , if there were noise in the data, that is, when assumption 4 is violated, then the result of the deconvolution would be unacceptable as in Figure 2.4-5.
Figures 2.4-1 through 2.4-5 test our confidence in the usefulness of predictive deconvolution. In reality, deconvolution has been applied to billions of seismic traces; most of the time it has yielded satisfactory results. Figures 2.4-1 through 2.4-5 emphasize the critical assumptions that underlie predictive deconvolution. When deconvolution does not work on some data, the most probable reason is that one or more of the above assumptions has been violated. In the remaining part of this section, a series of numerical experiments will be performed to examine the validity of these assumptions. The purpose of these experiments is to gain a basic understanding of deconvolution from a practical point of view.

Operator Length

We start with a single, isolated minimum-phase wavelet as in trace (b) of Figure 2.4-6. Assumptions 1 through 5 are satisfied for this wavelet. The ideal result of spiking deconvolution is a zero-lag spike, as indicated by trace (a). In this and the following numerical analyses, we refer to the autocorrelogram and amplitude spectrum (plotted with linear scale) of the output frora each deconvolution test to better evaluate the results. In Figure 2.4-6 and the following figures, n , α n , α n,alphan, \alphan,α, and ε ε epsi\varepsilonε refer to operator length of the prediction filter, prediction lag, and percent prewhitening, respectively. The length of the prediction error filter then is n + α n + α n+alphan+\alphan+α.
In Figure 2.4-6, prediction lag is unity and equal to the 2 -ms sampling rate, prewhitening is 0 % 0 % 0%0 \%0%, and operator length varies as indicated in the figure. Short operators yield spikes with small-amplitude and relatively high-frequency tails. The 128 -ms-long operator gives an almost perfect spike output. Longer operators whiten the spectrum further, bringing it closer to the spectrum of the impulse response.
The action of spiking deconvolution on the seismogran derived by convolving the minimura-phase wavelet with a sparse-spike series is similar (Figure 2.4-7) to the case of the single isolated wavelet (Figure 2.4-6). Recall that spiking deconvolution besically is inverse filtering where the operator is the least-squares inverse of the seismic wavelet. Therefore, an increasingly better result should be obtained when more and more coefficients are included in the inverse filter.
Now consider the real situation of an unknown source wavelet. Based on assumption 6 , autocorrelation of the input seismogram rather than that of the seismic wavelet is used to design the deconvolution operator. The result of using the trace rather than the wavelet, autocorrelation is shown in Figure 2.4-8. Deconvolution recovers the gross aspects of the spike series, trace (a). However, note that the deconvolved traces have spurious small-amplitude spikes trailing each of the real spikes. We see that increasing operator length does not indefinitely improve the results; on the contrary, roore and more spurious spikes are introduced.
Very short operators produce the same type of noise spikes as in Figures 2.4-7 and 2.4-8. Examine the series of deconvolution tests in Figure 2.4-8 and note that the 94-ms operator does the best job. Compare the autocorrelogram of trace (b) in Figure 2.4-8 with
Autocorrelograms
(d)

Time (s)
Frequency ( H z ( H z (Hz(\mathrm{Hz}(Hz )
2.4-1. (a) Impulse response, (b) seismogram, (c) spiking deconvolution using known, minimum-phase wavelet, (d) deconvolution assuming an unknown, minimum-phase source wavelet. Impulse response (a) is a sparse-spike series. For an unknown source wavelet (in violation of assumption 4), spiking deconvolution yields a less than perfect result (compare (c) and (d)).
Autocorrelograms Amplitude Spectra
(a)
(b)
(c)
(d)
Time (s)
Time (s)
Frequency (Hz)
2.4-2. (a) Impulse response, (b) seismogram, (c) spiking deconvolution using known, minimum-phase source wavelet, (d) deconvolution assuming an unknown, minimum-phase source wavelet. Impulse response (a) is based on a sonic log (Figure 2.1-1a). For the unknown source wavelet (in violation of assumption 4), spiking deconvolution yields a less than perfeci result. (Compare (c) and (d).
2.4-3. (a) Impuise response, (b) seismogram, (c) deconvolution using a known, mixed-phase source wavelet, (d) deconvolution asuming an unknown, mixed-phase source wavelet. Impulse response (a) is a sparse-spike series. For a mixed-phase source wavelet (in violation of essumption 5), spiking deconvolution yields a degraded output (d), even when the wavelet is known (c).

Autocorrelograms
Amplitude Spectra

(a)
(b)
(c)
(d)
Time (s)
Time (s)
Frequency ( H z H z Hz\mathrm{Hz}Hz )
2.4-4. (a) Impulse tesponse, (b) seismogram, (c) deconvolution using a known, mixed-phase source wavelet, (d) deconvolution assuming an unknown, mixed-phase sotrce. Impulse response (a) is based on the sonic log log log\loglog of Figure 2.1-la. For the mixedphase source wavelet (in violation of assumption 5), spiking deconvolution yields a degraded output (d) even when the wavelet is known (c).
(a)
(b)
(c)
Time (s)
Time (s)
Frequency ( H z ( H z (Hz(\mathrm{Hz}(Hz )
2.4-5. (a) Impulse response, (b) seismogram with noise, (c) deconvolution assuming an unknown, mixed-phase source wavelet. Impulse response (a) is based on the sonic log of Figure 2.1-1a. In the presence of random noise (in violation of assumption 3), spiking deconvolution can produce a result with nelation to the earth's reflectivity (compare (a) to (c)),
that of trace (b) in Figure 2.4-6. Note that only the first 100 -ms portion represents the autocorrelation of the source wavelet. This explains why the 94-ms operator worked best; that is, the autocorrelation lags of trace (b) in Figure 2.4-8 beyond 94 m l s 94 m l s 94mls94 \mathrm{mls}94mls do not represent the seismic wavelet.
Consider the seismogram in Figure 2.4-9, where the wavelet is assumed to be unknown. Deconvolution has restored the spikes that correspond to major reflections in the impulse response as in trace (b) with some success. The 64 m s 64 m s 64-ms64-\mathrm{ms}64ms operator is a good choice.
The mixed-phase wavelet in Figure 2.4-10 shows what can happen when assumption 7 is violated. The wavelet in Figure 2.4-6 is the minimum-phase equivalent of the mixed-phase wavelet in Figure 2.4-10. Both wavelets have the same autocorrelograms and amplitude spectra. Hence, the deconvolution operators for both wavelets are identical. Because the minimumphase assumption was violated, deconvolution does not convert the mixed-phase wavelet to a perfect spike. Instead, the deconvolved output is a complicated highfrequency wavelet. Also note that the dominant peak in the output is negative, while the impulse response has a positive spike. This difference in the sign can happen when a mixed-phase wavelet is deconvolved. Increasing the operator length further whitens the spectrum; however, the 128-ms operator yields a result that cannot be improved further by longer operators.
The seismogram obtained from the mixed-phase wavelet and the sparse-spike series (used in the preceding figures) is shown in Figure 2.4 11 2.4 11 2.4-112.4-112.411. The 94 m s 94 m s 94-ms94-\mathrm{ms}94ms operator gives the best result. This also is the case in Figure 2.4-12, where both assumptions 6 and 7 are violated. The situation with the seismogram in Figure 2.4-13 is not very good. The spikes that correspond to major reflections in the impulse response were restored; however, there are some timing errors and polarity reversals. (Compare these results with those in Figure 2.49 for the events between 0.2 and 0.3 s 0.3 s 0.3s0.3 \mathrm{~s}0.3 s and 0.6 and 0.7 s.) The 64-ms operator gives an output that cannot be improved by longer operators.
What kind of operator length should be used for spiking deconvolution? To select an operator length, ideally we want to use the autocorrelation of the unknown seismic wavelet. Fortunately, the autocorrelation of the input seismogram has the characteristics of the wavelet autocorrelation (assumption 6). Therefore, it seems appropriate that we should use part of the autocorrelation obtained from the input seismogram that most resembles the autocorrelation of the unknown seismic wavelet. That part is the first transient zone in the autocorrelation, as seen by comparing the autocorrelations of trace (b) in Figure 2.4-6 and trace (c) in Figure 2.4-9. The autocorrelations of trace (b) in Figure 2.4-10 and trace (c) in Figure 2.4-13 suggest the same principle.

Prediction Lag

So far, we have learned that predictive deconvolution has two uses: (a) spiking deconvolution - the case of wnit prediction lag, and (b) predicting the input
(text continues on p. 198)
2.4-6. Test of operator length for a single, isolated input wavelet, where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) seismogram with minimum-phase source wavelet.
2.4-7. Test of operator length where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) seismogram with known, minimum-phase source wavelet.
2.4-8. Test of operator length where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) seismogram with known, minimum-phase source wavelet.
2.4-9. Test of operator length where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Reflectivity, (b) impulse response, (c) seismogram with unknown, minimum-phase source wavelet.
2.4-10. Test of operator length for a single, isolated input wavelet where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) seismogram with mixed-phase source wavelet.
2.4-11. Test of operator length where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhtening. (a) Impulse response, (b) seismogram with known, mixed-phase source wavelet.

S
0.8
s
0.2
0.2
0.4
0.6
0.4 H z 0.4 H z 0.4Hz0.4 \mathrm{~Hz}0.4 Hz
100200
2.4-12. Test of operator length where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) seismogram with unknown, mixed-phese source wavelet.
0.4
0.6
0.8
s
0.2
0.4 H z 0.4 H z 0.4Hz0.4 \mathrm{~Hz}0.4 Hz
100
2.4-13. Test of operator length where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ϵ = ϵ = epsilon=\epsilon=ϵ= percent prewhitening. (a) Reflectivity, (b) impulse response, (c) seismogram with unknown, mixed-phase source wavelet.
seismogram at a future time defined by the prediction lag. Case (b) is used to predict and attenuate multiples.
Now, the effect of the prediction lag perameter is examined from an interpretive point of view. Consider the single, isolated minimum-phase wavelet in Figure 2.4-14. Here, operator length and percent prewhitening are kept constant, while prediction lag is varied. When prediction lag is equal to the sampling rate, then the result is equivalent to spiking deconvolution. Predictive deconvolution using a prediction lag greater than unity yields a wavelet of finite duration instead of a spike. Given an input wavelet of α + n α + n alpha+n\alpha+nα+n samples, predictive deconvolution using prediction filter with length n n nnn and prediction lag α lag α lag alpha\operatorname{lag} \alphalagα converts this wavelet into another wavelet that is α α alpha\alphaα samples long. The first α α alpha\alphaα lags of the autocorrelation are preserved, while the next n n nnn lags are zeroed out. Additionally, the amplitude spectrum of the output increasingly resembles that of the input wavelet as prediction lag is increased (Figure 2.4-14). At a 94ms prediction lag, predictive deconvolution does nothing to the input wavelet because almost all the lags of its autocorrelation have been left untouched. This experiment has an important practical implication: Under the ideal, noise-free conditions, resolution on the output from predictive deconvolution can be controlled by adjusting the prediction lag. Unit prediction lag implies the highest resolution, while a larger prediction lag implies less than full resolution. However, in reality, these assessments are dictated by the signal-to-noise ratio.
The deconvolved output using a unit prediction lag contains high frequencies; nevertheless, resolution may be degraded if the high-frequency energy is mostly noise, not signal.
In Figure 2.4-14, prediction lags of 8 and 22 m s 22 m s 22ms22 \mathrm{~ms}22 ms correspond to the first and second zero crossings on autocorrelation of the input wavelet, respectively. The first zero crossing produces a spike with some width, while the second zero crossing lag produces a wavelet with a positive and negative lobe.
The relationship between prediction lag and whitening also holds for the sparse-spike series in Figure 2.4-15 and when the input wavelet is unknown (Figure 2.4-16).
The effect of prediction lag on the output from predictive deconvolution of a synthetic seismogram, which was obtained from the sonic log log log\loglog (Figure 2.1-1a), is demonstrated in Figures 2.4-17 and 2.4-18. As the prediction lag is increased, the output spectrum becomes increasingly less broadband. Predictive deconvolution of seismograms constructed from the mixedphase wavelet again demonstrates that output resolution can be controlled by adjusting prediction lag (Figures 2.4-19 through 2.4-23).
If prediction lag is increased, then the output amplitude spectrum becomes increasingly band-limited. The output also can be band-limited by applying a band-pass filter on the spiking deconvolution output.
(text contrnues on p. 203)
2.4-14. Test of prediction lag for a single, isolated input wavelet where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening, (a) Impulse response, (b) seismogram with minimum-phase source wavelet.

s
0.2
0.4
0.6
0.8
s s s\mathbf{s}s
0.2
0.4 H z 0.4 H z 0.4Hz0.4 \mathrm{~Hz}0.4 Hz
100
2.4-15. Test of prediction lag where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) seismogram with known, minimum-phase source wavelet.
2.4-16. Test of prediction lag where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) seismogram with unknown, minimum-phase source wavelet.
2.4-17. Test of prediction lag where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening, (a) Reflectivity, (b) impulse response, (c) seismogram with known minimum-phase source wavelet.
2.4-18. Test of prediction lag where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag lag lag\operatorname{lag}lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Reflectivity, (b) impulse response, (c) seismogram with unknown, minimum-phase source wavelet.
2.4-19. Test of prediction lag for a single, isolated input wavelet where n = n = n=n=n= operator length α = α = alpha=\alpha=α= prediction lag, and ε ε epsi-\varepsilon-ε percent prewhitening. (a) Impulse response, (b) seismogram with mixed-phase source wavelet.
2.4-20. Test of prediction lag where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) seismogram with known, mixed-phase source wavelet.
2.4-21. Test of prediction lag where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitenıng. (a) Impulse response, (b) seismogram with unknown, mixed-phase source wavelet.
2.4-22. Test of prediction lag where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent, prewhitening. (a) Reflectivity, (b) impulse response, (c) seismogram with known, mixed-phase source wavelet.
2.4-23. Test of prediction lag where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Reflectivity, (b) impulse response, (c) seismogram with unknown, mixed-phase source wavelet.
Are these two ways of band-limiting equivalent? Refer to the results from both the minimum- and mixed-phase wavelets in Figures 2.4-14 and 2.4-19, respectively. Note that the output of the 22 -ms prediction lag has an amplitude spectrum that is band-limited to approximately 0 to 100 H z 100 H z 100Hz100 \mathrm{~Hz}100 Hz. However, the spectral shape within this bandwidth is not a boxcar, but rather similar to that of the input wavelet. The boxcar shape would be the case if a band-pass filter (0 to 100 H z 100 H z 100Hz100 \mathrm{~Hz}100 Hz ) were applied to the output of the spiking deconvolution (2-ms prediction lag). Hence, spiking deconvolution followred by band-pass filtering is not equivclent to predictive deconvolution winth a predaction lag greater than unity.
In conclusion, if prediction lag is increased, the output from predictive deconvolution becomes less spiky. This effect can be used to our advantage, since it allows the bandwidth of deconvolved output to be controlled by adjusting the prediction lag. The application of spiking deconvolution to field data is not always desirable, since it boosts high-frequency noise in the data. The most prominent effect of the nomunity prediction lag is suppression of the high-frequency end of the spectrum and preservation of the overall spectral shape of the input data. This effect is seen in Figures 2.4-18 and 2.423 , which correspond to the minimum-and mixed-phase seismic wavelets. If prediction lag is increased further, then the low-frequency end of the spectrum is affected as well, making the output more band-limited.

Percent Prewhitening

The reasons for prewhitening were discussed in Section 2.3. Consider the single, isolated minimum-phase wavelet in Figure 2.4-24. Keep the operator length and prediction lag constant and vary the percent prewhitening. Note that the effect of varying prewhitening is similar to that of varying the prediction lag; that is, the spectrum increasingly becomes less broadband as the percent prewhitening is increased. Compare Figure 2.4-14 with Figure 2.4-24. Note that prewhitening narrows the spectrum without changing much of the flatness character, whale larger prediction lag narrows the spectrum and alters ats shape, making tt look more like the spectrum of the input sermac wavelet. These characteristics also can be inferred from the shapes of the output wavelets. Prewhitening preserves the spiky character of the output, although it adds a low-amplitude, high-frequency tail (Figure 2.4-24). On the other hand, increasing prediction lag produces a wavelet with a duration equal to the prediction lag (Figure 2.4-14).
The effect of prewhitening on the sparse-spike train seismogran with a known and unknown minimumphase wavelet is shown in Figures 2.4-25 and 2.4-26, respectively. The effect of prewhitening on deconvolution of the synthetic seismogram obtained from the sonic log log log\loglog (Figure 2.1-1a) is shown in Figures 2.4-27 and 2.4-28 for known and unknown minimum-phase wavelets. Prewhitening tests using the mixed-phase
2.4-24. Test of percent prewhitening for a single, isolated input wavelet where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) sejsmogram with minimum-phase source wavelet.
2.4-25. Test of percent prewhitening where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) seismogram with known, minimum-phase source wavelet.
2.4-26. Test of percent prewhitening where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) sejsmogram with unknown, minimum-phase source wavelet.
2.4-27. Test of percent prewhitening where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Reflectıvity, (b) impulse response, (c) seismogram with known, minimum-phase source wavelet.
2.4-28. Test of percent prewhitening where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Reflectivity, (b) impulse reaponse, (c) seismogram with unknown, minimum-phase source wavelet.
2.4-29. Test of percent prewhtening for a single, isolated input wavelet where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) sejsmogran with mixed-phase source wavelet.
2.4-30. Test of percent prewhitening for a single, isolated input wavelet where n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening. (a) Impulse response, (b) seismogram with minimum-phase source wavelet.
wavelet are shown in Figure 2.4-29. Finally, the combined effects of a prediction lag that is greater than unity and prewhitening for the single, isolated wavelet are shown in Figure 2.4-30. These figures demonstrate that prewhitening narrows the output spectrum, making it band-limited. In particular, the tests in Figures 2.4-24 and 2.4-29 using the single, isolated minimumand mixed-phase wavelets suggest that spiking deconvolution with some prewhitening is somewhat equivalent to spiking deconvolution without prewhitening followed by post-deconvolution broad band-pass filtering. However, this is not exactly true, for prewhitening still leaves some relatively suppressed energy at the highfrequency end of the spectrum. From Figure 2.4-30, we infer that predictive deconvolution with a prediction lag greater than unity and with some prewhitening yields a result somewhat equivalent to a spiking deconvolution followed by band-pass filtering.
In conclusion, we can say that prewhitening yields a band-limited output. However, the effect is less controllable when compared to varying the prediction lag. By varying prediction lag, we have some idea of the output bandwidth, since it is related to prediction lag. The smaller the prediction lag, the broader the output bandwidth. Prewhitening is used only to ensure that numerical instability in solving for the deconvolution operator (equation 2-32) is avoided. In practice, typically 0.1 to 1 % 1 % 1%1 \%1% prewhitening is standard.

Effect of Random Noise on Deconvolution

We assume that the noise component in the recorded seismogram is zero (assumption 4). The autocorrelation of ideal random noise is zero at all lags except the zero lag (Figure 2.1-5). Therefore, the effect of randon noise on deconvolution operators should be somewhat similar to the effect of prewhitening. Both effects modify the diagonal of the autocorrelation matrix, making it more dominant [equation (2-32)]. However, the noise component also slightly modifies the nonzero lags of the autocorrelation. Compare the autocorrelograms of traces (b) in Figures 2.4-24 and 2.4-31. In Figure 2.4-24, an isolated minimum-phase wavelet was considered, while in Figure 2.4-31, random noise was added to the same wavelet. The output wavelet shape from spiking deconvolution of the noisy wavelet using a 128 m s 128 m s 128-ms128-\mathrm{ms}128ms operator is similar to the output from spiking deconvolution of the wavelet without noise, using the same operator length but with, say, 20 percent prewhitening. This result has practical importance prewhitening is equivalent to adding perfect random noise to the systern. Since a recorded seismogram always contains some amount of random noise, only a minute amount, say 0.1 percent, of the white noise needs to be added to the seismogram for numerical stability.
The effect of random noise on the performance of deconvolution is examined further in Figures 2.432 and 2.4-33. These results should be compared with
2.4-31. Effect of random noise on deconvolution performance. Input seismogram (b) associated with reflectivity (a) contains a single, isolated wavelet (at around 0.2 s 0.2 s 0.2s0.2 \mathrm{~s}0.2 s ) buried in random noise. Here, n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening.
2.4-32. Effect of random noise on deconvolution performance. (a) Reflectivity, (b) impulse response. Input seismogram (c) with unknown, minimum-phase source wavelet is noise contaminated. Here, n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε ε epsi\varepsilonε = = === percent prewhitening.
2.4-33. Effect of random noise on deconvolution performance. (a) Reflectivity, (b) impulse response. Input seismogram (c) with unknown, mixed-phase source wavelet is noise contaminated. Here, n = n = n=n=n= operator length, α = α = alpha=\alpha=α= prediction lag, and ε = ε = epsi=\varepsilon=ε= percent prewhitening
their noiseless counterparts in Figures 2.4-9 and 2.4 13 , respectively. Observe that the noise component has a harmful effect on deconvolution. For example, when comparing Figures 2.4 9 2.4 9 2.4-92.4-92.49 and 2.4 32 2.4 32 2.4-322.4-322.432, note that the deconvolution result from the noisy seismogram has spurous spikes (for instance, between 0.5 and 0.6 s 0.6 s 0.6s0.6 \mathrm{~s}0.6 s ), which could be interpreted as genuine reflections. Noisy field data, which yield better stack when not treated by deconvolution, have been noted. Only by testing can we determine whether deconvolution performs satisfactorily on data with a severe noise problem.

Multiple Attenuation

We have learned that a prediction filter predicts periadic events, like multiples, in the seismogram. The prediction error filter yields the unpredictable component of the seismogram the reflectivity series. For example, consider the simple case of water-bottom multiples. If the reflection coefficient of the water bottom is c w c w c_(w)c_{w}cw and if water depth is equivalent to a two-way time t w t w t_(w)t_{w}tw, then the time series is
( 1 , 0 , , 0 , c w , 0 , , 0 , c w 2 , 0 , , 0 , c w 3 , 0 , ) 1 , 0 , , 0 , c w , 0 , , 0 , c w 2 , 0 , , 0 , c w 3 , 0 , (1,0,dots,0,-c_(w),0,dots,0,c_(w)^(2),0,dots,0,-c_(w)^(3),0,dots)\left(1,0, \ldots, 0,-c_{w}, 0, \ldots, 0, c_{w}^{2}, 0, \ldots, 0,-c_{w}^{3}, 0, \ldots\right)(1,0,,0,cw,0,,0,cw2,0,,0,cw3,0,)
as represented by trace (b) in Figure 2.4-34. The separation between the spikes is t w t w t_(w)t_{w}tw in trace (b). Note that the periodicity in the time series (trace (b) or (c)) manifests itself in the amplitude spectrum as periodic peaks (or notches). The greater the spike separation in time, the closer the peaks (or notches) in the amplitude spectrum.
The noise-free convolutional model for the seismogram that contains the water-bottom multiples can be written as
x ( t ) = w ( t ) m ( t ) e ( t ) x ( t ) = w ( t ) m ( t ) e ( t ) x(t)=w(t)**m(t)**e(t)x(t)=w(t) * m(t) * e(t)x(t)=w(t)m(t)e(t)
where m ( t ) m ( t ) m(t)m(t)m(t) represents the water-layer reverberation spike series as in trace (b) of Figure 2.4-34, and e ( t ) e ( t ) e(t)e(t)e(t) now represents the earth's impulse response excluding multiples associated with the water bottom. Predictive deconvolution can suppress the periodic component m ( t ) m ( t ) m(t)m(t)m(t) in the seismogram as demonstrated by trace (d) in Figure 2.4-3.
Note the two distinct goals for predictive deconvolution: (a) spiking the seismic wavelet w ( t ) w ( t ) w(t)w(t)w(t), and (b) predicting and attenuating multiples m ( t ) m ( t ) m(t)m(t)m(t). The first goal is achieved using an operator with unit prediction lag, while the second is achieved using an operator with a prediction lag greater than unity.
The autocorrelation of the input trace can be used to determine the appropriate prediction lag for multiple suppression. Periodicity associated with multiples is evident in the autocorrelogram of trace (c) in Figure 2.434 , as an isolated series of energy lobes in the neighbor-
2.4-34. (a) Reflectivity, (b) impulse rezponse, (c) seismogram. Two-step deconvolution aimed at attenuating the multiples, then spiking the remaining primary wavelet (d) to (e). The process can be performed in the reverse order (f) to (g). Here, n n nnn = = === operator length and α = α = alpha=\alpha=α= prediction lag.
2.4-35. Predictive deconvolution for multiple attenuation. (a) Reflectivity, (b) impulse response, (c) seismogram. Two-step deconvolution: Predictive deconvolution (d) followed by spiking deconvolution (e). Traces (f), (g), and (h) result when singlestep deconvolution is applied to the input trace (c), using the operator lengths n n nnn and prediction lags α α alpha\alphaα, as indicated.
hood of 0.2 and 0.4 s 0.4 s 0.4s0.4 \mathrm{~s}0.4 s. Prediction lag should be chosen to bypass the first part of the autocorrelogram that represents the seismic wavelet. Operator length should be chosen to include the first isolated energy packet in the autocorrelogram. After applying predictive deconvolution, we are left with only the water-bottom primary reflection. Isolated bursts in the autocorrelogram have been suppressed, while periodic peaks in the amplitude spectrum have been eliminated as shown in trace (d). If desired, the basic wavelet can be compressed into a spike as shown in trace (e) by applying spiking deconvolution to the output of predictive deconvolution as shown in trace (d). The sequence can be interchanged by first applying spiking deconvolution as shown in trace (f) followed by predictive deconvolution as shown in trace (g).
By using a sufficiently long spiking deconvolution operator, two goals are achieved in one step as seen in trace (h). However, this approach can be dangerous if primary reflections are unintentionally suppressed. This is the case in Figure 2.4-35. Here, the water-bottom refection is followed by a deeper event at about 0.28 s s sss as seen in trace (a). The impulse response contains water-bottom multiples and the peg-leg multiples that are associated with the deeper reflector as seen in trace (b). The amplitude spectrum has peaks that come in pairs, indicating the presence of two different periodic components in the seismogram. Careful choice of predictive deconvolution parameters yields an output with only the wavelets associated with the water bottom and the deeper reflector as seen in trace (d). This is followed by a spiking deconvolution that yields two spikes representative of the water bottom and the deep primary as seen in trace (e). Spiking deconvolution alone produces the reflection coefficient series and the spikes that represent the multiples as seen in trace (f). If a longer spiking deconvolution operator is used, then the primary reflection easily can be eliminated as in trace (g). If a predictive deconvolution operator is used with an improper parameter choice, then again, the primary reflection can be eliminated easily as in trace (h).
How can we ensure that no primaries are destroyed by deconvolution? Examine the autocorrelogram of trace (c) in Figure 2-4-35. The first 50-ms portion represents the seismic wavelet. This is followed by a burst between 50 to 170 m s 170 m s 170ms170 \mathrm{~ms}170 ms that represents the correlation of the water bottom and primary. The isolated burst between 170 to 340 mis represents the actual multiple series (both the peg-legs and water-bottom multiples). The prediction lag must be chosen to bypass the first part of the autocorrelogram, which represents the seismic wavelet and possible correlation between the primaries. The operator length must be chosen to include the first isolated burst, in this case between 170 to 340 m s 340 m s 340ms340 \mathrm{~ms}340 ms.
It is only with vertical incidence and zero-offset recording that periodicity of the multiples is preserved. Therefore, predictive deconvolution aimed at multiple suppression may not be entirely effective when applied to nonzero-offset data, such as common-shot or common-midpoint data. Figure 2.4-36a shows a common-shot gather with its autocorrelogram and average amplitude spectrum. The field record is prepared for deconvolution by first applying t 2 t 2 t^(2)t^{2}t2-scaling (Figure 2.4-36b) and muting the first arrivals associated with largely guided waves (Figure 2.4-36c). The autocorrelogram in Figure 2.4-36ic indicates the presence of multiples. Note on the shot record the water-bottom reflection is at 0.4 s 0.4 s 0.4s0.4 \mathrm{~s}0.4 s at near offset. Additionally, there are two strong primary reflectors at 0.6 and 1.4 s 1.4 s 1.4s1.4 \mathrm{~s}1.4 s at near offset; these primaries give rise to a first-order and pegleg multiples. Despite the flatness of the spectrum and the attenuation of nonzero lags of the autocorrelogram after deconvolution, the first-order multiples associated with the water-bottom reflection and the peg-leg multiples associated with the primary reflection at 0.6 s 0.6 s 0.6s0.6 \mathrm{~s}0.6 s still persist in the record (Figures 2.436d). This occurs because these events have large moveout which causes significant departure from periodicity at nonzero offsets. On the other hand, note that the peg-leg multiples associated with the primary reflection at 1.4 s 1.4 s 1.4s1.4 \mathrm{~s}1.4 s have been attenuated significantly by deconvolution. This event has a very small moveout; thus, its perodicity is much preserved.
Predictive deconvolution sometimes is applied to CMP stacked data in an effort to suppress muitiples. The performance of such an approach can be unsatisfactory, because the amplitude relationships between multiples often are grossly altered by the stacking process, primarily because of velocity differences between primaries and multiples. Also, geometric spreading compensation by using primary velocity function adversely affects the amplitudes of multiples on nonzero-offset data.
There is one domain in which the periodicity and amplitudes of multiples are preserved the slant-stack domain. In Section 6.3, the application of predictive deconvolution to data in the slant-stack domain for multiple suppression is discussed.

2.5 FIELD DATA EXAMPLES

The deconvolution parameters now are examined using field data examples. We shall discuss application of sta-
IAr tow gror mint
S
0- 1 - 1 -
(a)
(8) T-senuased comptMsation
(b)

(c)
(d)
2.4-36. (a) A common-shot gather, (b) after t 2 t 2 t^(2)t^{2}t2-scaling and (c) after muting first arrivals which are largely guided waves, and (d) after spiking deconvolution. The amplitude spectra averaged over the shot record are shown at the top and the autocorrelograms are shown at the bottom.
(a)
(b)
(c) (d)
2.5-1. An autocorrelation window test used to design deconvolution operators. The solid bars indicate the window boundaries. The entire 6 -s length was included in (a). The autocorrelograms are displayed beneath the records.
tistical deconvolution to pre- and poststack data. Additionally, we shall discuss application of deterministic deconvolution to marine data to convert the recorded source signature to its minimum-phase equivalent, and to land data recorded using a vibroseis source to convert the autocorrelogram of the sweep signal to its minimumphase equivalent.

Prestack Deconvolution

Figure 2.5-1 shows a CMP gather that contains five prominent refiections at around 1.1 , 1.35 , 1.85 , 2.15 1.1 , 1.35 , 1.85 , 2.15 1.1,1.35,1.85,2.151.1,1.35,1.85,2.151.1,1.35,1.85,2.15, and 3.05 s 3.05 s 3.05s3.05 \mathrm{~s}3.05 s. The gather also contains strong reverberations associated with these reflections. The examination of the deconvolution parameters will begin with an
(a)
(b)
(c)
(d)
(e)
2.5-2. Test of operator length. The corresponding autocorrelogram is beneath each record. The window used in autocorrelation estimation is shown in Figure 2-5-1c. (a) Input gather. Deconvolution using prediction lag = 4 m s = 4 m s =4ms=4 \mathrm{~ms}=4 ms (splking deconvolution), 0.1 % 0.1 % 0.1%0.1 \%0.1% prewhitening, and prediction fiter operator lengths (b) 40 m s 40 m s 40ms40 \mathrm{~ms}40 ms, (c) 80 m s 80 m s 80ms80 \mathrm{~ms}80 ms, (d) 160 m s 160 m s 160ms160 \mathrm{~ms}160 ms, (e) 240 ms.
analysis of the time gate to estimate the autocorrelation function. A first gate selected may be the entire length (6s) of the record as seen in panel (a). The solid lines on the CMP gathers refer to the gate start and end times. The autocorrelogram of the record is shown at the botton of each panel. A second choice might be to exclude the deeper part of the record where ambient noise dominates. The start of the gate is chosen as the first arrival path as shown in panel (b). A third choice may be to exclude not only the deeper portion, but also the early part of the record that contains energy corresponding to the guided waves as shown in panel (c). These waves travel within the water layer and are not part of the signal reflected from the substrata.
(a)
(b)
(c)
(d) (e)
2.5-3. Test of prediction lag. The corresponding autocorrelogram is beneath each record. The window used in autocorrelation estimation is shown in Figure 2.5-1c. (a) Input gather. Deconvolution using prediction filter operator length = 160 m s , 0.1 = 160 m s , 0.1 =160ms,0.1=160 \mathrm{~ms}, 0.1=160 ms,0.1 percent prewhitening, and prediction lags (b) 12 m s 12 m s 12ms12 \mathrm{~ms}12 ms, (c) 32 m s 2 32 m s 2 32ms^(2)32 \mathrm{~ms}^{2}32 ms2 (d) 64 m s 64 m s 64ms64 \mathrm{~ms}64 ms, (e) 128 m s 128 m s 128ms128 \mathrm{~ms}128 ms.
By comparing the autocorrelograms from these different windows, note that the third choice best represents the reverberatory character of the data as shown in panel (c) over most of the offsets. All of the traces in the autocorrelogram within approximately the first 150 m s 150 m s 150ms150 \mathrm{~ms}150 ms have a common appearance. This early portion of the autocorrelogram characterizes the basic seismic wavelet contained in the data.
In general, the autocorrelation window should include part of the record that contains useful reflection signal, and should exclude coherent or incoherent noise. An autocorrelation function contaminated by noise is undesirable since the deconvolution process is most effective on noise-free data (assumption 4).
Another aspect of the autocorrelation window is length. Panel (d) of Figure 2.5-1 shows the autocorrel-
(a)
(b)
(c) (d)
(e)
2.5-4. Test of percent prewhitening, The corresponding autocorrelogram is beneath each record. The window used in autocorrelation estimation is shown in Figure 2.5-1c. (a) Input gather. Deconvolution using prediction filter operator length = 160 m s = 160 m s =160ms=160 \mathrm{~ms}=160 ms, prediction lag = 4 m s = 4 m s =4ms=4 \mathrm{~ms}=4 ms (spiking deconvolution), and percent prewhitening (b) I percent, (c) 4 percent, (d) 16 percent, (e) 32 percent.
ogram estimated from a narrow window. The autocorrelogram estimated from the narrower part of the time gate (the right side of the record) in some data cases may lack the characteristics of the reverberations, and even those of the basic seismic wavelet.
In general, any autocorrelation function is biased; that is, the first lag value is computed from, say, n n nnn nonzero samples, the second lag value is computed from n 1 n 1 n-1n-1n1 nonzero samples, and so on. If n n nnn is not large enough, then there can be an undesirable biasing effect. How large should the data window be to avoid such biasing? If the largest autocorrelation lag used in designing the deconvolution operator were m m mmm, an accepted rule of
2.5-5. (a) A common-shot gather, (b) after muting gulded waves, (c) after t 2 t 2 t^(2)t^{2}t2-scaling, and (d) after spiking deconvolution using an operator length of 320 ms. The amplitude spectra (top) averaged over the shot record, and the autocorrelograms (bottom) are used to to choose deconvolution parameters and evaluate the data after the application of deconvolution.
thumb is that the number of data samples should be no less than 8 m 8 m 8m8 \mathrm{~m}8 m.
Now that the autocorrelation window is determined, we examine operator length. In Figure 2.5-2, prediction lag ( 4 m s 4 m s 4ms4 \mathrm{~ms}4 ms, the same as the sampling rate) and percent prewhitening ( 0.1 % ) ( 0.1 % ) (0.1%)(0.1 \%)(0.1%) are fixed. The autocorrelograms (at the bottom of each gather) are displayed for diagnostic purposes. From the analyses of the single spike, sparse spike, and reflectivity models (Section 2.4), recall that the short ( 40 m s ) 40 m s ) 40-ms)40-\mathrm{ms})40ms) operator leaves some residual energy that corresponds to the basic wavelet and reverberating wavetrain in the record. For a spiking deconvolution with a 160 m s 160 m s 160-ms160-\mathrm{ms}160ms-long operator, no remnant ot the energy is associated with the basc wavelet and reverberations. Any operator longer than 160 m s 160 m s 160ms160 \mathrm{~ms}160 ms does not change the resuit, significantly. From the output of the 160 m s 160 m s 160-ms160-\mathrm{ms}160ms operator, note that the prominent reflections (at 1.1, 1.35, 1.85, and 2.15 s 2.15 s 2.15s2.15 \mathrm{~s}2.15 s at the near-offset) have been uncovered, the seismic wavelet has been compressed, and the reverberations have been significantly suppressed.
The effect of prediction lag now is examined. In Figure 2.5 3 2.5 3 2.5-32.5-32.53, the 160 m s 160 m s 160-ms160-\mathrm{ms}160ms operator length and 0.1 % 0.1 % 0.1%0.1 \%0.1% prewhitening are fixed, while prediction lag is varied. If prediction lag were increased, the deconvolution process would be increasingly less effective in broadening the spectrum, and the autocorrelograrns would contain increasingly more energy at nonzero lags. In the extreme, the deconvolution process is ineffective with a 128 m s 128 m s 128-ms128-\mathrm{ms}128ms prediction lag. In practice, common values for the prediction lag are unity (spiking deconvolution) or the first or second zero crossing of the autocorrelation function (predictive deconvolution).
Finally, the percent of prewhitening is varied, while the 4 -ms prediction lag and 160 m s 160 m s 160-ms160-\mathrm{ms}160ms operator length are fixed. These tests are shown in Figure 2.5-4. By increasing the percent prewhitening, the deconvolution process becomes less effective. The high end of the spectrum is not flattened as much as the rest of the spectrum (Figure 2.4-24). Note that the autocorrelograms contain increasingly more energy at nonzero lags with increasing percent prewhitening. In practice, it is not advisable to assign a large percent of prewhitening. Typically, a value between 0.1 and 1 percent is sufficient to ensure stability in designing the deconvolution operator (equation 2-32)
We now examine the effect of operator length and prediction lag on amplitude spectrum. Figure 2.5-5a shows a common-shot gather with its autocorrelogram and average amplitude spectrum. The field record is prepared for deconvolution by first muting the guided waves (Figure 2.5-5b) and applying t 2 t 2 t^(2)t^{2}t2-scaling (Figure 2.5-5c). Figure 2.5-5d shows the same record after spiking deconvolution. Note the flattening of the spectsum
(a) (b)
(c)
FIG. 2.5-6. The shot record in Figure 2.5 5 c 2.5 5 c 2.5-5c2.5-5 \mathrm{c}2.55c after predictrve deconvolution using an operator length of 320 m s 320 m s 320ms320 \mathrm{~ms}320 ms and a prediction lag of: (a) unit-prediction, (b) 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms, and (c) 24 m s 24 m s 24ms24 \mathrm{~ms}24 ms. The amplitude spectra (top) averaged over the shot record, and the autocorrelograms (bottom) are used to to choose deconvolution parameters and evaluate the data after the application of deconvolution.
within the passband of the recorded data and attenuation of the energy at nonzero lags of the autocorrelogram. With prediction lag greater than unity (Figure 2.5-6), for the same operator length, we note insufficient flattening at the high-frequency end of the spectrum. At larger prediction lags, note the insufficient flattening at
the low-frequency end of the spectrum. A very large prediction lag causes the amplitude spectrum of the deconvolved data remain similar to that of the input data (compare Figures 2.5-6c with 2.5-5c).
The data sometimes must be preconditioned for deconvolution. If the data were too noisy, then a wide band-pass filter could be necessary before deconvolution. If there is significant coherent noise in the data, dip filtering (Sections 6.2 and 6.3 ) can be applied before deconvolution so that coherent noise is not included in the autocorrelation estimate. Alternatively, time-variant spectral whitening (Section 2.6) can be applied to balance the spectrum before deconvolution.

Signature Deconvolution

In marine seismic exploration, the far-fleld signature of the source array can be recorded. The idea is to apply a deterministic deconvolution to remove the source signature, then to apply predictive deconvolution. The convolutional model is given by
x ( t ) = s ( t ) w ( t ) e ( t ) x ( t ) = s ( t ) w ( t ) e ( t ) x(t)=s(t)**w(t)**e(t)x(t)=s(t) * w(t) * e(t)x(t)=s(t)w(t)e(t)
where s ( t ) s ( t ) s(t)s(t)s(t) is the source signature recorded in the farfield just before it travels down into the earth, which has an impulse response e ( t ) e ( t ) e(t)e(t)e(t). Since s ( t ) s ( t ) s(t)s(t)s(t) is recorded, an inverse filter can be deterministically designed, is discussed in Section 2.2, then applied to the recorded seismogram to remove it from equation (2-41). The unknown wavelet w ( t ) w ( t ) w(t)w(t)w(t) includes the propagating effects in the earth and the response of the recording system. This remaining wavelet then is removed by the statistical method of spiking deconvolution as discussed in Section 2.3. Compare equation (2-41) with equation (2-3a) and note that the old w ( t ) w ( t ) w(t)w(t)w(t) of equation (2-3a) is split into two parts the source signature s ( t ) s ( t ) s(t)s(t)s(t), which is the known component, and the new w ( t ) w ( t ) w(t)w(t)w(t), which is the unknown component.
There are two ways to handle s ( t ) s ( t ) s(t)s(t)s(t). One way is to convert it to its minimum-phase equivalent followed by predictive deconvolution (Figure 2.5-7). Another way is to convert s ( t ) s ( t ) s(t)s(t)s(t) into a spike followed by predictive deconvolution (Figure 2.5-8). The process involves the following steps:
(a) Estimate the minimum-phase equivalent of the recorded source signature by computing the spiking deconvolution operator (equation 2-39) and taking its inverse.
(b) Design a shaping filter to convert the source signature to its minimum-phase equivalent or a zerodelay spike (equation 2-30).
(a) (b)
(c)
(d)
(e)
FIG. 2.5-7. Signature processing. A shaping filter is designed to convert the recorded signature [ s ( t ) [ s ( t ) [s(t)[s(t)[s(t) in equation (2-41)] to its minmum-phese equivalent and applied to the input record (a). The output (b) has the same bandwidth as the input (a). The output (b) then has been processed by predictive deconvolution using operator length of 160 m s 160 m s 160ms160 \mathrm{~ms}160 ms, and prediction lags of (c) 4 m s 4 m s 4ms4 \mathrm{~ms}4 ms (spiking deconvolution), (d) 12 m s 12 m s 12ms12 \mathrm{~ms}12 ms, (e) 32 m s 32 m s 32ms32 \mathrm{~ms}32 ms. Exarnine the autocorrelograms (bottom) and note that those of (a) and (b) should be identical.
(c) Apply the shaping filter to each trace in each recorded shot record.
(d) Apply predictive deconvolution to output data from step (c).
The results shown in Figures 2.5-7 and 2.5-8 (panels (c)) should be compared with single-step statistical deconvolution (Figure 2.5-9). Since the source was not minimum-phase in this case, Figure 2.5-9b should be better than Figure 2.5-9d. Is it?
Actually, results of signature processing depend on the accuracy of the recorded signature. One should
FIG, 2.5-8. Signature processing. A shaping filter is desugned to convert the recorded signature ( s ( t ) ( s ( t ) (s(t)(s(t)(s(t) in equation 2-41) to a spike and applied to the input record (a). The output (b) then has been processed by predictive deconvolution using an operator length of 160 m s 160 m s 160ms160 \mathrm{~ms}160 ms and prediction lags of (c) 4 m s 4 m s 4ms4 \mathrm{~ms}4 ms (spiking deconvolution), (d) 12 m s 12 m s 12ms12 \mathrm{~ms}12 ms, and (e) 32 m s 32 m s 32ms32 \mathrm{~ms}32 ms. Note from the autocorrelograms (bottom) that the out put from signature processing (b) still contains a wavelet component the w ( t ) w ( t ) w(t)w(t)w(t) component in equation (2-41), that still needs to be removed.
avoid signature processing of old marine data unless there exists a concurrently recorded source signature. Contemporary marine data almost always include the recorded source signature at each shot location. Figure 2.5-10a shows a recorded water-gun signature with its amplitude and phase spectra. The minimum-phase equivalent is shown in Figure 2.5-10b, and the result of signature deconvolution to convert the recorded waveform to its minimum-phase equivalent is shown in Figure 2.5-10c. While the amplitude spectrum is unaltered, the phase spectrum is minimum phase.
Application of signature processing described in Figure 2.5-10 to a recorded shot gather is shown in Figure 2.5-11. Again, note that signature processing
(a)
(b)
(c)
(d)
FIG. 2.5-9. Signature processing compared with statistical deconvolution. (a) Input shot record. (b) A shaping filter is designed to convert the recorded signature ( s ( t ) ( s ( t ) (s(t)(s(t)(s(t) in equation 2-41) to its minimum-phase equivalent and applied to the input record followed by spiking deconvolution. (This panel is the same as Figure 2.5-7c.) (c) A shaping filter is designed to convert the recorded signature ( s ( t ) ( s ( t ) (s(t)(s(t)(s(t) in equation 2 41 ) 2 41 ) 2-41)2-41)241) to a spike and applied to the input record followed by spiking deconvolution. (This panel is the same as Figure 2.5-8c.) (d) Spiking deconvolution of the input record (a). The autocorrelograms (bottom) suggest that the wavelet compression is achieved in all three cases, (b), (c) and (d).
aimed at converting the recorded source signature to its minimum-phase equivalent leaves the amplitude spectrum and autocorrelogram of the shot record unaltered (Figures 2.5-t1a,b). We can also observe from the corresponding CMP-stacked sections that the process has not made any impact on the degree of vertical resolution; only a change in phase has taken place (Figure 2.5-12). Following the deterministic step of Figure 2.5 11 b 11 b 11b11 \mathrm{~b}11 b, statistical deconvolution is applied to flatten the spectrum (Figure 2.5-11c).
FIG. 2.5-10. (a) A water-gun source signature and its amplitude and phase spectra (top and middle graphs), (b) its minimum-phase equivalent, and (c) the ouput of signature processing to convert (a) to (b).

Vibroseis Deconvolution

The vibroseis source is a long-duration sweep signal in the form of a frequency-modulated sinusoid that is tapered on both ends. Just as a convolutional model was proposed for the marine seismogram given by equation (2-41), a similar convolutional model can be proposed for the vibroseis seismogram
x ( t ) = s ( t ) w ( t ) e ( t ) , x ( t ) = s ( t ) w ( t ) e ( t ) , x(t)=s(t)**w(t)**e(t),x(t)=s(t) * w(t) * e(t),x(t)=s(t)w(t)e(t),
where x ( t ) x ( t ) x(t)x(t)x(t) is the recorded seismogram, s ( t ) s ( t ) s(t)s(t)s(t) is the sweep signal, w ( t ) w ( t ) w(t)w(t)w(t) is the seismic wavelet with the same meaning as in equation (2-41), and e ( t ) e ( t ) e(t)e(t)e(t) is the earth's impulse response. Convolutions in equation (2-42) become multiplications in the frequency domain:
X ( ω ) = S ( ω ) W ( ω ) E ( ω ) X ( ω ) = S ( ω ) W ( ω ) E ( ω ) X(omega)=S(omega)W(omega)E(omega)X(\omega)=S(\omega) W(\omega) E(\omega)X(ω)=S(ω)W(ω)E(ω)
In terms of amplitude A ( ω ) A ( ω ) A(omega)A(\omega)A(ω) and phase ϕ ( ω ) ϕ ( ω ) phi(omega)\phi(\omega)ϕ(ω) spectra, equation (2-43) yields
A z ( ω ) = A s ( ω ) A ω ( ω ) A c ( ω ) A z ( ω ) = A s ( ω ) A ω ( ω ) A c ( ω ) A_(z)(omega)=A_(s)(omega)A_(omega)(omega)A_(c)(omega)A_{z}(\omega)=A_{s}(\omega) A_{\omega}(\omega) A_{c}(\omega)Az(ω)=As(ω)Aω(ω)Ac(ω)
and
ϕ x ( ω ) = ϕ s ( ω ) + ϕ w ( ω ) + ϕ e ( ω ) ϕ x ( ω ) = ϕ s ( ω ) + ϕ w ( ω ) + ϕ e ( ω ) phi_(x)(omega)=phi_(s)(omega)+phi_(w)(omega)+phi_(e)(omega)\phi_{x}(\omega)=\phi_{s}(\omega)+\phi_{w}(\omega)+\phi_{e}(\omega)ϕx(ω)=ϕs(ω)+ϕw(ω)+ϕe(ω)
Crosscorrelation of the recorded seismogram x ( t ) x ( t ) x(t)x(t)x(t) with the sweep signal s ( t ) s ( t ) s(t)s(t)s(t) is equivalent to multiplying equation (2-44a) by A s ( ω ) A s ( ω ) A_(s)(omega)A_{s}(\omega)As(ω) and subtracting ϕ s ( ω ) ϕ s ( ω ) phi_(s)(omega)\phi_{s}(\omega)ϕs(ω) from equation (2-44b). The correlated vibroseis seismogram x t ( t ) x t ( t ) x^(t)(t)x^{t}(t)xt(t) therefore would have the following amplitude and phase spectra:
A ( ω ) = A s 2 ( ω ) A w ( ω ) A e ( ω ) ( 2 45 a ) A ( ω ) = A s 2 ( ω ) A w ( ω ) A e ( ω ) ( 2 45 a ) A^(')(omega)=A_(s)^(2)(omega)A_(w)(omega)A_(e)(omega)quad(2-45 a)A^{\prime}(\omega)=A_{s}^{2}(\omega) A_{w}(\omega) A_{e}(\omega) \quad(2-45 a)A(ω)=As2(ω)Aw(ω)Ae(ω)(245a)
and
ϕ ( ω ) = ϕ w ( ω ) + ϕ e ( ω ) ϕ ( ω ) = ϕ w ( ω ) + ϕ e ( ω ) phi^(')(omega)=phi_(w)(omega)+phi_(e)(omega)\phi^{\prime}(\omega)=\phi_{w}(\omega)+\phi_{e}(\omega)ϕ(ω)=ϕw(ω)+ϕe(ω)
The inverse Fourier transform of A s 2 ( ω ) A s 2 ( ω ) A_(s)^(2)(omega)\boldsymbol{A}_{s}^{2}(\omega)As2(ω) yields the autocorrelation of the sweep signal, which is called the Klauder wavelet k ( t ) k ( t ) k(t)k(t)k(t). Returning to the time domain, equations ( 2 45 a , b ) ( 2 45 a , b ) (2-45a,b)(2-45 \mathbf{a}, \mathbf{b})(245a,b) yield
x ( t ) = k ( t ) w ( t ) e ( t ) x ( t ) = k ( t ) w ( t ) e ( t ) x^(')(t)=k(t)**w(t)**e(t)x^{\prime}(t)=k(t) * w(t) * e(t)x(t)=k(t)w(t)e(t)
Figure 2.5-13 outlines the process of vibroseis correlation where the seismic wavelet w ( t ) w ( t ) w(t)w(t)w(t) has been omitted for convenience. Note that, following vibroseis correlation, the sweep s ( t ) s ( t ) s(t)s(t)s(t) contained in the recorded seismogram x ( t ) x ( t ) x(t)x(t)x(t) is replaced with its autocorrelogram the Klauder wavelet k ( t ) k ( t ) k(t)k(t)k(t).
Since it is an autocorrelation, the Klauder wavelet is zero-phase. Convolution of k ( t ) k ( t ) k(t)k(t)k(t) with the assumingly minimum-phase wavelet w ( t ) w ( t ) w(t)w(t)w(t) yields a mixed-phase wavelet. Because spiking deconvolution is based on the minimum-phase assumption, it cannot recover e ( t ) e ( t ) e(t)e(t)e(t) properly from vibroseis data.
One approach to deconvolution of vibroseis data is to apply a zero-phase inverse filter to remove k ( t ) k ( t ) k(t)k(t)k(t), followed by a minimum-phase deconvolution to remove w ( t ) w ( t ) w(t)w(t)w(t). The amplitude spectrum of the inverse filter is defined as 1 / A s 2 ( ω ) 1 / A s 2 ( ω ) 1//A_(s)^(2)(omega)1 / A_{s}^{2}(\omega)1/As2(ω). In practice, problems arise because of zeroes in the spectrum that are caused by the bandlimited nature of the Klauder wavelet. Inversion of an amplitude spectrum, which has zeroes, yields an unstable operator (Section 2.3). To circumvent this problem, a small percent of white noise, say 0.1 % 0.1 % 0.1%0.1 \%0.1%, usually is added before inverting the Klauder wavelet spectrum.
Another approach is to design a filter that converts the Klauder wavelet to its minimum-phase equivalent (Ristow and Jurczyk, 1975). A technique to compute the minimum-phase spectrum from a given amplitude spectrum is described in Section B. 4 and is included in the discussion on frequency-domain deconvolution.
(a)
(b)
FIG. 2.5-12. (a) A portion of a CMP-stacked section that corresponds to the data in Figure 2.5-11a, and (b) after signature processing of shot records as in Figure 2.5-11b to convert the recorded water-gun signature to its minimum-phase equivalent as described in Figure 2.5-10. Note that signature processing was not aimed at wavelet compression; instead, it was done to convert the source signature to its minimum-phase equivalent.
Vibroseis correlation correlation x ( t ) = s ( t ) e ( t ) { A s ( ω ) A e ( ω ) ϕ s ( ω ) + ϕ c ( ω ) } crosscorrelate with sweep e ( t ) : reflectivity x ( t ) = k ( t ) e ( t ) { A s 2 ( ω ) A e ( ω ) ϕ e ( ω ) } s ( t ) : sweep x ( t ) : uncorrelated vibroseis data x ( t ) : correlated vibroseis data k ( t ) : Klauder wavelet  Vibroseis correlation   correlation  x ( t ) = s ( t ) e ( t ) A s ( ω ) A e ( ω ) ϕ s ( ω ) + ϕ c ( ω )  crosscorrelate   with sweep  e ( t ) :  reflectivity  x ( t ) = k ( t ) e ( t ) A s 2 ( ω ) A e ( ω ) ϕ e ( ω ) s ( t )  : sweep  x ( t )  : uncorrelated vibroseis data  x ( t )  : correlated vibroseis data  k ( t )  : Klauder wavelet  {:[" Vibroseis correlation "],[{:[" correlation "],[x(t)=s(t)**e(t)rarr{[A_(s)(omega)A_(e)(omega)],[phi_(s)(omega)+phi_(c)(omega)]}]:}],[" crosscorrelate "],[" with sweep "],[ darr],[e(t):" reflectivity "quadx^(')(t)=k(t)**e(t)larr{[A_(s)^(2)(omega)A_(e)(omega)],[phi_(e)(omega)]}],[s(t)" : sweep "],[x(t)" : uncorrelated vibroseis data "],[x^(')(t)" : correlated vibroseis data "],[k(t)" : Klauder wavelet "]:}\begin{aligned} & \text { Vibroseis correlation } \\ & \begin{array}{l} \text { correlation } \\ x(t)=s(t) * e(t) \rightarrow\left\{\begin{array}{l} A_{s}(\omega) A_{e}(\omega) \\ \phi_{s}(\omega)+\phi_{c}(\omega) \end{array}\right\} \end{array} \\ & \text { crosscorrelate } \\ & \text { with sweep } \\ & \downarrow \\ & e(t): \text { reflectivity } \quad x^{\prime}(t)=k(t) * e(t) \leftarrow\left\{\begin{array}{r} A_{s}^{2}(\omega) A_{e}(\omega) \\ \phi_{e}(\omega) \end{array}\right\} \\ & s(t) \text { : sweep } \\ & \boldsymbol{x}(t) \text { : uncorrelated vibroseis data } \\ & x^{\prime}(t) \text { : correlated vibroseis data } \\ & \boldsymbol{k}(t) \text { : Klauder wavelet } \end{aligned} Vibroseis correlation  correlation x(t)=s(t)e(t){As(ω)Ae(ω)ϕs(ω)+ϕc(ω)} crosscorrelate  with sweep e(t): reflectivity x(t)=k(t)e(t){As2(ω)Ae(ω)ϕe(ω)}s(t) : sweep x(t) : uncorrelated vibroseis data x(t) : correlated vibroseis data k(t) : Klauder wavelet 
FIG. 2.5-13. An outline of vibroseis correlation.
If the Klauder wavelet were converted to its minimumphase equivalent, then equation (2-45b) would take the form:
ϕ ( ω ) = ϕ k ( ω ) + ϕ ω ( ω ) + ϕ e ( ω ) . ϕ ( ω ) = ϕ k ( ω ) + ϕ ω ( ω ) + ϕ e ( ω ) phi^(')(omega)=phi_(k)(omega)+phi_(omega)(omega)+phi_(e)(omega)". "\phi^{\prime}(\omega)=\phi_{k}(\omega)+\phi_{\omega}(\omega)+\phi_{e}(\omega) \text {. }ϕ(ω)=ϕk(ω)+ϕω(ω)+ϕe(ω)
If we assume that w ( t ) w ( t ) w(t)w(t)w(t) is minimum-phase and if we make k ( t ) k ( t ) k(t)\boldsymbol{k}(t)k(t) minimum-phase, then the result of their convolution also is minimum-phase. Spiking deconvolution now is applicable since the minimum-phase assumption is satisfied.
There is a 90-degree phase difference in some vibrator systems between the control sweep signal and the baseplate response. As an option, we may want to subtract out this phase difference. Figure 2.5-14 shows the recommended sequence of operations for vibroseis processing.
2.5-14. A flowchart for vibrose is deconvolution.
Figure 2.5-15 shows how the flowchart in Figure 2.5 14 2.5 14 2.5-142.5-142.514 is used with a synthetic reflectivity series. By including the step to convert the Klauder wavelet into its minimum-phase equivalent before spiking deconvolution, a closer representation of the impulse response is produced as seen by comparing steps (k) and (l) with (m).
Although sound in theory, the above scheme may have problems in practice. Fundamental issues, such as whether the convolutional model given in equation (242) really represents what goes on in the earth, are not resolved.
Vibroseis data often are deconvolved as dynamite data, without converting the Klauder wavelet to its minimum-phase equivalent. An example of deconvolution of a correlated vibroseis record is shown in Figure 2.5-16.
Despite the fact that the basic minimum-phase assumption is violated for vibroseis data as compared to explosive data, spiking deconvolution without conversion of the Klauder wavelet to its minimum-phase equivalent seems to work for most field data. Figure 2.5-17 shows a set of correlated vibroseis records before and after spiking deconvolution. Prominent reflections after deconvolution are enhanced and reverberations are atteruated significantly. Nonetheless, the problem of tying vibrator lines to lines recorded with other sources, say dynamite, is more difficult if the vibrator data have not been phase-corrected. Field systems now exist to do minimum-phase vibroseis correlation in the field.

Poststack Deconvolution

Poststack deconvolution often is considered for several reasons. First, a residual wavelet almost always is present on the stacked section. This is because none of the underlying assumptions for deconvolution is completely met in real data; therefore, deconvolution never can completely compress the basic wavelet contained in prestack data to a spike. Second, since a CMP stack is an approximation to the zero-offset section, predictive deconvolution aimed at removing multiples may be a viable process after stack. Figure 2.5-18 is an example of poststack deconvolution applied to marine data. After deconvolution, the spectrum is flattened, albeit incompletely, the wavelet is compressed further and the marker horizons are better characterized. Again, as the prediction lag is increased, the flatness character of the spectrum and thus vertical resolution is increasingly compromised (Figure 2.5-19),
Figure 2.5-20 shows poststack deconvolution applied to land data. Note the significant improvement in vertical resolution as it can be verified by the autocorrelogram and average amplitude spectrum of the data.

2.6 THE PROBLEM OF NONSTATIONARITY

Figure 2.6-1 shows a CMP gather and its filtered versions before deconvolution. The filter scans show that there is signal between 10 to 40 H z 40 H z 40Hz40 \mathrm{~Hz}40 Hz. Note that higher frequencies are confined to the shallower part of the gather. The same field record after spiking deconvolution is shown in Figure 2.6-2. Filter scans of the deconvolved record also are shown in this figure. A comparison of the records before and after deconvolution (Figures 2.61 and 2.6-2) demonstrates the effects of the process; in particular, compression of the wavelet and broadening of the spectrum. The input signal level above 40 H z 40 H z 40Hz40 \mathrm{~Hz}40 Hz is relatively weaker than that below 40 H z 40 H z 40Hz40 \mathrm{~Hz}40 Hz. Deconvolution has attempted to reduce the differences between the signal levels within different frequency bands by flattening the spectrum. The flattening, however, was more effective in the shallow part of the record than in the deeper part.
As discussed in Sections 1.4 and 2.1, the source wavelet is not statronary its shape and bandwidth change with traveltime (Figure 2.1-2). Specifically, attenuation of high frequencies in the wavelet increases as waves travel deeper in the subsurface. Although multiwindow deconvolution was used in this case (Figure 2.62), spectral flattening was not achieved over the entire length of the record because of the large degree of nonstationarty of the data. Nonstationarity is primarily the result of the effects of wavefront divergence and frequency attenuation.
(a)
(b)
(c)
(d)
2.5-16. Deconvolution of a vibroseis record. Three windows were used. (a) Correlated vibrosels record and its autocorrelograms (b); (d) spiking deconvolution output and its autocorrelograms (c).
The phenomenon of nonstationarity on stacked data is exemplified in Figure 2.6-3. Following a singlegate poststack spiking deconvolution, note that the average amplitude spectrum of the data does not indicate a flat spectrum (Figure 2.6-3b). Instead, the spectrai behavior is similar to data with predictive deconvolution with a large predictions lag (Figure 2.6-3c). The strong reflector in the neighborhood of 2.5 s 2.5 s 2.5s2.5 \mathrm{~s}2.5 s separates the zone with two different bandwidths a broad-band signal zone above, and a relatively narrow-band zone below.
The usual approach to reduce nonstationarity is to apply processes designed to compensate for the effects wavefront divergence and frequency attenuation before deconvolution. Wavefront divergence is corrected for by applying a geometric spreading function (Section 1.4). As yet a method to compensate for attenuation has not been discussed. Attenuation is measured by a quantity
2.5-17. (a) Common-shot gathers recorded with vibroseis source. Geornetric spreading correction and trace balancing have been applied. (b) After spiking deconvolution.
called the quality factor Q Q QQQ. An infinite Q Q QQQ means that there is no attenuation. This factor can change in depth and in the lateral direction. If we had an analytic form for an attenuation function, then it would be easy to compensate for its effect. Several models for Q Q QQQ have been proposed. The constant- Q Q QQQ model is quite plausi- ble and the easiest to deal with (Kjartannson, 1979). However, the big problem of estimating Q Q QQQ from seismic data still remains. If a reliable Q Q QQQ value is available, say from borehole measurements, then, as will be discussed later in this section, inverse Q Q QQQ filtering can be applied to data to compensate for the frequency attenuation.
(a)
(b)
(c)
(d)
(e)
2.5-18. (a) A portion of s CMP-stacked section, and after spiking deconvolution using an operator length of: (b) 120 m s 120 m s 120ms120 \mathrm{~ms}120 ms, (b) 160 m s 160 m s 160ms160 \mathrm{~ms}160 ms, (c) 220 m s 220 m s 220ms220 \mathrm{~ms}220 ms, and (d) 320 m s 320 m s 320ms320 \mathrm{~ms}320 ms. Note from the autocorrelograms (bottom) that much of the reverberating energy is attenuated using a 320 m s 320 m s 320-ms320-\mathrm{ms}320ms operator length. The amplitude spectra averaged over the CMP stack (top) indicate that, irrespective of how long the operator length is, spiking deconvolution in this case has failed to flatten the spectrum completely within the passband. This is because of nonstationarity of the signal.
(a)
(b)
(c)
(d)
2.5-19. A portion of a CMP-stacked section as in Figure 2.5-7a after predictive deconvolution using an operator length of 320 ms and a prediction lag of: (a) 8 m s 8 m s 8ms8 \mathrm{~ms}8 ms, (b) 12 m s 12 m s 12ms12 \mathrm{~ms}12 ms, (c) 24 m s 24 m s 24ms24 \mathrm{~ms}24 ms, (d) 32 m s 32 m s 32ms32 \mathrm{~ms}32 ms, and (e) 48 m s 48 m s 48ms48 \mathrm{~ms}48 ms. The amplitude spectra (top) averaged over the CMP stack, and the autocorrelograms (bottom) are used to to choose deconvolution parameters and evaluate the dats after the application of deconvolution.
(a)
cdots\cdots
(b)
2.5-20. (a) A portion of a CMP-stacked section, and (b) after spiking deconvolution using an operator length of 240 ms. The amplitude spectra (top) averaged over the CMP stack, and the autocorrelograms (bottom) are used to choose deconvolution parameters and evaluate the data after the application of deconvolution.

Time-Variant Deconvolution

Nonstationarity was discussed in Sections 1.4 and 2.1. The time-variant character of the seismic wavelet (Figure 2.1-2) often requires a multiwindow deconvolution. Figure 2.6 4 2.6 4 2.6-42.6-42.64 is a field record that was deconvolved
2.6-1. A field record (far left panel) with its band-pass filtered versions.
2.6-2. Spiking deconvolution applied to the field record in Figure 2.6-1 (far left panel), followed by application of a series of band-pass filters.
by using three time gates. The sutocorrelograms from gates 1, 2, and 3 are shown in Figure 2.6-5. Note the difference in character of the reverberatory energy from one gate to another. The shallow gate (1) has more highfrequency signal than the middle gate (2); while the middle gate has more high-frequency signal than the deeper gate (3). For best results, we must design different deconvolution operators from different parts of the record and apply them to the corresponding time gates. Up to three windows usually are sufficient to handle the nonstationary character of the seismic signal.
(a) isi 10 an: +20
(b)

(c)
2.6-3. (a) A portion of a CMP-stacked section with its amplitude spectrum averaged over the CMP range (top) and autocorrelogram (bottom); (b) after time-invariant spiking deconvolution; and (c) after time-invariant predictive deconvolution with a prediction lag of 24 m s 24 m s 24ms24 \mathrm{~ms}24 ms.
(a)
(b)
(c)
(d)
2.6-4. Three-window deconvolution. The solid bars indicate window boundaries. With data from each window, a deconvolution operator is designed and spplied to the data in that window. The operators are blended across the window boundaries. (a) Input gather. Deconvolution using operator length of 160 m s 160 m s 160ms160 \mathrm{~ms}160 ms and prediction lags of (b) 4 m s 4 m s 4ms4 \mathrm{~ms}4 ms, (c) 12 m s 12 m s 12ms12 \mathrm{~ms}12 ms, (d) 32 m s 32 m s 32ms32 \mathrm{~ms}32 ms.
Another example of single- and multiwindow deconvolution is shown in Figures 2.6-6 and 2.6-7. Here, autocorrelograms from different gates do not show significant variations. Therefore, it probably does not make any difference whether a single or multigate deconvolution is used. In Figures 2.6-6 and 2.6-7, the record is shown after deconvolution followed by a wide bandpass filter application. Since the amplitude spectrum of the input data is flattened as a result of spiking deconvolution, both the high-frequency ambient noise as much as the high-frequency components of the signal are boosted. Therefore, the output of spiking deconvolution often is filtered with a wide band-pass operator.
A practical problem with time-variant deconvolution is limiting design gates to small time windows. Consider, for instance, a three-window deconvolution of a 5 s s s\mathbf{s}s data. This means that at best an average gate kength of 1.5 s 1.5 s 1.5s1.5 \mathrm{~s}1.5 s at near offset and less than 1 s 1 s 1s1 \mathrm{~s}1 s at far offset can be used to design a deconvolution operator. To attain good statistics in an autocorrelation estimate, an operator length no more than one-eighth to one-tenth of the design gate, say 150 m s 150 m s 150ms150 \mathrm{~ms}150 ms, should be considered. Hence, if
Ξ Ξ Xi\XiΞ
(a)
(b)
(c)
(d)
2.6-6. Spiking deconvolution (c) on a shot record (a) followed by bend-pass filtering (d). (b) Autocorrelograms before and after deconvolution.
you need to use a longer operator, time-variant deconvolution may have limited effectiveness in attenuating reverberations and short-period multiples. A way to account for nonstationarity while avoiding the shortoperator effect of multiwindow deconvolution follows.

Time-Variant Spectral Whitening

Frequency attenuation and a way to compensate for it are illustrated in Figure 2.6-8. Let us assume that we have an input seismogram with amplitudes decaying in
(a)
(b)
(c)
(d)
FIG. 2.6-7. Three-window deconvolution on the same shot record as in Figure 2.6-6. In this case, there is no significant difference between the characters of the autocorrelograms estimated from three windows. (a) Input gather; (b) autocorrelograms before and after spiking deconvolution; (c) three-window spiking deconvolution on (a); (d) band-pass filtering on (c).
time, as depicted. Now apply a series of narrow bandpass filters to this trace. Examine the field record in Fig. ure 2.6 1 2.6 1 2.6-12.6-12.61 and associate the filter panels with the traces sketched in Figure 2.6-8. Note that the low-frequency component of trace F L F L F_(L)F_{L}FL has a lower decay rate than the moderate-frequency component F M F M F_(M)F_{M}FM. Likewise, the moderate-frequency component F M F M F_(M)F_{M}FM has a lower decay rate than the high-frequency component of the signal F H F H F_(H)F_{H}FH. A series of gain functions, such as G 1 , G 2 , G 3 G 1 , G 2 , G 3 G_(1),G_(2),G_(3)G_{1}, G_{2}, G_{3}G1,G2,G3, can be computed to describe the decay rates for each frequency band. This is done by computing the envelope of the band-pass filtered traces (Figure 2.6-8). The inverses of these gain functions then are applied to each frequency band and the results are summed. The amplitude spectrum of the resulting trace has thus been whitened in a time-variant manner. This time-variant spectral whitening process is outlined in Figure 2.69. The number of the filter bands, the width of each band, and the overall bandwidth of application of timevariant spectral whitening are parameters that can be prescribed for a particular application.
2.6-8. A schematic illustration of the rate of decay of the frequencies in a seismic trace (Gibson and Larner, 1982).
Figures 2.6-10 and 2.6-11 show some field records before and after spiking deconvolution, respectively. Note that this process not only has compressed the wavelet, but also has tried to suppress any reverberations in the data. Refer to Figure 2.6-12 and note that time-variant spectral whitening mainly has compressed the wavelet without changing much of the ringy character of the data. Also note that little was done explicitly to the phase. Therefore, the action of time-variant spectral whitening may be close to a zero-phase deconvolution, although there is no rigorous theoretical proof of this.
In practice, one of the main differences between time-variant spectral whitening and conventional deconvolution is that the former seems to be able to do a better job of flattening the amplitude spectrum. This difference can be significant for broad-band data with large dynamic range.
Time-variant spectral whitening sometimes helps attenuate ground roll on land records by way of its spectral balancing effect. Note that, in Figure 2.6-13, spiking deconvolution with different operator lengths has failed to flatten the spectrum, sufficiently. On the other hand, following spiking deconvolution, application of time-variant spectral whitening has balanced the spectrum and thus attenuated the ground-roll energy.
The ability of time-variant spectral whitening in flattening the spectrum within the passband of stacked data is observed in Figure 2.6-14. Note that spiking deconvolution is fairly effective, but not sufficient, for attaining a flat spectrum (Figure 2.6-14b). Following
2.6-9. A flowchart for time-variant spectral whitening.
time-variant spectral whitening, the spectrum is flattened within the passband of the data as seen in Figure 2.6-14c.
It is a requirement to prepare stacked data input to amplitude inversion with the broadest possible bandwidth and flattest possible spectrum. Hence, a processing sequence tailored for amplitude inversion almost always includes poststack deconvolution and time-variant spectral flattening steps.

Frequency-Domain Deconvolution

Spectral flattening can be achieved by an alternate approach in the frequency domain. As discussed in Section B.4, minimum-phase spiking deconvolution can be formulated in the frequency domain. Alternatively, we can flatten the amplitude spectrum without modifying the phase. This is called zero-phase frequency-domain deconvolution. When performed over multiple time gates down the trace, it is essentially equivalent to timevariant spectral flattening. If we only want to flatten the spectrum, then the approach shown in Figure 2.615 can be taken.
Although the domains of operations may differ, both minimum-phase frequency-domain and WienerLevinson deconvolution techniques should yield equivalent results. Differences between the results shown in Figures 2.6-11 and 2.6-16 mainly are due to their computational aspects.
The zero-phase frequency-domain deconvolution aimed at achieving time-variant spectral whitening requires partitioning the input seismogram into smail time gates, as well as designing and applying the process described in Figure 2.6-15 to each gate, individually. Figure 2.6-17 shows the field records after zero-phase frequency-domain deconvolution. The output is comparable to the time-variant spectral flattening output shown in Figure 2.6-12.
FIG. 2.6-10. CMP gathers with no deconvolution.

Inverse Q Q QQQ Filtering

Frequency attenuation caused by the intrinsic attenuation in rocks was discussed in Sections 1.4 and 2.1 . Attenuation causes loss of high frequencies in the propgating waveform with increasing traveltime. This gives rise to a nonstationary behavior in the shape of the wavelets arsociated with reflection events at different times.
Wave attenuation usually is described by a dimensionless factor Q Q QQQ, which is defined by the ratio of the mean stored energy to the energy loss over a period of time that is equivalent to one cycle of a frequency component of the waveform (Kjartansson, 1979). Timevariant deconvolution and time-variant spectral whitening discussed in this section are proceses that can correct for the time-varying effects of attenuation by spectral flattening. A deterministic alternative to compen-
FIG. 2.6-11. Spiking deconvolution applied to the CMP gathers in Figure 2.6-10.
sate for frequency-dependent attenuation is provided by inverse Q Q QQQ filtering.
The amplitude spectrum of the inverse Q Q QQQ filter is given by (Section B.9)
A ( ω , τ ) = exp ( ω τ 2 Q ) A ( ω , τ ) = exp ω τ 2 Q A(omega,tau)=exp((omega tau)/(2Q))A(\omega, \tau)=\exp \left(\frac{\omega \tau}{2 Q}\right)A(ω,τ)=exp(ωτ2Q)
where ω ω omega\omegaω is the angular frequency component associated with the input trace and τ τ tau\tauτ is the time variable associated with the output trace from inverse Q Q QQQ filtering. The phase spectrum of the inverse Q Q QQQ filter usually is assumed to be minimum-phase, which can be computed by taking the Hilbert transform of the amplitude spectrum (Section B.4).
FIG. 2.6-12. Time-variant spectral whitening (TVSW) applied to the CMP gathers in Figure 2.6-10. Compure this with Figures 26-11, 2.6-16, and 2.6-17.
FIG. 2.6-14. (a) A portion of a CMP stack and its amplitude spectrum averaged over the CMP range (top) and autocorrelogram (bottom); (b) after spiking deconvolution, (c) followed by time-variant spectral whitening, and (d) time-variant filtering.
FIG. 2.6-15. A flowchart for a frequency-domain deconvolution.
Application of the inverse Q Q QQQ filter requires knowledge of the attenuation factor Q Q QQQ, which usually is assumed to be constant. A compilation of laboratory measurements of Q Q QQQ for some rock samples is given by Table 2-28.
Note from Table 2-28 that most measurements have been made at extremely high frequencies compared to the typical frequency band of seismic waves. Nevertheless, by assuming frequency-independent Q Q QQQ factor (Kjartansson, 1979), these measurements can still be considered useful. Also note that the Q Q QQQ factor can vary significantly for limestone, sandstone, and shale rock samples of different origin.
The inverse of the amplitude spectrum defined by equation (2-48) can be used to obtain a quantitative measure of attenuation. In terms of frequency f f fff, wave
FIG. 2.6-16. Minimum-phase frequency-domain deconvolution applied to the CMP gathers in Figure 2.6-10. Compare this with Figures 2.6-11, 2.6-12, and 2.6-17.
FIG. 2.6-17. Zero-phase frequency-domain deconvolution applied to the CMP gathers in Figure 2.6-10. Compare this with Figures 2.6-11, 2.6-12, and 2.6-16.
Table 2-28. Intrinsic attenuation measurements in rocks (adapted from Waters, 1981).
Rock Type
Attenuation
Constant, Q Q QQQ
Attenuation Constant, Q| Attenuation | | :---: | | Constant, $Q$ |
Frequency
Range (Hz)
Frequency Range (Hz)| Frequency | | ---: | | Range (Hz) |
Basalt 550 3 , 000 4 , 000 3 , 000 4 , 000 3,000-4,0003,000-4,0003,0004,000
Granite 300 20 , 000 200 , 000 20 , 000 200 , 000 20,000-200,00020,000-200,00020,000200,000
Quartzite 400 3 , 000 4 , 000 3 , 000 4 , 000 3,000-4,0003,000-4,0003,0004,000
Limestone I 200 1 0 , 0 0 0 1 5 , 0 0 0 1 0 , 0 0 0 1 5 , 0 0 0 10,000-15,000\mathbf{1 0 , 0 0 0 - 1 5 , 0 0 0}10,00015,000
Limestone II 50 2 120 2 120 2-1202-1202120
Limestone III 650 4 18 , 000 4 18 , 000 4-18,0004-18,000418,000
Chalk 2 150
Sandstone I 25 550 4 , 000 550 4 , 000 550-4,000550-4,0005504,000
Sandstone II 125 20,000
Sandstone III 75 2 , 500 5 , 000 2 , 500 5 , 000 2,500-5,0002,500-5,0002,5005,000
Sandstone IV 100 2 40 2 40 2-402-40240
Shale I 15 75 550 75 550 75-55075-55075550
Shale II 75 3 , 300 12 , 800 3 , 300 12 , 800 3,300-12,8003,300-12,8003,30012,800
Rock Type "Attenuation Constant, Q" "Frequency Range (Hz)" Basalt 550 3,000-4,000 Granite 300 20,000-200,000 Quartzite 400 3,000-4,000 Limestone I 200 10,000-15,000 Limestone II 50 2-120 Limestone III 650 4-18,000 Chalk 2 150 Sandstone I 25 550-4,000 Sandstone II 125 20,000 Sandstone III 75 2,500-5,000 Sandstone IV 100 2-40 Shale I 15 75-550 Shale II 75 3,300-12,800| Rock Type | Attenuation <br> Constant, $Q$ | Frequency <br> Range (Hz) | | :--- | ---: | ---: | | Basalt | 550 | $3,000-4,000$ | | Granite | 300 | $20,000-200,000$ | | Quartzite | 400 | $3,000-4,000$ | | Limestone I | 200 | $\mathbf{1 0 , 0 0 0 - 1 5 , 0 0 0}$ | | Limestone II | 50 | $2-120$ | | Limestone III | 650 | $4-18,000$ | | Chalk | 2 | 150 | | Sandstone I | 25 | $550-4,000$ | | Sandstone II | 125 | 20,000 | | Sandstone III | 75 | $2,500-5,000$ | | Sandstone IV | 100 | $2-40$ | | Shale I | 15 | $75-550$ | | Shale II | 75 | $3,300-12,800$ |
velocity v v vvv and depth z = v τ z = v τ z=v tauz=v \tauz=vτ, the inverse is
A 1 ( f , v , z , Q ) = exp ( π f z Q v ) A 1 ( f , v , z , Q ) = exp π f z Q v A^(-1)(f,v,z,Q)=exp(-(pi fz)/(Qv))A^{-1}(f, v, z, Q)=\exp \left(-\frac{\pi f z}{Q v}\right)A1(f,v,z,Q)=exp(πfzQv)
To determine how far in depth the wave has to travel before its amplitude reduces to, say, one-tenth of its amplitude at the surface z = 0 z = 0 z=0z=0z=0, rewrite equation (2-49) as follows:
z = 2.3 Q v π f z = 2.3 Q v π f z=(2.3 Qv)/(pi f)z=\frac{2.3 Q v}{\pi f}z=2.3Qvπf
Note that the smaller the Q Q QQQ factor, the lower the velocity and the higher the frequency, the shallower the depth at which the wave amplitude decays to a fraction of the wave amplitude at z = 0 z = 0 z=0z=0z=0. Table 2-29 lists the z z zzz values for a frequency of 30 H z 30 H z 30Hz30 \mathrm{~Hz}30 Hz and a velocity of 3000 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s for a range of Q Q QQQ values.
Table 2-29. Depth at which wave amplitude drops to one-tenth of its original at the surface for a range of Q Q QQQ values (equation 2-50).
v = 3000 m / s v = 3000 m / s v=3000m//sv=3000 \mathrm{~m} / \mathrm{s}v=3000 m/s
f = 30 H z f = 30 H z f=30Hzf=30 \mathrm{~Hz}f=30 Hz
Q Q QQQ Factor
Depth in m m m\mathrm{m}m
25 1,830
50 3 , 660 3 , 660 3,660\mathbf{3}, 6603,660
100 7,325
250 1 8 , 3 1 2 1 8 , 3 1 2 18,312\mathbf{1 8 , 3 1 2}18,312
5 0 0 5 0 0 500\mathbf{5 0 0}500 3 6 , 6 2 5 3 6 , 6 2 5 36,625\mathbf{3 6 , 6 2 5}36,625
25 1,830 50 3,660 100 7,325 250 18,312 500 36,625| 25 | 1,830 | | ---: | ---: | | 50 | $\mathbf{3}, 660$ | | 100 | 7,325 | | 250 | $\mathbf{1 8 , 3 1 2}$ | | $\mathbf{5 0 0}$ | $\mathbf{3 6 , 6 2 5}$ |
Note that the smaller the Q Q QQQ factor the shallower the depth at which the amplitude drops to the specified value of one-tenth of the original value at the surface z = 0 z = 0 z=0z=0z=0. For very large Q Q QQQ values, that is, for small attenuation, the amplitude reduction to the specified value does not take place until the wave reaches very large depths beyond the exploration objectives.
Unfortunately, there is no reliable way to estimate the attenuation factor Q Q QQQ directly from seismic data. At best, inverse Q Q QQQ filtering can be applied to post- or prestack data (Section B.9) using a range of constant Q Q QQQ factors to create a Q Q QQQ panel, much like a filter panel (Section 1.1). The fartor that yields the flattest spectrurn in combination with other signal processing applications
deconvolution and time-variant spectral whitening, is chosen as the optimum Q Q QQQ value.

Deconvolution Strategies

Throughout the development of deconvolution theory, several alternatives have been proposed to better solve the deconvolution problem. Still, predictive deconvolution is used more than the other methods, although the minimum-phase and white reflectivity sequence assumptions have been key issues of concern.
Follow the common sequence for deconvolution of marine data in Figures 2.6-18 through 2.6-22. Note the presence of reverberations and short-period muitiples in the CMP-stacked data with no deconvolution applied (Figure 2.6-18). Signature processing, in this case, was done to convert the recorded source signature to its minimum-phase equivalent (Figure 2.6-19). Therefore, aside from phase, there is no difference between the sections in Figures 2.6-18 and 2.6-19. Deconvolution before stack has helped attenuate reverberations and short-period multiples and, to some extent, compressed the basic wavelet (2.6-20). The additonal step of poststack deconvolution has restored much of the high frequencies attenuated during stacking (Figure 2.6-21). Finally, time-variant spectral whitening has flattened the spectrum within the passband of the data (Figure 2.6-22) and yielded a crisp section with high resolution.
The same sequence can be followed in Figures 2.623 through 2.627. The CMP-stacked section includes reflections associated with a shallow, low-relief sedimentary strata (Figure 2.6-23). Following the signature processing (Figure 2.6-24), observe the gradual increase in the vertical resolution by prestack deconvolution (Figwe 2.6-25), poststack deconvolution (Figure 2.6-26) and time-variant spectral whitening (Figure 2.6-27).
The following formal processing sequence for deconvolution theoretically should yield optimum results:
2.6-18. A portion of a CMP-stacked section with no deconvolution.
2.6-19. The section in Figure 26 -18 with signature processing to convert the recorded source signature to its minumum-phase equivalent.
2.6-20. The section in Figure 2 6-19 with prestack spiking deconvolution.
2.6-22. The section in Figure 2.6-21 with time-vanant spectral whitening.
2.6-23. A portion of a CMP-stacked section with no deconvolution.
2.6-24. The section in Figure 2 6-23 with signature processing to convert the recorded source signature to its minimum-phase equivalent.
2.6-25. The section in Figure 26 24 26 24 26-2426-242624 with prestack spikng deconvolution.
2.6-26. The section in Figure 2 e-25 with poststack spikıng deconvolution.
2.6-27. The section in Figure 2.6-26 with time-variant spectral whitening.
(a) Apply a geometric spreading compensation function to remove the amplitude loss due to wavefront divergence.
(b) Apply an exponential gain or minimum-phase inverse Q Q QQQ filter (Hale, 1982; Hargreaves and Calvert, 1991). This compensates for frequency attenuation.
(c) Optionally apply signature processing to marine data. For vibroseis data, apply the filter that converts the Klauder wavelet to its minimum-phase equivalent.
(d) Apply predictive deconvolution to compress the basic wavelet and attenuate reverberations and short-period multiples. If required, apply surfaceconsistent deconvolution (Section B.8). This accounts for the near-surface variations effect on the wavelet because of inhomogeneities in the vicinity of sources and receivers. In step (b), the vertical variations effect on the wavelet is handled.
(e) Apply predictive deconvolution after stack to broaden the spectrum and attenuate short-period multiples.
(f) Apply time-variant spectral whitening. This provides further flattening of the spectrum within the signal bandwidth without affecting phase.
The idea is to do as much deterministic deconvolution as posible. Inverse Q Q QQQ filtering, signature deconvolution, and the filter that converts the Klauder wavelet to its minimum-phase equivalent are deterministic operators. Any remaining issues then are handled by statistical means. However, for most data cases, just doing the geometric spreading correction followed by predictive prestack and poststack deconvolution is adequate.

EXERCISES

Exercise 2-1. Write the z z zzz-transform of wavelet ( 1 , 0 , 1 4 ) 1 , 0 , 1 4 (1,0,-(1)/(4))\left(1,0,-\frac{1}{4}\right)(1,0,14). Design a three-term inverse filter and apply it to the original. Hint: The z z zzz-transform of the wavelet can be written as a product of two doublets, ( 1 , 1 2 ) 1 , 1 2 (1,-(1)/(2))\left(1,-\frac{1}{2}\right)(1,12) and ( 1 , 1 2 ) 1 , 1 2 (1,(1)/(2))\left(1, \frac{1}{2}\right)(1,12).
Exercise 2-2. Consider the following set of wavelets:
Wavelet A: ( 3 , 2 , 1 ) ( 3 , 2 , 1 ) (3,-2,1)(3,-2,1)(3,2,1)
Wavelet B: ( 1 , 2 , 3 ) ( 1 , 2 , 3 ) (1,-2,3)(1,-2,3)(1,2,3)
(a) Plot the percent of cumulative energy as a function of time for each wavelet. Use Robinson's energy delay theorem to determine the minimum- and maximum-phase wavelet.
(b) Set up matrix equation (2-31) for each wavelet, compute the spiking deconvolution operators, then apply them. (c) Let the desired output be ( 0 , 0 , 1 , 0 ) ( 0 , 0 , 1 , 0 ) (0,0,1,0)(0,0,1,0)(0,0,1,0). Set up matrix equation (2-30) for each wavelet, compute the shaping filters, and apply them. Find that the error for wavelet B B BBB with the delayed spike is smaller.
Exercise 2-3. Consider wavelet A in Exercise 22. Set up matrix equation (2-32), where ε = 0.01 , 0.1 ε = 0.01 , 0.1 epsi=0.01,0.1\varepsilon=0.01,0.1ε=0.01,0.1. Note that ε = 0 ε = 0 epsi=0\varepsilon=0ε=0 already is assigned in Exercise 2-2. As the percent prewhitening increases, the spikiness of the deconvolution output decreases.
Exercise 2-4. Consider a multiple series associated with a water bottom with a reflection coefficient c w c w c_(w)c_{w}cw and two-way time t w t w t_(w)t_{w}tw. Design an inverse filter to suppress the multiples. [This is called the Backus filter (Backus, 1959)].
Exercise 2-5. Consider an earth model that comprises a water-bottom reflector and a deep reflector at two-way times of 500 and 750 m s 750 m s 750ms750 \mathrm{~ms}750 ms, respectively. What prediction lag and operator length should you choose to suppress (a) water-bottom multiples, and (b) pegleg multiples?
Exercise 2-6. Refer to Figure 2-6.9. Consider the following three bandwidths low ( F L ) F L (F_(L))\left(F_{L}\right)(FL), medium ( F M ) F M (F_(M))\left(F_{M}\right)(FM) and high ( F H ) F H (F_(H))\left(F_{H}\right)(FH), for TVSW application:
F L : 10 to 30 H z F M : 30 to 50 H z F H : 50 to 70 H z F L : 10  to  30 H z F M : 30  to  50 H z F H : 50  to  70 H z {:[F_(L):10" to "30Hz],[F_(M):30" to "50Hz],[F_(H):50" to "70Hz]:}\begin{aligned} & F_{L}: 10 \text { to } 30 \mathrm{~Hz} \\ & F_{M}: 30 \text { to } 50 \mathrm{~Hz} \\ & F_{H}: 50 \text { to } 70 \mathrm{~Hz} \end{aligned}FL:10 to 30 HzFM:30 to 50 HzFH:50 to 70 Hz
What kind of slopes should you assign to each bandwidth so that the output trace has an amplitude spectrum that is unity over the 10 10 10-10-10 to 70 H z 70 H z -70-Hz-70-\mathrm{Hz}70Hz bandwidth?
Exercise 2-7. If the signal character down the trace changes rapidly (strong nonstationarity), should you consider narrow or broad bandwidths for the filters used in TVSW?
Exercise 2-8. Consider a minimum-phase wavelet and the following two processes applied to it:
(a) Spiking deconvolution followed by 10 t o 50 H z 10 t o 50 H z 10-to-50-Hz10-\mathrm{to}-50-\mathrm{Hz}10to50Hz zero-phase band-pass filtering.
(b) Shaping filter to convert the minimum-phase wavelet to a 10 t o 50 H z 10 t o 50 H z 10-to-50-Hz10-\mathrm{to}-50 \mathrm{-Hz}10to50Hz zero-phase wavelet.
What is the difference between the two outputs?
Exercise 2-9. How would you design a minimumphase band-pass filter operator?
Exercise 2-10. Consider (a) convolving a minimum-phase wavelet with a zero-phase wavelet, (b) convolving a minimum-phase wavelet with a minimumphase wavelet, and (c) adding two minimum-phase wavelets. Are the resulting wavelets minimum-phase?
Exercise 2-11. Consider the sinusoid shown in Figure 1-1 (frame 1) as input to spiking deconvolution. What is the output?
Exercise 2-12. Order the panels in Figure 2.E-1 with increasing prediction lag.
2.E-1. The shot record shown in Figure 2.4-36c after predıtive deconvolution using an operator length of 480 ms, and four different prediction lags (Exercise 2-12). The amplitude spectra averaged over the shot record are shown at the top and the autocorrelograms are shown at the bottom.

Appendix B MATHEMATICAL FOUNDATION OF DECONVOLUTION

B. 1 Synthetic Seismogram

Consider an earth model that consists of homogeneous horizontal layers with thicknesses corresponding to the sampling interval. The seismic impedance associated with a layer is defined as I = ρ v I = ρ v I=rho vI=\rho vI=ρv, where ρ ρ rho\rhoρ is density and v v vvv is the compressional-wave velocity within the layer. The instantaneous value of seismic inpedance for the k k kkk th layer is given by
I k = ρ k v k I k = ρ k v k I_(k)=rho_(k)v_(k)I_{k}=\rho_{k} v_{k}Ik=ρkvk
For a vertically incident plane wave, the pressure amplitude reflection coefficient absociated with an interface is given by
c k = I k + 1 I k I k + 1 + I k c k = I k + 1 I k I k + 1 + I k c_(k)=(I_(k+1)-I_(k))/(I_(k+1)+I_(k))c_{k}=\frac{I_{k+1}-I_{k}}{I_{k+1}+I_{k}}ck=Ik+1IkIk+1+Ik
Assume that the change of density with depth is negligible compared to the change of velocity with depth. Equation (B-2) then takes the form
c k = v k + 1 v k v k + 1 + v k . c k = v k + 1 v k v k + 1 + v k . c_(k)=(v_(k+1)-v_(k))/(v_(k+1)+v_(k)).c_{k}=\frac{v_{k+1}-v_{k}}{v_{k+1}+v_{k}} .ck=vk+1vkvk+1+vk.
If the amplitude of the incident wave is unity, then the magnitude of the reflection coefficient corresponds to the fraction of amplitude reflected from the interface.
With knowledge of the reflection coefficients, we can compute the impulse response of a horizontally layered earth model using the Kunetz method (Claerbout, 1976). The impulse response contains not only the primary reflections, but also all the possible multiples. Finally, convolution of the impulse response with a source wavelet yields the synthetic seismogram.
Although random noise can be added to the seismogram, the convolutional model used here to establish the deconvolution filters does not include random noise. We also assume that the source waveform does not change as it propagates down into the earth; hence, the convolutional model does not include intrinsic attenuation. The convolution of a seismic wavelet w ( t ) w ( t ) w(t)w(t)w(t) with the impulse response e ( t ) e ( t ) e(t)e(t)e(t) yields the seismogram x ( t ) x ( t ) x(t)x(t)x(t)
x ( t ) = w ( t ) e ( t ) x ( t ) = w ( t ) e ( t ) x(t)=w(t)**e(t)x(t)=w(t) * e(t)x(t)=w(t)e(t)
By Fourier transforming both sides, we get
X ( ω ) = W ( ω ) E ( ω ) X ( ω ) = W ( ω ) E ( ω ) X(omega)=W(omega)E(omega)X(\omega)=W(\omega) E(\omega)X(ω)=W(ω)E(ω)
where X ( ω ) , W ( ω ) X ( ω ) , W ( ω ) X(omega),W(omega)X(\omega), W(\omega)X(ω),W(ω), and E ( ω ) E ( ω ) E(omega)E(\omega)E(ω) represent the complex Fourier transforms of the seismogram, the source waveform, and the impulse response, respectively. In terms of amplitude and phase spectra, the Fourier transforms are expressed as
X ( ω ) = A σ ( ω ) exp [ i ϕ τ ( ω ) ] , ( B 6 a ) W ( ω ) = A w ( ω ) exp [ i ϕ w ( ω ) ] , ( B 6 b ) X ( ω ) = A σ ( ω ) exp i ϕ τ ( ω ) , ( B 6 a ) W ( ω ) = A w ( ω ) exp i ϕ w ( ω ) , ( B 6 b ) {:[X(omega)=A_(sigma)(omega)exp[iphi_(tau)(omega)]","(B-6a)],[W(omega)=A_(w)(omega)exp[iphi_(w)(omega)]","(B-6b)]:}\begin{aligned} X(\omega)=A_{\sigma}(\omega) \exp \left[i \phi_{\tau}(\omega)\right], & (B-6 a) \\ W(\omega)=A_{w}(\omega) \exp \left[i \phi_{w}(\omega)\right], & (B-6 b) \end{aligned}X(ω)=Aσ(ω)exp[iϕτ(ω)],(B6a)W(ω)=Aw(ω)exp[iϕw(ω)],(B6b)
and
E ( ω ) = A e ( ω ) exp [ ı ϕ e ( ω ) ] E ( ω ) = A e ( ω ) exp ı ϕ e ( ω ) E(omega)=A_(e)(omega)exp[ıphi_(e)(omega)]E(\omega)=A_{e}(\omega) \exp \left[\imath \phi_{e}(\omega)\right]E(ω)=Ae(ω)exp[ıϕe(ω)]
By substituting equations (B-6) into equation (B-5), we have
A x ( ω ) = A w ( ω ) A e ( ω ) A x ( ω ) = A w ( ω ) A e ( ω ) A_(x)(omega)=A_(w)(omega)A_(e)(omega)A_{x}(\omega)=A_{w}(\omega) A_{e}(\omega)Ax(ω)=Aw(ω)Ae(ω)
and
ϕ x ( ω ) = ϕ w ( ω ) + ϕ e ( ω ) ϕ x ( ω ) = ϕ w ( ω ) + ϕ e ( ω ) phi_(x)(omega)=phi_(w)(omega)+phi_(e)(omega)\phi_{x}(\omega)=\phi_{w}(\omega)+\phi_{e}(\omega)ϕx(ω)=ϕw(ω)+ϕe(ω)
Hence, in convolving the seismic wavelet with the impulse response, their phase spectra are added, while the amplitude spectra are multiplied.
We assume that the earth's impulse response can be represented by a white reflectivity series; hence, its amplitude spectrum is flat
A c ( ω ) = A 0 = constant A c ( ω ) = A 0 =  constant  A_(c)(omega)=A_(0)=" constant "A_{c}(\omega)=A_{0}=\text { constant }Ac(ω)=A0= constant 
By substituting into equation (B-7a), we obtain
A x ( ω ) = A 0 A w ( ω ) . A x ( ω ) = A 0 A w ( ω ) . A_(x)(omega)=A_(0)A_(w)(omega).A_{x}(\omega)=A_{0} A_{w}(\omega) .Ax(ω)=A0Aw(ω).
This implies that the amplitude spectrum of the seismogram is a scaled version of the amplitude spectrum of the source wavelet.
We now examine the autocorrelation functions r ( τ ) r ( τ ) r(tau)r(\tau)r(τ) of x ( t ) , w ( t ) x ( t ) , w ( t ) x(t),w(t)x(t), w(t)x(t),w(t), and e ( t ) e ( t ) e(t)e(t)e(t). Autocorrelation is a measure of similarity between the events on a time series at different time positions. It is a running sum given by the expresision
r e ( τ ) = 1 N t = 0 N 1 e t e t + τ , τ = 0 , 1 , 2 , , ( N 1 ) r e ( τ ) = 1 N t = 0 N 1 e t e t + τ , τ = 0 , 1 , 2 , , ( N 1 ) r_(e)(tau)=(1)/(N)sum_(t=0)^(N-1)e_(t)e_(t+tau),quad tau=0,∓1,∓2,dots,∓(N-1)r_{\mathrm{e}}(\tau)=\frac{1}{N} \sum_{t=0}^{N-1} e_{t} e_{t+\tau}, \quad \tau=0, \mp 1, \mp 2, \ldots, \mp(N-1)re(τ)=1Nt=0N1etet+τ,τ=0,1,2,,(N1)
where τ τ tau\tauτ is time lag. A random time series is an uncorrelated series. (Strictly, it is uncorrelated when it is continuous and infinitely long.) Therefore,
r e ( τ ) = 0 , τ = 0 r e ( τ ) = 0 , τ = 0 r_(e)(tau)=0,quad tau=0r_{e}(\tau)=0, \quad \tau=0re(τ)=0,τ=0
and
r e ( 0 ) = r 0 = constant. r e ( 0 ) = r 0 =  constant.  r_(e)(0)=r_(0)=" constant. "r_{e}(0)=r_{0}=\text { constant. }re(0)=r0= constant. 
Equation (B-11) states that the autocorrelation of a perfect random series is zero at all lags except at zero lag. The zerolag value actually is the cumulative energy containod in the time series:
r 0 = e 0 2 + e 1 2 + + e N 1 2 r 0 = e 0 2 + e 1 2 + + e N 1 2 r_(0)=e_(0)^(2)+e_(1)^(2)+cdots+e_(N-1)^(2)r_{0}=e_{0}^{2}+e_{1}^{2}+\cdots+e_{N-1}^{2}r0=e02+e12++eN12
Consider the z z zzz-transform of the convolutional model in equation (B-4):
X ( z ) = W ( z ) E ( z ) . X ( z ) = W ( z ) E ( z ) . X(z)=W(z)E(z).X(z)=W(z) E(z) .X(z)=W(z)E(z).
By putting 1 / z 1 / z 1//z1 / z1/z in place of z z zzz and taking the complex conjugate, we get
X ¯ ( 1 / z ) = W ¯ ( 1 / z ) E ¯ ( 1 / z ) X ¯ ( 1 / z ) = W ¯ ( 1 / z ) E ¯ ( 1 / z ) bar(X)(1//z)= bar(W)(1//z) bar(E)(1//z)\bar{X}(1 / z)=\bar{W}(1 / z) \bar{E}(1 / z)X¯(1/z)=W¯(1/z)E¯(1/z)
where the bar denotes the complex conjugate. By multiplying both sides of equations ( B 13 B 13 B-13\mathrm{B}-13B13 ) and (B-14), we get
X ( z ) X ¯ ( 1 / z ) = [ W ( z ) E ( z ) ] [ W ( 1 / z ) E ¯ ( 1 / z ) ] X ( z ) X ¯ ( 1 / z ) = [ W ( z ) E ( z ) ] [ W ( 1 / z ) E ¯ ( 1 / z ) ] X(z) bar(X)(1//z)=[W(z)E(z)][W(1//z) bar(E)(1//z)]X(z) \bar{X}(1 / z)=[W(z) E(z)][W(1 / z) \bar{E}(1 / z)]X(z)X¯(1/z)=[W(z)E(z)][W(1/z)E¯(1/z)]
By rearranging the right side,
X ( z ) X ¯ ( 1 / z ) = [ W ( z ) W ¯ ( 1 / z ) ] [ E ( z ) E ¯ ( 1 / z ) ] X ( z ) X ¯ ( 1 / z ) = [ W ( z ) W ¯ ( 1 / z ) ] [ E ( z ) E ¯ ( 1 / z ) ] X(z) bar(X)(1//z)=[W(z) bar(W)(1//z)][E(z) bar(E)(1//z)]X(z) \bar{X}(1 / z)=[W(z) \bar{W}(1 / z)][E(z) \bar{E}(1 / z)]X(z)X¯(1/z)=[W(z)W¯(1/z)][E(z)E¯(1/z)]
Finally, by definition, equation (B-16) yields
r x = r w r ε r x = r w r ε r_(x)=r_(w)**r_(epsi)r_{x}=r_{w} * r_{\varepsilon}rx=rwrε
where r x , r w r x , r w r_(x),r_(w)r_{x}, r_{w}rx,rw, and r e r e r_(e)r_{e}re are the autocorrelations of the seismogram, seismic wavelet, and impulse response, respectively. Based on the white reflectivity series assumption (equation B-11), we have
r x = r 0 r w r x = r 0 r w r_(x)=r_(0)r_(w)r_{x}=r_{0} r_{w}rx=r0rw
Equation (B-18) states that the autocorrelation of the seismogram is a scaled version of that of the seismic wavelet. We will see that conversion of the seismic wavelet into a zero-lag spike requires knowledge of the wavelet's autocorrelation. Equation (B-18) suggests that the autocorrelation of the seismogram can be used in lieu of that of the seismic wavelet, since the latter often is not known.

B. 2 The Inverse of the Source Wavelet

A basic purpose of deconvolution is to compress the source waveform into a zero-lag spike so that closely spaced reflections can be resolved. Assume that a fiter operator f ( t ) f ( t ) f(t)f(t)f(t) exists such that
w ( t ) f ( t ) = δ ( t ) w ( t ) f ( t ) = δ ( t ) w(t)**f(t)=delta(t)w(t) * f(t)=\delta(t)w(t)f(t)=δ(t)
where δ ( t ) δ ( t ) delta(t)\delta(t)δ(t) is the Kronecker delta function. The filter f ( t ) f ( t ) f(t)f(t)f(t) is called the inverse filter for w ( t ) w ( t ) w(t)w(t)w(t). Symbolically, f ( t ) f ( t ) f(t)f(t)f(t) is expressed in terms of the seismic wavelet w ( t ) w ( t ) w(t)w(t)w(t) as
f ( t ) = δ ( t ) 1 w ( t ) f ( t ) = δ ( t ) 1 w ( t ) f(t)=delta(t)**(1)/(w(t))f(t)=\delta(t) * \frac{1}{w(t)}f(t)=δ(t)1w(t)
The z z zzz-transform of the seismic wavelet with a finite length m + 1 m + 1 m+1m+1m+1 is (Appendix A A AAA )
W ( z ) = w 0 + w 1 z + w 2 z 2 + + w m z m W ( z ) = w 0 + w 1 z + w 2 z 2 + + w m z m W(z)=w_(0)+w_(1)z+w_(2)z^(2)+cdots+w_(m)z^(m)W(z)=w_{0}+w_{1} z+w_{2} z^{2}+\cdots+w_{m} z^{m}W(z)=w0+w1z+w2z2++wmzm
The z z zzz-transform of the inverse filter can be obtained by polynomial division:
F ( z ) = 1 W ( z ) F ( z ) = 1 W ( z ) F(z)=(1)/(W(z))F(z)=\frac{1}{W(z)}F(z)=1W(z)
The result is another polynomial whose coefficients are the terms of the inverse filter
F ( z ) = f 0 + f 1 z + f 2 z 2 + + f n z n + F ( z ) = f 0 + f 1 z + f 2 z 2 + + f n z n + F(z)=f_(0)+f_(1)z+f_(2)z^(2)+cdots+f_(n)z^(n)+cdotsF(z)=f_{0}+f_{1} z+f_{2} z^{2}+\cdots+f_{n} z^{n}+\cdotsF(z)=f0+f1z+f2z2++fnzn+
Note that the polynomial F ( z ) F ( z ) F(z)F(z)F(z) in equation (B-23) has only positive powers of z z zzz; this means f ( t ) f ( t ) f(t)f(t)f(t) is causal. If the coefficients of F ( z ) F ( z ) F(z)F(z)F(z) asymptotically approach zero as time goes to infinity, so that the filter has finite energy, we say that the filter f ( t ) f ( t ) f(t)f(t)f(t) is realizable. If the coefficients increase without bound, we say that the filter is not realizable. In practice, we prefer to work with a causal and realizable filter. Such a filter, by definition, also is minimum-phase. If f ( t ) f ( t ) f(t)f(t)f(t) is minimum-phase, then the seismic wavelet w ( t ) w ( t ) w(t)w(t)w(t) also must be minimum-phase. Finally, to apply the filter with a finite length n + 1 n + 1 n+1n+1n+1, the polynomial F ( z ) F ( z ) F(z)F(z)F(z) must be truncated. Truncation of the fiter operator induces some error in spiking the seismic wavelet.
The inverse of the seismic wavelet also can be computed in the frequency domain. By Fourier transforming equation (B-19), we get
W ( ω ) F ( ω ) = 1 W ( ω ) F ( ω ) = 1 W(omega)F(omega)=1W(\omega) F(\omega)=1W(ω)F(ω)=1
By substituting equation (B-6b), we obtain
F ( ω ) = 1 A w ( ω ) exp [ i ϕ w ( ω ) ] F ( ω ) = 1 A w ( ω ) exp i ϕ w ( ω ) F(omega)=(1)/(A_(w)(omega)exp[iphi_(w)(omega)])F(\omega)=\frac{1}{A_{w}(\omega) \exp \left[i \phi_{w}(\omega)\right]}F(ω)=1Aw(ω)exp[iϕw(ω)]
We express the Fourier transform of the inverse filter F ( ω ) F ( ω ) F(omega)F(\omega)F(ω) as
F ( ω ) = A f ( ω ) exp [ ϕ f ( ω ) ] F ( ω ) = A f ( ω ) exp ϕ f ( ω ) F(omega)=A_(f)(omega)exp[phi_(f)(omega)]F(\omega)=A_{f}(\omega) \exp \left[\phi_{f}(\omega)\right]F(ω)=Af(ω)exp[ϕf(ω)]
and compare it with equation (B-25) to get
A f ( ω ) = 1 A w ( ω ) A f ( ω ) = 1 A w ( ω ) A_(f)(omega)=(1)/(A_(w)(omega))A_{f}(\omega)=\frac{1}{A_{w}(\omega)}Af(ω)=1Aw(ω)
and
ϕ f ( ω ) = ϕ ω ( ω ) ϕ f ( ω ) = ϕ ω ( ω ) phi_(f)(omega)=-phi_(omega)(omega)\phi_{f}(\omega)=-\phi_{\omega}(\omega)ϕf(ω)=ϕω(ω)
Equations (B-27) show that the amplitude spectrum of the inverse filter is the inverse of that of the seismic wavelet, and the phase spectrum of the inverse filter is negative of that of the seismic wavelet.

B. 3 The Inverse Filter

Instead of the polynomial division procedure described by equation (B-22), consider a different approach to derive the inverse filter. Start with the z z zzz-transform of the autocorrelation of the seismic wavelet:
R w ( z ) = W ( z ) W ¯ ( 1 / z ) , . ( B 28 ) R w ( z ) = W ( z ) W ¯ ( 1 / z ) , . ( B 28 ) R_(w)(z)=W(z) bar(W)(1//z),quad.quad(B-28)R_{w}(z)=W(z) \bar{W}(1 / z), \quad . \quad(B-28)Rw(z)=W(z)W¯(1/z),.(B28)
and the z z zzz-transform of equation (B-19):
W ( z ) F ( z ) = 1 W ( z ) F ( z ) = 1 W(z)F(z)=1W(z) F(z)=1W(z)F(z)=1
from which we get
W ( z ) = 1 F ( z ) W ( z ) = 1 F ( z ) W(z)=(1)/(F(z))W(z)=\frac{1}{F(z)}W(z)=1F(z)
By substituting into equation (B-28), we obtain
R w ( z ) F ( z ) = W ¯ ( 1 / z ) R w ( z ) F ( z ) = W ¯ ( 1 / z ) R_(w)(z)F(z)= bar(W)(1//z)R_{w}(z) F(z)=\bar{W}(1 / z)Rw(z)F(z)=W¯(1/z)
Since the wavelet is a real-time function,
r w ( τ ) = r w ( τ ) r w ( τ ) = r w ( τ ) r_(w)(tau)=r_(w)(-tau)r_{w}(\tau)=r_{w}(-\tau)rw(τ)=rw(τ)
Consider the special case of a threepoint inverse filter ( f 0 , f 1 , f 2 ) f 0 , f 1 , f 2 (f_(0),f_(1),f_(2))\left(f_{0}, f_{1}, f_{2}\right)(f0,f1,f2). We will assume that the seismic wavelet w ( t ) w ( t ) w(t)w(t)w(t) is minimum-phase (causal and realizable); hence, its inverse f ( t ) f ( t ) f(t)f(t)f(t) also is minimum-phase. The z z zzz-transform of f ( t ) f ( t ) f(t)f(t)f(t) is
F ( z ) = f 0 + f 1 z + f 2 z 2 F ( z ) = f 0 + f 1 z + f 2 z 2 F(z)=f_(0)+f_(1)z+f_(2)z^(2)F(z)=f_{0}+f_{1} z+f_{2} z^{2}F(z)=f0+f1z+f2z2
The z z zzz-transform of its autocorrelogram r w ( τ ) r w ( τ ) r_(w)(tau)r_{w}(\tau)rw(τ) is, by way of equation (B-32),
R w ( z ) = + r 2 z 2 + r 1 z 1 + r 0 + r 1 z + r 2 z 2 + R w ( z ) = + r 2 z 2 + r 1 z 1 + r 0 + r 1 z + r 2 z 2 + R_(w)(z)=cdots+r_(2)z^(-2)+r_(1)z^(-1)+r_(0)+r_(1)z+r_(2)z^(2)+cdotsR_{w}(z)=\cdots+r_{2} z^{-2}+r_{1} z^{-1}+r_{0}+r_{1} z+r_{2} z^{2}+\cdotsRw(z)=+r2z2+r1z1+r0+r1z+r2z2+
The z z zzz-transform of w ( t ) w ( t ) w(t)w(t)w(t) is
W ( z ) = w 0 + w 1 z + w 2 z 2 + + w m z m W ( z ) = w 0 + w 1 z + w 2 z 2 + + w m z m W(z)=w_(0)+w_(1)z+w_(2)z^(2)+cdots+w_(m)z^(m)W(z)=w_{0}+w_{1} z+w_{2} z^{2}+\cdots+w_{m} z^{m}W(z)=w0+w1z+w2z2++wmzm
therefore,
W ¯ ( 1 / z ) = w ¯ 0 + w ¯ 1 z + w ¯ 2 z 2 + + w ¯ m z m W ¯ ( 1 / z ) = w ¯ 0 + w ¯ 1 z + w ¯ 2 z 2 + + w ¯ m z m bar(W)(1//z)= bar(w)_(0)+ bar(w)_(1)z+ bar(w)_(2)z^(2)+cdots+ bar(w)_(m)z^(m)\bar{W}(1 / z)=\bar{w}_{0}+\bar{w}_{1} z+\bar{w}_{2} z^{2}+\cdots+\bar{w}_{m} z^{m}W¯(1/z)=w¯0+w¯1z+w¯2z2++w¯mzm
By substituting equations (B-33a), (B-33b), and (B-33c) into equation (B-31), we obtain
( r 2 z 2 + r 1 z 1 ¯ r 0 + r 1 z + r 2 z 2 ) ( f 0 + f 1 z + f 2 z 2 ) = w ¯ 0 + w ¯ 1 z 1 + w ¯ 2 z 2 r 2 z 2 + r 1 z 1 ¯ r 0 + r 1 z + r 2 z 2 f 0 + f 1 z + f 2 z 2 = w ¯ 0 + w ¯ 1 z 1 + w ¯ 2 z 2 (r_(2)z^(-2)+r_(1)z^(- bar(1))r_(0)+r_(1)z+r_(2)z^(2))(f_(0)+f_(1)z+f_(2)z^(2))= bar(w)_(0)+ bar(w)_(1)z^(-1)+ bar(w)_(2)z^(-2)\left(r_{2} z^{-2}+r_{1} z^{-\overline{1}} r_{0}+r_{1} z+r_{2} z^{2}\right)\left(f_{0}+f_{1} z+f_{2} z^{2}\right)=\bar{w}_{0}+\bar{w}_{1} z^{-1}+\bar{w}_{2} z^{-2}(r2z2+r1z1¯r0+r1z+r2z2)(f0+f1z+f2z2)=w¯0+w¯1z1+w¯2z2
To solve for ( f 0 , f 1 , f 2 ) f 0 , f 1 , f 2 (f_(0),f_(1),f_(2))\left(f_{0}, f_{1}, f_{2}\right)(f0,f1,f2), we identify the coefficients of powers of z z zzz. The coefficient of z 0 z 0 z^(0)z^{0}z0 yields
r 0 f 0 + r 1 f 1 + r 2 f 2 = w ¯ 0 r 0 f 0 + r 1 f 1 + r 2 f 2 = w ¯ 0 r_(0)f_(0)+r_(1)f_(1)+r_(2)f_(2)= bar(w)_(0)r_{0} f_{0}+r_{1} f_{1}+r_{2} f_{2}=\bar{w}_{0}r0f0+r1f1+r2f2=w¯0
the coefficient of z 1 z 1 z^(1)z^{1}z1 yields
r 1 f 0 + r 0 f 1 + r 1 f 2 = 0 r 1 f 0 + r 0 f 1 + r 1 f 2 = 0 r_(1)f_(0)+r_(0)f_(1)+r_(1)f_(2)=0r_{1} f_{0}+r_{0} f_{1}+r_{1} f_{2}=0r1f0+r0f1+r1f2=0
while the coefficient of z 2 z 2 z^(2)z^{2}z2 yiclds
r 2 f 0 + r 1 f 1 + r 0 f 2 = 0 r 2 f 0 + r 1 f 1 + r 0 f 2 = 0 r_(2)f_(0)+r_(1)f_(1)+r_(0)f_(2)=0r_{2} f_{0}+r_{1} f_{1}+r_{0} f_{2}=\mathbf{0}r2f0+r1f1+r0f2=0
When put into matrix form, these equations for the coefficients of powers of z z zzz yield
( r 0 r 1 r 2 r 1 r 0 r 2 r 2 r 1 r 0 ) ( f 0 f 1 f 2 ) = ( w ¯ 0 0 0 ) r 0 r 1 r 2 r 1 r 0 r 2 r 2 r 1 r 0 f 0 f 1 f 2 = w ¯ 0 0 0 ([r_(0),r_(1),r_(2)],[r_(1),r_(0),r_(2)],[r_(2),r_(1),r_(0)])([f_(0)],[f_(1)],[f_(2)])=([ bar(w)_(0)],[0],[0])\left(\begin{array}{lll} r_{0} & r_{1} & r_{2} \\ r_{1} & r_{0} & r_{2} \\ r_{2} & r_{1} & r_{0} \end{array}\right)\left(\begin{array}{l} f_{0} \\ f_{1} \\ f_{2} \end{array}\right)=\left(\begin{array}{c} \bar{w}_{0} \\ 0 \\ 0 \end{array}\right)(r0r1r2r1r0r2r2r1r0)(f0f1f2)=(w¯000)
Note that w ¯ 0 w ¯ 0 bar(w)_(0)\bar{w}_{0}w¯0, which equals w 0 w 0 w_(0)w_{0}w0 for the usual case of a real source wavelet, is the amplitude of the wavelet at t = 0 t = 0 t=0t=0t=0. There are four unknowns and three equations. By normalizing with respect to f 0 f 0 f_(0)f_{0}f0, we get
( r 0 r 1 r 2 r 1 r 0 r 1 r 2 r 1 r 0 ) ( 1 a 1 a 2 ) = ( L 0 0 ) r 0 r 1 r 2 r 1 r 0 r 1 r 2 r 1 r 0 1 a 1 a 2 = L 0 0 ([r_(0),r_(1),r_(2)],[r_(1),r_(0),r_(1)],[r_(2),r_(1),r_(0)])([1],[a_(1)],[a_(2)])=([L],[0],[0])\left(\begin{array}{lll} r_{0} & r_{1} & r_{2} \\ r_{1} & r_{0} & r_{1} \\ r_{2} & r_{1} & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ a_{1} \\ a_{2} \end{array}\right)=\left(\begin{array}{l} L \\ 0 \\ 0 \end{array}\right)(r0r1r2r1r0r1r2r1r0)(1a1a2)=(L00)
where a 1 = f 1 / f 0 , a 2 = f 2 / f 0 a 1 = f 1 / f 0 , a 2 = f 2 / f 0 a_(1)=f_(1)//f_(0),a_(2)=f_(2)//f_(0)a_{1}=f_{1} / f_{0}, a_{2}=f_{2} / f_{0}a1=f1/f0,a2=f2/f0, and L = w 0 / f 0 L = w 0 / f 0 L=w_(0)//f_(0)L=w_{0} / f_{0}L=w0/f0. We now have three unknowns, a 1 , a 2 a 1 , a 2 a_(1),a_(2)a_{1}, a_{2}a1,a2, and L L LLL, and three equations. The square matrix elements on the left side of the cquation represent the autocorrelation lags of the seismic wavelet, which we do not know. However, the autocorrelation lags from equation (B-18) of the seismogram that we do know can be substituted.
For the general case of an n n nnn-point inverse filter ( f 0 , f 1 , f 2 , , f n f 0 , f 1 , f 2 , , f n (f_(0),f_(1),f_(2),dots,f_(n):}\left(f_{0}, f_{1}, f_{2}, \ldots, f_{n}\right.(f0,f1,f2,,fn ), equation (B-36a) takes the form
( r 0 r 1 r 2 r n r 1 r 0 r 1 r n 1 r 2 r 1 r 0 r n 2 r n r n 1 r n 2 r 0 ) ( 1 a 1 a 2 a n 1 ) = ( L 0 0 0 ) . r 0 r 1 r 2 r n r 1 r 0 r 1 r n 1 r 2 r 1 r 0 r n 2 r n r n 1 r n 2 r 0 1 a 1 a 2 a n 1 = L 0 0 0 . ([r_(0),r_(1),r_(2),cdots,r_(n)],[r_(1),r_(0),r_(1),cdots,r_(n-1)],[r_(2),r_(1),r_(0),cdots,r_(n-2)],[vdots,vdots,vdots,ddots,vdots],[r_(n),r_(n-1),r_(n-2),cdots,r_(0)])([1],[a_(1)],[a_(2)],[vdots],[a_(n-1)])=([L],[0],[0],[vdots],[0]).\left(\begin{array}{ccccc} r_{0} & r_{1} & r_{2} & \cdots & r_{n} \\ r_{1} & r_{0} & r_{1} & \cdots & r_{n-1} \\ r_{2} & r_{1} & r_{0} & \cdots & r_{n-2} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n} & r_{n-1} & r_{n-2} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ a_{1} \\ a_{2} \\ \vdots \\ a_{n-1} \end{array}\right)=\left(\begin{array}{c} L \\ 0 \\ 0 \\ \vdots \\ 0 \end{array}\right) .(r0r1r2rnr1r0r1rn1r2r1r0rn2rnrn1rn2r0)(1a1a2an1)=(L000).
The autocorrelation matrix in equation (B-36b) is of a special type. First, it is a symmetric matrix; second, its diagonal elements are identical. This type of matrix is called a Toeplitz matrix, For n n nnn number of normal equations, the standard algorithms require a memory space that is proportional to n 2 n 2 n^(2)n^{2}n2 and CPU time that is proportional to n 3 n 3 n^(3)n^{3}n3. Because of the special properties of the Toeplitz matrix, Levinson devised a recursive scheme (Claerbout, 1976) that requires a memory space and CPU time proportional to n n nnn and n 2 n 2 n^(2)n^{2}n2, respectively (Section B.6).

B. 4 Frequency-Domain Deconvolution

We want to estimate a minimum-phase wavelet from the recorded seismogram. The inverse of the wavelet is the spiking deconvolution operator. We start with the autocorrelation of the seismic wavelet w ( t ) w ( t ) w(t)w(t)w(t) in the frequency domain:
R ω ( ω ) = W ( ω ) W ¯ ( ω ) R ω ( ω ) = W ( ω ) W ¯ ( ω ) R_(omega)(omega)=W(omega) bar(W)(omega)R_{\omega}(\omega)=W(\omega) \bar{W}(\omega)Rω(ω)=W(ω)W¯(ω)
where W ¯ ( ω ) W ¯ ( ω ) bar(W)(omega)\bar{W}(\omega)W¯(ω) is the complex conjugate of the Fourier transform of w ( t ) w ( t ) w(t)w(t)w(t). Since w ( t ) w ( t ) w(t)w(t)w(t) normally is not known, R n ( ω ) R n ( ω ) R_(n)(omega)R_{n}(\omega)Rn(ω) is not known. However, based on an assumption of white reflectivity series (equation B-18), we can substitute the a.ntocorrelation function of the seismogram in equation (B-37).
Define a new function U ( ω ) U ( ω ) U(omega)U(\omega)U(ω) :
U ( ω ) = ln [ R w ( ω ) ] U ( ω ) = ln R w ( ω ) U(omega)=ln[R_(w)(omega)]U(\omega)=\ln \left[R_{w}(\omega)\right]U(ω)=ln[Rw(ω)]
When both sides of equation (B-38) are exponentiated:
R w ( ω ) = exp [ U ( ω ) ] R w ( ω ) = exp [ U ( ω ) ] R_(w)(omega)=exp[U(omega)]R_{w}(\omega)=\exp [U(\omega)]Rw(ω)=exp[U(ω)]
Suppose that another function, ϕ ( ω ) ϕ ( ω ) phi(omega)\phi(\omega)ϕ(ω), is defined and that equation (B-39) is rewritten as (Claerbout, 1976)
R w ( ω ) = exp { 1 2 [ U ( ω ) + ı ϕ ( ω ) ] } exp { 1 2 [ U ( ω ) i ϕ ( ω ) ] } R w ( ω ) = exp 1 2 [ U ( ω ) + ı ϕ ( ω ) ] exp 1 2 [ U ( ω ) i ϕ ( ω ) ] R_(w)(omega)=exp{(1)/(2)[U(omega)+ıphi(omega)]}exp{(1)/(2)[U(omega)-i phi(omega)]}R_{w}(\omega)=\exp \left\{\frac{1}{2}[U(\omega)+\imath \phi(\omega)]\right\} \exp \left\{\frac{1}{2}[U(\omega)-i \phi(\omega)]\right\}Rw(ω)=exp{12[U(ω)+ıϕ(ω)]}exp{12[U(ω)iϕ(ω)]}
When equation (B-40) is compared with equation (B-37), we see that
W ( ω ) = exp { 1 2 [ U ( ω ) + ı ϕ ( ω ) ] } W ( ω ) = exp 1 2 [ U ( ω ) + ı ϕ ( ω ) ] W(omega)=exp{(1)/(2)[U(omega)+ıphi(omega)]}W(\omega)=\exp \left\{\frac{1}{2}[U(\omega)+\imath \phi(\omega)]\right\}W(ω)=exp{12[U(ω)+ıϕ(ω)]}
We know R w ( ω ) R w ( ω ) R_(w)(omega)R_{w}(\omega)Rw(ω) from equation (B-18) and therefore we know U ( ω ) U ( ω ) U(omega)U(\omega)U(ω) from equation (B-38). To estimate W ( ω ) W ( ω ) W(omega)W(\omega)W(ω) from equation (B-41), we also need to know ϕ ( ω ) ϕ ( ω ) phi(omega)\phi(\omega)ϕ(ω). If we make the minimumphase assumption, ϕ ( ω ) ϕ ( ω ) phi(omega)\phi(\omega)ϕ(ω) turns out to be the Hilbert transforn of U ( ω ) U ( ω ) U(omega)U(\omega)U(ω) (Claerbout, 1976). To perform the Hilbert transform, first inverse Fourier transform U ( ω ) U ( ω ) U(omega)U(\omega)U(ω) back to the time domain. Then, double the positive time values, leave the zero-lag alone, and set the negative time values to zero. This operation yields a time function u + ( t ) u + ( t ) u^(+)(t)u^{+}(t)u+(t), which vanishes before t = 0 t = 0 t=0t=0t=0. Then, return to the transform domain to get
U + ( ω ) = 1 2 [ U ( ω ) + i ϕ ( ω ) ] U + ( ω ) = 1 2 [ U ( ω ) + i ϕ ( ω ) ] U^(+)(omega)=(1)/(2)[U(omega)+i phi(omega)]U^{+}(\omega)=\frac{1}{2}[U(\omega)+i \phi(\omega)]U+(ω)=12[U(ω)+iϕ(ω)]
where U + ( ω ) U + ( ω ) U^(+)(omega)U^{+}(\omega)U+(ω) is the Fourier transform of u + ( t ) u + ( t ) u^(+)(t)u^{+}(t)u+(t). Finally, exponentiating U + ( ω ) U + ( ω ) U^(+)(omega)U^{+}(\omega)U+(ω) yields the Fourier transform W ( ω ) W ( ω ) W(omega)W(\omega)W(ω) of the minimum-phase wavelet w ( t ) w ( t ) w(t)w(t)w(t) (equation B-41).
Once the minimum phase wavelet w ( t ) w ( t ) w(t)w(t)w(t) is estimated, its Fourier transform W ( ω ) W ( ω ) W(omega)W(\omega)W(ω) is rewritten in terms of its amplitude and phase spectra,
W ( ω ) = A ( ω ) exp [ i ϕ ( ω ) ] W ( ω ) = A ( ω ) exp [ i ϕ ( ω ) ] W(omega)=A(omega)exp[i phi(omega)]W(\omega)=A(\omega) \exp [i \phi(\omega)]W(ω)=A(ω)exp[iϕ(ω)]
The deconvolution filter in the Fourier transform domain is
F ( ω ) = 1 W ( ω ) F ( ω ) = 1 W ( ω ) F(omega)=(1)/(W(omega))F(\omega)=\frac{1}{W(\omega)}F(ω)=1W(ω)
By substituting equation (B-43), we obtain the amplitude and phase spectra of this filter:
A j ( ω ) = 1 A ( ω ) A j ( ω ) = 1 A ( ω ) A_(j)(omega)=(1)/(A(omega))A_{j}(\omega)=\frac{1}{A(\omega)}Aj(ω)=1A(ω)
and
ϕ f ( ω ) = ϕ ( ω ) ϕ f ( ω ) = ϕ ( ω ) phi_(f)(omega)=-phi(omega)\phi_{f}(\omega)=-\phi(\omega)ϕf(ω)=ϕ(ω)
Since the estimated wavelet w ( t ) w ( t ) w(t)w(t)w(t) is minimum phase, it follows that the deconvolution filter [whose Fourier transform is given by equation (B-44)] also is minimum phase. By inverse Fourier transforming, equation (B-44) yields the deconvolution operator. The frequency-domain method of deconvolution is outlined in Figure B-1.
FIG. B-1. Flowchart for frequency-donain deconvolution.
Figure B-2 illustrates the frequency-domain deconvolution that is described in Figure B-1. The panels in Figure B-2 should be compared with the corresponding results of the WienerLevinson (time-domain) method in Figure 2-20. As expected, there is virtually no difference between the two results.
From the discussion so far, we see that the spiking deconvolution operator is the inverse of the minimum-phase equivalent of the seismic wavelet. The process of estimating the minimumphase equivalent of a seismic wavelet is called spectrol decomposetion. The minimum-phase wavelet, once computed, can be inverted easily to get the deconvolution operator. To avoid dividing by zero in equation (B-45a) and to ensure that the filtcr is stable, a small number often is added to the amplitude spectrum before division. This is called prewhitening. Equation (B-45a) then takes the form
A f ( ω ) = 1 A ( ω ) + ε A f ( ω ) = 1 A ( ω ) + ε A_(f)(omega)=(1)/(A(omega)+epsi)A_{f}(\omega)=\frac{1}{A(\omega)+\varepsilon}Af(ω)=1A(ω)+ε
The amplitude spectrum also can be smoothed to get a more stable opcrator. Smoothing the spectrum is analogous to shortening the equivalent time-domain deconvolution operator.
Zero-phase deconvolution can be implemented conveniently in the frequency domain. To do this, the phase spectrum given by equation ( B 45 b B 45 b B-45b\mathrm{B}-45 \mathrm{~b}B45 b ) is set to zero and thus yields a deconvolution operator that flattens the amplitude spectrum of the input seismogram, but does not alter the phase.

B. 5 Optimum Wiener Filters

The following concise discussion of optimum Wiener filters is based on Robinson and Treitel (1980). Consider the general filter model in Figure B-3. Wioner filtering involves designing the
Wiener Filters
FIG. B-3. Wiener filter model.
filter f ( t ) f ( t ) f(t)f(t)f(t) so that the least-squares error between the actual and desired outputs is minimum. Error L L LLL is defined as
L = i ( d t y t ) 2 L = i d t y t 2 L=sum_(i)(d_(t)-y_(t))^(2)L=\sum_{i}\left(d_{t}-y_{t}\right)^{2}L=i(dtyt)2
The actual output is the convolution of the filter with the input
y t = f t x t y t = f t x t y_(t)=f_(t)**x_(t)y_{t}=f_{t} * x_{t}yt=ftxt
When equation (B-48) is substituted into equation (B-47), we get
L = t ( d t τ f τ x t τ ) 2 L = t d t τ f τ x t τ 2 L=sum_(t)(d_(t)-sum_(tau)f_(tau)x_(t-tau))^(2)L=\sum_{t}\left(d_{t}-\sum_{\tau} f_{\tau} x_{t-\tau}\right)^{2}L=t(dtτfτxtτ)2
The goal is to compute the filter coefficients ( f 0 , f 1 , , f n 1 ) f 0 , f 1 , , f n 1 (f_(0),f_(1),dots,f_(n-1))\left(f_{0}, f_{1}, \ldots, f_{n-1}\right)(f0,f1,,fn1) so that the error is minimum. Filter length n n nnn must be predefined. The minimum error is attained by setting the variation of L L LLL with respect to f i f i f_(i)f_{i}fi to zero:
L f t = 0 , i = 0 , 1 , 2 , , ( n 1 ) L f t = 0 , i = 0 , 1 , 2 , , ( n 1 ) (del L)/(delf_(t))=0,quad i=0,1,2,dots,(n-1)\frac{\partial L}{\partial f_{t}}=0, \quad i=0,1,2, \ldots,(n-1)Lft=0,i=0,1,2,,(n1)
By expanding the square term in equation (B-49), we have
L = t d t 2 2 t d t τ f τ x t τ + t ( τ f τ x t τ ) 2 . L = t d t 2 2 t d t τ f τ x t τ + t τ f τ x t τ 2 . L=sum_(t)d_(t)^(2)-2sum_(t)d_(t)sum_(tau)f_(tau)x_(t-tau)+sum_(t)(sum_(tau)f_(tau)x_(t-tau))^(2).L=\sum_{t} d_{t}^{2}-2 \sum_{t} d_{t} \sum_{\tau} f_{\tau} x_{t-\tau}+\sum_{t}\left(\sum_{\tau} f_{\tau} x_{t-\tau}\right)^{2} .L=tdt22tdtτfτxtτ+t(τfτxtτ)2.
By taking the partial derivatives and setting them to zero, we get
L f t = 2 t d t x t 1 + 2 t ( τ f τ x t τ ) x t t = 0 L f t = 2 t d t x t 1 + 2 t τ f τ x t τ x t t = 0 (del L)/(delf_(t))=-2sum_(t)d_(t)x_(t-1)+2sum_(t)(sum_(tau)f_(tau)x_(t-tau))x_(t-t)=0\frac{\partial L}{\partial f_{t}}=-2 \sum_{t} d_{t} x_{t-1}+2 \sum_{t}\left(\sum_{\tau} f_{\tau} x_{t-\tau}\right) x_{t-t}=0Lft=2tdtxt1+2t(τfτxtτ)xtt=0
or
τ f τ t x t τ x t t = t d t x t i i = 0 , 1 , 2 , , ( n 1 ) . τ f τ t x t τ x t t = t d t x t i i = 0 , 1 , 2 , , ( n 1 ) . {:[sum_(tau)f_(tau)sum_(t)x_(t-tau)x_(t-t)=sum_(t)d_(t)x_(t-i)],[i=0","1","2","dots","(n-1).]:}\begin{aligned} & \sum_{\tau} f_{\tau} \sum_{t} x_{t-\tau} x_{t-t}= \sum_{t} d_{t} x_{t-i} \\ & i=0,1,2, \ldots,(n-1) . \end{aligned}τfτtxtτxtt=tdtxtii=0,1,2,,(n1).
By using
t x t τ x t t = r ı t x t τ x t t = r ı sum_(t)x_(t-tau)x_(t-t)=r_(ı)\sum_{t} x_{t-\tau} x_{t-t}=r_{\imath}txtτxtt=rı
and
t d 1 x t t = g 2 t d 1 x t t = g 2 sum_(t)d_(1)x_(t-t)=g_(2)\sum_{t} d_{1} x_{t-t}=g_{2}td1xtt=g2
for each ı ı ı\imathı th term. we get
τ f τ r i τ = g i , i = 0 , 1 , 2 , , ( n 1 ) τ f τ r i τ = g i , i = 0 , 1 , 2 , , ( n 1 ) sum_(tau)f_(tau)r_(i-tau)=g_(i),quad i=0,1,2,dots,(n-1)\sum_{\tau} f_{\tau} r_{i-\tau}=g_{i}, \quad i=0,1,2, \ldots,(n-1)τfτriτ=gi,i=0,1,2,,(n1)
When put into matrix form, equation (B-55) becomes
( r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r n 1 r n 2 r n 3 r 0 ) ( f 0 f 1 f n 1 ) = ( g 0 g 1 g n 1 ) . r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r n 1 r n 2 r n 3 r 0 f 0 f 1 f n 1 = g 0 g 1 g n 1 . ([r_(0),r_(1),r_(2),cdots,r_(n-1)],[r_(1),r_(0),r_(1),cdots,r_(n-2)],[vdots,vdots,vdots,ddots,vdots],[r_(n-1),r_(n-2),r_(n-3),cdots,r_(0)])([f_(0)],[f_(1)],[vdots],[f_(n-1)])=([g_(0)],[g_(1)],[vdots],[g_(n-1)]).\left(\begin{array}{ccccc} r_{0} & r_{1} & r_{2} & \cdots & r_{n-1} \\ r_{1} & r_{0} & r_{1} & \cdots & r_{n-2} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n-1} & r_{n-2} & r_{n-3} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} f_{0} \\ f_{1} \\ \vdots \\ f_{n-1} \end{array}\right)=\left(\begin{array}{c} g_{0} \\ g_{1} \\ \vdots \\ g_{n-1} \end{array}\right) .(r0r1r2rn1r1r0r1rn2rn1rn2rn3r0)(f0f1fn1)=(g0g1gn1).
Here, r z r z r_(z)r_{z}rz are the autocorrelation lags of the input and g 2 g 2 g_(2)g_{2}g2 are the lags of the crosscorrelation between the desired output and input. Since the autocorrclation matrix is Toeplitz, the optimum Wiener filter coefficients f 2 f 2 f_(2)f_{2}f2 can be computed by using Levinson recursion (Claerbout, 1976).
The least-squares error involved in this process now is computed. Expressed again, equation (B-51) becomes
L тn2n = i d t 2 2 ( t τ d t f τ x t τ ) + t ( τ f τ x t τ ) 2 L тn2n  = i d t 2 2 t τ d t f τ x t τ + t τ f τ x t τ 2 L_("тn2n ")=sum_(i)d_(t)^(2)-2(sum_(t)sum_(tau)d_(t)f_(tau)x_(t-tau))+sum_(t)(sum_(tau)f_(tau)x_(t-tau))^(2)L_{\text {тn2n }}=\sum_{i} d_{t}^{2}-2\left(\sum_{t} \sum_{\tau} d_{t} f_{\tau} x_{t-\tau}\right)+\sum_{t}\left(\sum_{\tau} f_{\tau} x_{t-\tau}\right)^{2}Lтn2n =idt22(tτdtfτxtτ)+t(τfτxtτ)2
By substituting the relationships
t d t x t r = g r t d t x t r = g r sum_(t)d_(t)x_(t-r)=g_(r)\sum_{t} d_{t} x_{t-r}=g_{r}tdtxtr=gr
and
t x t x t τ = r τ t x t x t τ = r τ sum_(t)x_(t)x_(t-tau)=r_(tau)\sum_{t} x_{t} x_{t-\tau}=r_{\tau}txtxtτ=rτ
into equation (B-57), we get
L m : n = t d t 2 2 τ f τ g τ + τ f τ t f τ t x t τ x t t L m : n = t d t 2 2 τ f τ g τ + τ f τ t f τ t x t τ x t t L_(m:n)=sum_(t)d_(t)^(2)-2sum_(tau)f_(tau)g_(tau)+sum_(tau)f_(tau)sum_(t)f_(tau)sum_(t)x_(t-tau)x_(t-t)L_{m: n}=\sum_{t} d_{t}^{2}-2 \sum_{\tau} f_{\tau} g_{\tau}+\sum_{\tau} f_{\tau} \sum_{t} f_{\tau} \sum_{t} x_{t-\tau} x_{t-t}Lm:n=tdt22τfτgτ+τfτtfτtxtτxtt
or
L inun = t d t 2 2 τ f τ g τ + τ f τ t f t r τ ı L inun  = t d t 2 2 τ f τ g τ + τ f τ t f t r τ ı L_("inun ")=sum_(t)d_(t)^(2)-2sum_(tau)f_(tau)g_(tau)+sum_(tau)f_(tau)sum_(t)f_(t)r_(tau-ı)L_{\text {inun }}=\sum_{t} d_{t}^{2}-2 \sum_{\tau} f_{\tau} g_{\tau}+\sum_{\tau} f_{\tau} \sum_{\boldsymbol{t}} f_{t} r_{\tau-\imath}Linun =tdt22τfτgτ+τfτtftrτı
Finally, by using equation (B-55), we get
L m n = t d t 2 τ f τ g τ L m n = t d t 2 τ f τ g τ L_(mn)=sum_(t)d_(t)^(2)-sum_(tau)f_(tau)g_(tau)L_{m n}=\sum_{t} d_{t}^{2}-\sum_{\tau} f_{\tau} g_{\tau}Lmn=tdt2τfτgτ

B. 6 Spiking Deconvolution

Consider the desired output to be the zero-delay spike d t : ( 1 , 0 , 0 , ) d t : ( 1 , 0 , 0 , ) d_(t):(1,0,0,dots)d_{t}:(1,0,0, \ldots)dt:(1,0,0,). Given the input series x t : ( x 0 , x 1 , x 2 , ) x t : x 0 , x 1 , x 2 , x_(t):(x_(0),x_(1),x_(2),dots)x_{t}:\left(x_{0}, x_{1}, x_{2}, \ldots\right)xt:(x0,x1,x2,), equation (B-56) takes the form
( r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r n 1 r n 2 r n 3 r 0 ) ( f 0 f 1 f n 1 ) = ( x 0 0 0 ) . r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r n 1 r n 2 r n 3 r 0 f 0 f 1 f n 1 = x 0 0 0 . ([r_(0),r_(1),r_(2),cdots,r_(n-1)],[r_(1),r_(0),r_(1),cdots,r_(n-2)],[vdots,vdots,vdots,ddots,vdots],[r_(n-1),r_(n-2),r_(n-3),cdots,r_(0)])([f_(0)],[f_(1)],[vdots],[f_(n-1)])=([x_(0)],[0],[vdots],[0]).\left(\begin{array}{ccccc} r_{0} & r_{1} & r_{2} & \cdots & r_{n-1} \\ r_{1} & r_{0} & r_{1} & \cdots & r_{n-2} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n-1} & r_{n-2} & r_{n-3} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} f_{0} \\ f_{1} \\ \vdots \\ f_{n-1} \end{array}\right)=\left(\begin{array}{c} x_{0} \\ 0 \\ \vdots \\ 0 \end{array}\right) .(r0r1r2rn1r1r0r1rn2rn1rn2rn3r0)(f0f1fn1)=(x000).
Divide both sides by f 0 f 0 f_(0)f_{0}f0 to obtain
( r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r n 1 r n 2 r n 3 r 0 ) ( 1 a 1 a n 1 ) = ( v 0 0 ) r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r n 1 r n 2 r n 3 r 0 1 a 1 a n 1 = v 0 0 ([r_(0),r_(1),r_(2),cdots,r_(n-1)],[r_(1),r_(0),r_(1),cdots,r_(n-2)],[vdots,vdots,vdots,ddots,vdots],[r_(n-1),r_(n-2),r_(n-3),cdots,r_(0)])([1],[a_(1)],[vdots],[a_(n-1)])=([v],[0],[vdots],[0])\left(\begin{array}{ccccc} r_{0} & r_{1} & r_{2} & \cdots & r_{n-1} \\ r_{1} & r_{0} & r_{1} & \cdots & r_{n-2} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n-1} & r_{n-2} & r_{n-3} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ a_{1} \\ \vdots \\ a_{n-1} \end{array}\right)=\left(\begin{array}{c} v \\ 0 \\ \vdots \\ 0 \end{array}\right)(r0r1r2rn1r1r0r1rn2rn1rn2rn3r0)(1a1an1)=(v00)
where a 2 = f 2 / f 0 , i = 1 , 2 , , n 1 a 2 = f 2 / f 0 , i = 1 , 2 , , n 1 a_(2)=f_(2)//f_(0),i=1,2,dots,n-1a_{2}=f_{2} / f_{0}, i=1,2, \ldots, n-1a2=f2/f0,i=1,2,,n1, and v = x 0 / f 0 v = x 0 / f 0 v=x_(0)//f_(0)v=x_{0} / f_{0}v=x0/f0. Equation (B-63) is solved for the unknown quantity v v vvv and the filter coefficients ( a 1 , a 2 , , a n 1 ) a 1 , a 2 , , a n 1 (a_(1),a_(2),dots,a_(n-1))\left(a_{1}, a_{2}, \ldots, a_{n-1}\right)(a1,a2,,an1). Since the desired ortput is a zero-delay spike, the filter ( 1 , a 1 , a 2 , , a n 1 ) 1 , a 1 , a 2 , , a n 1 (1,a_(1),a_(2),dots,a_(n-1))\left(1, a_{1}, a_{2}, \ldots, a_{n-1}\right)(1,a1,a2,,an1) describes a spiking deconvolution process.
The solution to equation (B-63) can be obtained efficiently using the Levinson recursion (Claerbout, 1976). Start with the solution of equation (B-63) for the two-term filter ( 1 , a 1 ) 1 , a 1 {:1,a_(1))\left.1, a_{1}\right)1,a1), then solve for the filter ( 1 , a 1 , a 2 ) 1 , a 1 , a 2 (1,a_(1),a_(2))\left(1, a_{1}, a_{2}\right)(1,a1,a2) and so on. Equation (B-63) for n = 2 n = 2 n=2n=2n=2 takes the form
( r 0 r 1 r 1 r 0 ) ( 1 a 1 ) = ( v 0 ) . r 0 r 1 r 1 r 0 1 a 1 = v 0 . ([r_(0),r_(1)],[r_(1),r_(0)])([1],[a_(1)])=([v],[0]).\left(\begin{array}{ll} r_{0} & r_{1} \\ r_{1} & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ a_{1} \end{array}\right)=\left(\begin{array}{l} v \\ 0 \end{array}\right) .(r0r1r1r0)(1a1)=(v0).
Write out the simultaneous equations:
r 0 + r 1 a 1 = v r 0 + r 1 a 1 = v r_(0)+r_(1)a_(1)=vr_{0}+r_{1} a_{1}=vr0+r1a1=v
and
r 1 + r 0 a 1 = 0 r 1 + r 0 a 1 = 0 r_(1)+r_(0)a_(1)=0r_{1}+r_{0} a_{1}=0r1+r0a1=0
which yield the filter coefficient a 1 a 1 a_(1)a_{1}a1 and the unknown variable v v vvv from the first iteration:
a 1 = r 1 / r 0 a 1 = r 1 / r 0 a_(1)=-r_(1)//r_(0)a_{1}=-r_{1} / r_{0}a1=r1/r0
and
v = r 0 + r 1 a 1 v = r 0 + r 1 a 1 v=r_(0)+r_(1)a_(1)v=r_{0}+r_{1} a_{1}v=r0+r1a1
Now write equation (B-63) for the three-term filter ( 1 . a 1 , a 2 ) 1 . a 1 , a 2 (1.a_(1)^('),a_(2)^('))\left(1 . a_{1}^{\prime}, a_{2}^{\prime}\right)(1.a1,a2) :
( r 0 r 1 r 2 r 1 r 0 r 1 r 2 r 1 r 0 ) ( 1 a 1 a 2 ) = ( v 0 0 ) r 0 r 1 r 2 r 1 r 0 r 1 r 2 r 1 r 0 1 a 1 a 2 = v 0 0 ([r_(0),r_(1),r_(2)],[r_(1),r_(0),r_(1)],[r_(2),r_(1),r_(0)])([1],[a_(1)^(')],[a_(2)^(')])=([v^(')],[0],[0])\left(\begin{array}{lll} r_{0} & r_{1} & r_{2} \\ r_{1} & r_{0} & r_{1} \\ r_{2} & r_{1} & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ a_{1}^{\prime} \\ a_{2}^{\prime} \end{array}\right)=\left(\begin{array}{c} v^{\prime} \\ 0 \\ 0 \end{array}\right)(r0r1r2r1r0r1r2r1r0)(1a1a2)=(v00)
We want to solve for the filter coefficients ( a 1 , a 2 ) a 1 , a 2 (a_(1)^('),a_(2)^('))\left(a_{1}^{\prime}, a_{2}^{\prime}\right)(a1,a2) by using the results of the previous step (equations B-65a,b). First, rewrite equation (B-64) by adding a row in the following manner:
( r 0 r 1 r 2 r 1 r 0 r 1 r 2 r 1 r 0 ) ( 1 a 1 0 ) = ( v 0 ϵ ) r 0 r 1 r 2 r 1 r 0 r 1 r 2 r 1 r 0 1 a 1 0 = v 0 ϵ ([r_(0),r_(1),r_(2)],[r_(1),r_(0),r_(1)],[r_(2),r_(1),r_(0)])([1],[a_(1)],[0])=([v],[0],[epsilon])\left(\begin{array}{lll} r_{0} & r_{1} & r_{2} \\ r_{1} & r_{0} & r_{1} \\ r_{2} & r_{1} & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ a_{1} \\ 0 \end{array}\right)=\left(\begin{array}{l} v \\ 0 \\ \epsilon \end{array}\right)(r0r1r2r1r0r1r2r1r0)(1a10)=(v0ϵ)
where
e = r 2 + r 1 a 1 e = r 2 + r 1 a 1 e=r_(2)+r_(1)a_(1)e=r_{2}+r_{1} a_{1}e=r2+r1a1
Rewrite equation (B-67) by changing the order of the rows:
( r 0 r 1 r 2 r 1 r 0 r 1 r 2 r 1 r 0 ) ( 0 a 1 1 ) = ( e 0 v ) r 0 r 1 r 2 r 1 r 0 r 1 r 2 r 1 r 0 0 a 1 1 = e 0 v ([r_(0),r_(1),r_(2)],[r_(1),r_(0),r_(1)],[r_(2),r_(1),r_(0)])([0],[a_(1)],[1])=([e],[0],[v])\left(\begin{array}{lll} r_{0} & r_{1} & r_{2} \\ r_{1} & r_{0} & r_{1} \\ r_{2} & r_{1} & r_{0} \end{array}\right)\left(\begin{array}{c} 0 \\ a_{1} \\ 1 \end{array}\right)=\left(\begin{array}{l} e \\ 0 \\ v \end{array}\right)(r0r1r2r1r0r1r2r1r0)(0a11)=(e0v)
Multiply both sides of equation (B-69) with variable c 1 c 1 c_(1)c_{1}c1, yet to be determined, and subtract the result from equation (B-67):
( r 0 r 1 r 2 r 1 r 0 r 1 r 2 r 1 r 0 ) ( 1 a 1 c a 1 c ) = ( v c e 0 e c v ) r 0 r 1 r 2 r 1 r 0 r 1 r 2 r 1 r 0 1 a 1 c a 1 c = v c e 0 e c v ([r_(0),r_(1),r_(2)],[r_(1),r_(0),r_(1)],[r_(2),r_(1),r_(0)])([1],[a_(1)-ca_(1)],[-c])=([v-ce],[0],[e-cv])\left(\begin{array}{lll} r_{0} & r_{1} & r_{2} \\ r_{1} & r_{0} & r_{1} \\ r_{2} & r_{1} & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ a_{1}-c a_{1} \\ -c \end{array}\right)=\left(\begin{array}{c} v-c e \\ 0 \\ e-c v \end{array}\right)(r0r1r2r1r0r1r2r1r0)(1a1ca1c)=(vce0ecv)
Finally, compare equation (B-70) with equation (B-66), and note that
( 1 a 1 a 2 ) = ( 1 a 1 c a 1 c ) 1 a 1 a 2 = 1 a 1 c a 1 c ([1],[a_(1)^(')],[a_(2)^(')])=([1],[a_(1)-ca_(1)],[-c])\left(\begin{array}{c} 1 \\ a_{1}^{\prime} \\ a_{2}^{\prime} \end{array}\right)=\left(\begin{array}{c} 1 \\ a_{1}-c a_{1} \\ -c \end{array}\right)(1a1a2)=(1a1ca1c)
and
( v 0 0 ) = ( v c e 0 e c v ) v 0 0 = v c e 0 e c v ([v^(')],[0],[0])=([v-ce],[0],[e-cv])\left(\begin{array}{l} v^{\prime} \\ 0 \\ 0 \end{array}\right)=\left(\begin{array}{c} v-c e \\ 0 \\ e-c v \end{array}\right)(v00)=(vce0ecv)
Solve for c c ccc and v v v^(')v^{\prime}v :
c = e v c = e v c=(e)/(v)c=\frac{e}{v}c=ev
and
v = v [ 1 ( e v ) 2 ] v = v 1 e v 2 v^(')=v[1-((e)/(v))^(2)]v^{\prime}=v\left[1-\left(\frac{e}{v}\right)^{2}\right]v=v[1(ev)2]
Hence, the new filter coefficients ( a 1 , a 2 ) a 1 , a 2 {:a_(1)^('),a_(2)^('))\left.a_{1}^{\prime}, a_{2}^{\prime}\right)a1,a2) are (eqriations B-71a)
a 1 = a 1 e v a 1 a 1 = a 1 e v a 1 a_(1)^(')=a_(1)-(e)/(v)a_(1)a_{1}^{\prime}=a_{1}-\frac{e}{v} a_{1}a1=a1eva1
and
a 2 = e v a 2 = e v a_(2)^(')=-(e)/(v)a_{2}^{\prime}=-\frac{e}{v}a2=ev
This recursive scherne is repeated to determine the next set of filter coefficients:
(a) Compute v v vvv and e e eee using the autocorrelation lags of the input series and the present filter coefficients (equations B-67).
(b) Compute the next set of filter coefficients (equations B-71a).
(c) Compute a new value for v v vvv (equation B-72b).
This recursive process yields the Wiener filter ( 1 , a 1 , a 2 , , a n 1 ) 1 , a 1 , a 2 , , a n 1 (1,a_(1),a_(2),dots,a_(n-1))\left(1, a_{1}, a_{2}, \ldots, a_{n-1}\right)(1,a1,a2,,an1) of the desired length n n nnn.

B. 7 Predictive Deconvolution

Suppose that the desired output in the filter model of Figure B-3 is a time-advanced version of the input, d ( t ) = x ( t + α ) d ( t ) = x ( t + α ) d(t)=x(t+alpha)d(t)=x(t+\alpha)d(t)=x(t+α). We want to design a Wiener filter f ( t ) f ( t ) f(t)f(t)f(t) that predicts x ( t + α ) x ( t + α ) x(t+alpha)x(t+\alpha)x(t+α) from the past values of the input x ( t ) x ( t ) x(t)x(t)x(t). In this special casc, the crosscorrelation function g g ggg becomes
g τ = t d t x t τ = t x t + α x t τ = t x t x t ( α + τ ) g τ = t d t x t τ = t x t + α x t τ = t x t x t ( α + τ ) g_(tau)=sum_(t)d_(t)x_(t-tau)=sum_(t)x_(t+alpha)x_(t-tau)=sum_(t)x_(t)x_(t-(alpha+tau))g_{\tau}=\sum_{t} d_{t} x_{t-\tau}=\sum_{t} x_{t+\alpha} x_{t-\tau}=\sum_{t} x_{t} x_{t-(\alpha+\tau)}gτ=tdtxtτ=txt+αxtτ=txtxt(α+τ)
By deanition, we have
r τ = t x t x t τ r τ = t x t x t τ r_(tau)=sum_(t)x_(t)x_(t-tau)r_{\tau}=\sum_{t} x_{t} x_{t-\tau}rτ=txtxtτ
For the α + τ α + τ alpha+tau\alpha+\tauα+τ lag, equation (B-75) becomes
r α + τ = t x t x t ( α + r ) r α + τ = t x t x t ( α + r ) r_(alpha+tau)=sum_(t)x_(t)x_(t-(alpha+r))r_{\alpha+\tau}=\sum_{t} x_{t} x_{t-(\alpha+r)}rα+τ=txtxt(α+r)
Combine equations (B-74) and (B-76) and note that r α + τ = g τ r α + τ = g τ r_(alpha+tau)=g_(tau)r_{\alpha+\tau}=g_{\tau}rα+τ=gτ. By substituting this result into cquation (B-56), we get the set of normal equations that must be solved to find the prediction
fiter ( f 0 , f 1 , , f n 1 ) f 0 , f 1 , , f n 1 (f_(0),f_(1),dots,f_(n-1))\left(f_{0}, f_{1}, \ldots, f_{n-1}\right)(f0,f1,,fn1) :
( r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r n 1 r n 2 r n 3 r 0 ) ( f 0 f 1 f n 1 ) = ( r α r α + 1 r α + n 1 ) r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r n 1 r n 2 r n 3 r 0 f 0 f 1 f n 1 = r α r α + 1 r α + n 1 ([r_(0),r_(1),r_(2),cdots,r_(n-1)],[r_(1),r_(0),r_(1),cdots,r_(n-2)],[vdots,vdots,vdots,ddots,vdots],[r_(n-1),r_(n-2),r_(n-3),cdots,r_(0)])([f_(0)],[f_(1)],[vdots],[f_(n-1)])=([r_(alpha)],[r_(alpha+1)],[vdots],[r_(alpha+n-1)])\left(\begin{array}{ccccc} r_{0} & r_{1} & r_{2} & \cdots & r_{n-1} \\ r_{1} & r_{0} & r_{1} & \cdots & r_{n-2} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n-1} & r_{n-2} & r_{n-3} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} f_{0} \\ f_{1} \\ \vdots \\ f_{n-1} \end{array}\right)=\left(\begin{array}{c} r_{\alpha} \\ r_{\alpha+1} \\ \vdots \\ r_{\alpha+n-1} \end{array}\right)(r0r1r2rn1r1r0r1rn2rn1rn2rn3r0)(f0f1fn1)=(rαrα+1rα+n1)
For a unit prediction lag, α = 1 α = 1 alpha=1\alpha=1α=1, equation (B-77) takes the form:
( r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r n 1 r n 2 r r 2 3 r 0 ) ( f 0 f 1 f n 1 ) = ( r 1 r 2 r n ) . r 0 r 1 r 2 r n 1 r 1 r 0 r 1 r n 2 r n 1 r n 2 r r 2 3 r 0 f 0 f 1 f n 1 = r 1 r 2 r n . ([r_(0),r_(1),r_(2),cdots,r_(n-1)],[r_(1),r_(0),r_(1),cdots,r_(n-2)],[vdots,vdots,vdots,ddots,vdots],[r_(n-1),r_(n-2),r_(r_(2)-3),cdots,r_(0)])([f_(0)],[f_(1)],[vdots],[f_(n-1)])=([r_(1)],[r_(2)],[vdots],[r_(n)]).\left(\begin{array}{ccccc} r_{0} & r_{1} & r_{2} & \cdots & r_{n-1} \\ r_{1} & r_{0} & r_{1} & \cdots & r_{n-2} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n-1} & r_{n-2} & r_{r_{2}-3} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} f_{0} \\ f_{1} \\ \vdots \\ f_{n-1} \end{array}\right)=\left(\begin{array}{c} r_{1} \\ r_{2} \\ \vdots \\ r_{n} \end{array}\right) .(r0r1r2rn1r1r0r1rn2rn1rn2rr23r0)(f0f1fn1)=(r1r2rn).
By augmenting the right side to the square matrix on the left side, we have
( r 1 r 0 r 1 r 2 r n 1 r 2 r 1 r 0 r 1 r n 2 r n r n 1 r n 2 r n 3 r 0 ) ( 1 f 0 f 1 f n 1 ) = ( 0 0 0 0 ) r 1 r 0 r 1 r 2 r n 1 r 2 r 1 r 0 r 1 r n 2 r n r n 1 r n 2 r n 3 r 0 1 f 0 f 1 f n 1 = 0 0 0 0 ([-r_(1),r_(0),r_(1),r_(2),cdots,r_(n-1)],[-r_(2),r_(1),r_(0),r_(1),cdots,r_(n-2)],[vdots,vdots,vdots,vdots,ddots,vdots],[-r_(n),r_(n-1),r_(n-2),r_(n-3),cdots,r_(0)])([1],[f_(0)],[f_(1)],[vdots],[f_(n-1)])=([0],[0],[0],[vdots],[0])\left(\begin{array}{cccccc} -r_{1} & r_{0} & r_{1} & r_{2} & \cdots & r_{n-1} \\ -r_{2} & r_{1} & r_{0} & r_{1} & \cdots & r_{n-2} \\ \vdots & \vdots & \vdots & \vdots & \ddots & \vdots \\ -r_{n} & r_{n-1} & r_{n-2} & r_{n-3} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ f_{0} \\ f_{1} \\ \vdots \\ f_{n-1} \end{array}\right)=\left(\begin{array}{c} 0 \\ 0 \\ 0 \\ \vdots \\ 0 \end{array}\right)(r1r0r1r2rn1r2r1r0r1rn2rnrn1rn2rn3r0)(1f0f1fn1)=(0000)
By adding one row, then putting the negative sign to the filter column, we obtain
( r 0 r 1 r 2 r T 2 r 1 r 0 r 1 r n 1 r 2 r 1 r 0 r n 2 r n r n 1 r n 2 r 0 ) ( 1 f 0 f 1 f π 1 ) = ( L 0 0 0 ) . r 0 r 1 r 2 r T 2 r 1 r 0 r 1 r n 1 r 2 r 1 r 0 r n 2 r n r n 1 r n 2 r 0 1 f 0 f 1 f π 1 = L 0 0 0 . ([r_(0),r_(1),r_(2),cdots,r_(T2)],[r_(1),r_(0),r_(1),cdots,r_(n-1)],[r_(2),r_(1),r_(0),cdots,r_(n-2)],[vdots,vdots,vdots,ddots,vdots],[r_(n),r_(n-1),r_(n-2),cdots,r_(0)])([1],[-f_(0)],[-f_(1)],[vdots],[-f_(pi-1)])=([L],[0],[0],[vdots],[0]).\left(\begin{array}{ccccc} r_{0} & r_{1} & r_{2} & \cdots & r_{T 2} \\ r_{1} & r_{0} & r_{1} & \cdots & r_{n-1} \\ r_{2} & r_{1} & r_{0} & \cdots & r_{n-2} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ r_{n} & r_{n-1} & r_{n-2} & \cdots & r_{0} \end{array}\right)\left(\begin{array}{c} 1 \\ -f_{0} \\ -f_{1} \\ \vdots \\ -f_{\pi-1} \end{array}\right)=\left(\begin{array}{c} L \\ 0 \\ 0 \\ \vdots \\ 0 \end{array}\right) .(r0r1r2rT2r1r0r1rn1r2r1r0rn2rnrn1rn2r0)(1f0f1fπ1)=(L000).
We now have n + 1 n + 1 n+1n+1n+1 equations and n + 1 n + 1 n+1n+1n+1 unknowns -- ( f 0 , f L , , f n 1 , L ) f 0 , f L , , f n 1 , L (f_(0),f_(L),dots,f_(n-1),L)\left(f_{0}, f_{L}, \ldots, f_{n-1}, L\right)(f0,fL,,fn1,L). From equation (B-80)
L = r 0 r 1 f 0 r 2 f 1 r n f n 1 . L = r 0 r 1 f 0 r 2 f 1 r n f n 1 . L=r_(0)-r_(1)f_(0)-r_(2)f_(1)-cdots-r_(n)f_(n-1).L=r_{0}-r_{1} f_{0}-r_{2} f_{1}-\cdots-r_{n} f_{n-1} .L=r0r1f0r2f1rnfn1.
By using equation (B-61), the minimum error associated with the unit prediction-lag filter can be computed as follows. Start with
d t = x t + 1 d t = x t + 1 d_(t)=x_(t+1)d_{t}=x_{t+1}dt=xt+1
so that
t d t 2 = r 0 t d t 2 = r 0 sum_(t)d_(t)^(2)=r_(0)\sum_{t} d_{t}^{2}=r_{0}tdt2=r0
and
g t = r t + 1 g t = r t + 1 g_(t)=r_(t+1)g_{t}=r_{t+1}gt=rt+1
Substituting into equation (B-61), we get
L n n 1 n = r 0 ( r 1 f 0 + r 2 f 1 + + r n f n 1 ) L n n 1 n = r 0 r 1 f 0 + r 2 f 1 + + r n f n 1 L_(nn1n)=r_(0)-(r_(1)f_(0)+r_(2)f_(1)+cdots+r_(n)f_(n-1))L_{n n 1 n}=r_{0}-\left(r_{1} f_{0}+r_{2} f_{1}+\cdots+r_{n} f_{n-1}\right)Lnn1n=r0(r1f0+r2f1++rnfn1)
which is identical to quantity L L LLL given by equation (B-81). Therefore, when we solve equation (B-81), we compute both the minimum error and the filter coefficients.
Equation (B-77) gives us the prediction filter with prediction lag α α alpha\alphaα. The desired output is x t + α x t + α x_(t+alpha)x_{t+\alpha}xt+α. The actual output is x ^ t + α x ^ t + α widehat(x)_(t+alpha)\widehat{x}_{t+\alpha}x^t+α, which is an estimate of the desired output. This desired output
is the predictable component of the input series; i.e, periodic events such as multiples. The error series contains the unpredictable component of the series and is defined as
e t + α = x t + α x ^ t + α = x t + α r f τ x t τ e t + α = x t + α x ^ t + α = x t + α r f τ x t τ e_(t+alpha)=x_(t+alpha)- hat(x)_(t+alpha)=x_(t+alpha)-sum_(r)f_(tau)x_(t-tau)e_{t+\alpha}=x_{t+\alpha}-\hat{x}_{t+\alpha}=x_{t+\alpha}-\sum_{r} f_{\tau} x_{t-\tau}et+α=xt+αx^t+α=xt+αrfτxtτ
We assume that the unpredictable component e t e t e_(t)e_{t}et is the uncorrelated reflectivity we want to extract from the seismogram. By taking the z z zzz-transform of equation (B-85), we have
z α E ( z ) = z α X ( z ) F ( z ) X ( z ) z α E ( z ) = z α X ( z ) F ( z ) X ( z ) z^(-alpha)E(z)=z^(-alpha)X(z)-F(z)X(z)z^{-\alpha} E(z)=z^{-\alpha} X(z)-F(z) X(z)zαE(z)=zαX(z)F(z)X(z)
or
E ( z ) = [ 1 z α F ( z ) ] X ( z ) E ( z ) = 1 z α F ( z ) X ( z ) E(z)=[1-z^(alpha)F(z)]X(z)E(z)=\left[1-z^{\alpha} F(z)\right] X(z)E(z)=[1zαF(z)]X(z)
Now define a ncw filter a ( t ) a ( t ) a(t)a(t)a(t) whose z z zzz-transform is
A ( z ) = 1 z α F ( z ) A ( z ) = 1 z α F ( z ) A(z)=1-z^(alpha)F(z)A(z)=1-z^{\alpha} F(z)A(z)=1zαF(z)
so that, when substituted into equation (B-87), we have
E ( z ) = A ( z ) X ( z ) E ( z ) = A ( z ) X ( z ) E(z)=A(z)X(z)E(z)=A(z) X(z)E(z)=A(z)X(z)
The corresponding time-domain relationship is
e ( t ) = a ( t ) a ( t ) e ( t ) = a ( t ) a ( t ) e(t)=a(t)**a(t)e(t)=a(t) * a(t)e(t)=a(t)a(t)
After defining e ( t ) e ( t ) e(t)e(t)e(t) as reflectivity, equation (B-90) states that by applying filter a ( t ) a ( t ) a(t)a(t)a(t) to the input seisrogram 2 ( t ) 2 ( t ) 2(t)2(t)2(t), we obtain the reflectivity series. Since computing the reflectivity series is a goal of deconvolution, prediction filtering can be used for deconvolution. The time-domain form a ( t ) a ( t ) a(t)a(t)a(t) of the filter defined by equation (B-88) is
a t = ( 1 , 0 , 0 , , 0 a 1 f 0 , f 1 , , f n 1 ) a t = ( 1 , 0 , 0 , , 0 a 1 f 0 , f 1 , , f n 1 ) a_(t)=(1, obrace(0,0,cdots,0)^(a-1)-f_(0),-f_(1),cdots,-f_(n-1))a_{t}=(1, \overbrace{0,0, \cdots, 0}^{a-1}-f_{0},-f_{1}, \cdots,-f_{n-1})at=(1,0,0,,0a1f0,f1,,fn1)
The filter a ( t ) a ( t ) a(t)a(t)a(t) is obtained from the prediction filter f ( t ) f ( t ) f(t)f(t)f(t), which is the solution to equation (B-77). We call a ( t ) a ( t ) a(t)a(t)a(t) the prediction error filter. For unit-prediction lag, the filter coefficients given by equation (B-91) are of the form
a t = ( 1 . f 0 , f 1 , , f n 1 ) . a t = 1 . f 0 , f 1 , , f n 1 a_(t)=(1.-f_(0),-f_(1),cdots,-f_(n-1))". "a_{t}=\left(1 .-f_{0},-f_{1}, \cdots,-f_{n-1}\right) \text {. }at=(1.f0,f1,,fn1)
This is the same as the solution of equation (B-80). Moreover, equation (B-80) is equivalent to equation (B-36) for n = 2 n = 2 n=2n=2n=2. Thus, we can conclude that a prediction error filter with unitprediction lag and with n + 1 n + 1 n+1n+1n+1 length is equivalent to an inverse filter of the same length except for a scale factor.

B. 8 Surface-Consistent Deconvolution

Dcconvolution can be formulated as a surface-consistent spectral decomposition (Taner and Cobun, 1981). In such a formulation, the seismic trace is decomposed into the convolutional effects of source, receiver, offset, and the earth's impulse response, thus explicitly accounting for variations in wavelet shape affected by near-source and near-receiver conditions and sourcereceiver separation. Decomposition is followed by inverse filtering to recover the earth's impulse response. The assumption of surface-consistency implies that the basic wavelet shape depends only on the source and receiver locations, and not on the details of the raypath from source to reflector to receiver.
The convolutional model discussed in Section 2.1 is described by
x ( t ) = w ( t ) e ( t ) + n ( t ) x ( t ) = w ( t ) e ( t ) + n ( t ) x(t)=w(t)**e(t)+n(t)x(t)=w(t) * e(t)+n(t)x(t)=w(t)e(t)+n(t)
where x ( t ) x ( t ) x(t)x(t)x(t) is the recorded seismogram, w ( t ) w ( t ) w(t)w(t)w(t) is the source waveform, e ( t ) e ( t ) e(t)e(t)e(t) is the earth's impulse response that we want to estimate, and n ( t ) n ( t ) n(t)n(t)n(t) is the noise component.
A postulated surface-consistent convolutional model is given by
x i j ( t ) = s j ( t ) h l ( t ) e k ( t ) g i ( t ) + n ( t ) , x i j ( t ) = s j ( t ) h l ( t ) e k ( t ) g i ( t ) + n ( t ) , x_(ij)^(')(t)=s_(j)(t)**h_(l)(t)**e_(k)(t)**g_(i)(t)+n(t),x_{i j}^{\prime}(t)=s_{j}(t) * h_{l}(t) * e_{k}(t) * g_{i}(t)+n(t),xij(t)=sj(t)hl(t)ek(t)gi(t)+n(t),
where x t ( t ) x t ( t ) x_(t)^(')(t)x_{t}^{\prime}(t)xt(t) is a model of the recorded seismogram, s j ( t ) s j ( t ) s_(j)(t)s_{j}(t)sj(t) is the waveform component associated with source location j , g i ( t ) j , g i ( t ) j,g_(i)(t)j, g_{i}(t)j,gi(t) is the component associated with receiver location 2 , and h l ( t ) h l ( t ) h_(l)(t)h_{l}(t)hl(t) is the component associated with offet dependency of the waveform defined for each offset index l = | z ȷ | l = | z ȷ | l=|z-ȷ|l=|z-\jmath|l=|zȷ|. As in equation (B-93), e k ( t ) e k ( t ) e_(k)(t)e_{k}(t)ek(t) represents the earth's impulse response at the sourcereceiver midpoint location, k = ( i + j ) / 2 k = ( i + j ) / 2 k=(i+j)//2k=(i+j) / 2k=(i+j)/2. By comparing equations (B-93) and (B-94), we infer that w ( t ) w ( t ) w(t)w(t)w(t) represents the combined effects of s ( t ) , h ( t ) s ( t ) , h ( t ) s(t),h(t)s(t), h(t)s(t),h(t), and g ( t ) g ( t ) g(t)g(t)g(t). Cambois and Stoffe (1992) offer an alternative to equation (B-94) in which the offet term is ignored.
To illustrate a method of computing s 3 ( t ) , h l ( t ) , e k ( t ) s 3 ( t ) , h l ( t ) , e k ( t ) s_(3)(t),h_(l)(t),e_(k)(t)s_{3}(t), h_{l}(t), e_{k}(t)s3(t),hl(t),ek(t), and g 2 ( t ) g 2 ( t ) g_(2)(t)g_{2}(t)g2(t), assumc n ( t ) = 0 n ( t ) = 0 n(t)=0n(t)=0n(t)=0 and Fourier transform equation (B-94):
X ı ( ω ) = S ȷ ( ω ) H l ( ω ) E k ( ω ) G 2 ( ω ) X ı ( ω ) = S ȷ ( ω ) H l ( ω ) E k ( ω ) G 2 ( ω ) X_(ı)^(')(omega)=S_(ȷ)(omega)H_(l)(omega)E_(k)(omega)G_(2)(omega)X_{\imath}^{\prime}(\omega)=S_{\jmath}(\omega) H_{l}(\omega) E_{k}(\omega) G_{2}(\omega)Xı(ω)=Sȷ(ω)Hl(ω)Ek(ω)G2(ω)
This equation can be separated into the following amplitude spectral components:
X ¯ 2 j ( ω ) = S ¯ j ( ω ) H ¯ i ( ω ) E ¯ k ( ω ) G ¯ t ( ω ) X ¯ 2 j ( ω ) = S ¯ j ( ω ) H ¯ i ( ω ) E ¯ k ( ω ) G ¯ t ( ω ) bar(X)_(2j)^(')(omega)= bar(S)_(j)(omega) bar(H)_(i)(omega) bar(E)_(k)(omega) bar(G)_(t)(omega)\bar{X}_{2 j}^{\prime}(\omega)=\bar{S}_{j}(\omega) \bar{H}_{i}(\omega) \bar{E}_{k}(\omega) \bar{G}_{t}(\omega)X¯2j(ω)=S¯j(ω)H¯i(ω)E¯k(ω)G¯t(ω)
and phase spectral components (Section A.1):
ϕ ı ȷ ( ω ) = ϕ s j ( ω ) + ϕ h i ( ω ) + ϕ e k ( ω ) + ϕ r z ( ω ) ϕ ı ȷ ( ω ) = ϕ s j ( ω ) + ϕ h i ( ω ) + ϕ e k ( ω ) + ϕ r z ( ω ) phi_(ıȷ)^(')(omega)=phi_(sj)(omega)+phi_(hi)(omega)+phi_(ek)(omega)+phi_(rz)(omega)\phi_{\imath \jmath}^{\prime}(\omega)=\phi_{\mathrm{sj}}(\omega)+\phi_{h i}(\omega)+\phi_{\mathrm{ek}}(\omega)+\phi_{\mathrm{rz}}(\omega)ϕıȷ(ω)=ϕsj(ω)+ϕhi(ω)+ϕek(ω)+ϕrz(ω)
If the minimum-phase assumption is made, only the amplitude spectra (cquation B 96 a B 96 a B-96 aB-96 aB96a ) need to be considered.
Equation (B-96a) now can be linearized by taking the logarithm of both sides:
X ~ ı ( ω ) = S ~ j ( ω ) + H ~ l ( ω ) + E ~ k ( ω ) + G ~ i ( ω ) X ~ ı ( ω ) = S ~ j ( ω ) + H ~ l ( ω ) + E ~ k ( ω ) + G ~ i ( ω ) tilde(X)_(ı)^(')(omega)= tilde(S)_(j)(omega)+ tilde(H)_(l)(omega)+ tilde(E)_(k)(omega)+ tilde(G)_(i)(omega)\tilde{X}_{\imath}^{\prime}(\omega)=\tilde{S}_{j}(\omega)+\tilde{H}_{l}(\omega)+\tilde{E}_{k}(\omega)+\tilde{G}_{i}(\omega)X~ı(ω)=S~j(ω)+H~l(ω)+E~k(ω)+G~i(ω)
The left side is the logarithm of the amplitude spectrum X ¯ v ( ω ) X ¯ v ( ω ) bar(X)_(v)^(')(omega)\bar{X}_{v}^{\prime}(\omega)X¯v(ω) of the modeled input trace as in the left-hand side of equation (B-96a), and the right-hand terms are the logarithms of the amplitude spectra of the individual components as in the right-hand side of equation (B-96a).
An altemative model equation is given by Cary and Lorentz (1993) bascd on the work by Morley and Claerbout (1983):
X ~ i ( ω ) = S ~ j ( ω ) + H ~ l ( ω ) + E ~ k ( ω ) + G ~ i ( ω ) , X ~ i ( ω ) = S ~ j ( ω ) + H ~ l ( ω ) + E ~ k ( ω ) + G ~ i ( ω ) , tilde(X)_(i)^('')(omega)= tilde(S)_(j)(omega)+ tilde(H)_(l)(omega)+ tilde(E)_(k)(omega)+ tilde(G)_(i)(omega),\tilde{X}_{i}^{\prime \prime}(\omega)=\tilde{S}_{j}(\omega)+\tilde{H}_{l}(\omega)+\tilde{E}_{k}(\omega)+\tilde{G}_{i}(\omega),X~i(ω)=S~j(ω)+H~l(ω)+E~k(ω)+G~i(ω),
where
X ~ i j ( ω ) = X ¨ i j ( ω ) X ~ a v g ( ω ) . X ~ i j ( ω ) = X ¨ i j ( ω ) X ~ a v g ( ω ) . tilde(X)_(ij)^('')(omega)=X^(¨)_(ij)^(')(omega)- tilde(X)_(avg)^(')(omega).\tilde{X}_{i j}^{\prime \prime}(\omega)=\ddot{X}_{i j}^{\prime}(\omega)-\tilde{X}_{a v g}^{\prime}(\omega) .X~ij(ω)=X¨ij(ω)X~avg(ω).
The spectral component X ~ a v g ( ω ) X ~ a v g ( ω ) tilde(X)_(avg)^(')(omega)\tilde{X}_{a v g}^{\prime}(\omega)X~avg(ω) is associated with the average amplitude spectrum for the entire data set. The terms on the right-hand side of equation (B-98) now correspond to residual spectral components for each source, offet, midpoint, and receiver location.
The spectral components on the right-hand side of equation (B-98a) can be computed by least-squares error minimization. For each frequency ω ω omega\omegaω, equation (B-98a) is written for each trace of each CMP gather in the data set. Consider a data set with n s n s n_(s)n_{s}ns shot locations and n c n c n_(c)n_{c}nc channels, so that the total number of traces is n t × n c n t × n c n_(t)xxn_(c)n_{t} \times n_{c}nt×nc. For n e × n c n e × n c n_(e)xxn_(c)n_{e} \times n_{c}ne×nc values of the actual spectral components X ~ ı j X ~ ı j tilde(X)_(ıj)\tilde{X}_{\imath j}X~ıj at frequency ω ω omega\omegaω, and n s n s n_(s)n_{s}ns shot locations, n r n r n_(r)n_{r}nr receiver locations, n e n e n_(e)n_{e}ne midpoint locations, and n h n h n_(h)n_{h}nh
offsets, we have the following set of model equations:
( X ~ 3 ) = ( 1 1 1 ) ( S ~ 3 H ~ l E k G ^ 3 ) , ( B 99 a ) X ~ 3 = 1 1 1 S ~ 3 H ~ l E k G ^ 3 , ( B 99 a ) ([],[vdots],[ tilde(X)_(**3)^('')],[vdots])=([cdots,1cdots,1cdots,1cdots])([vdots],[ tilde(S)_(3)],[vdots],[vdots],[ tilde(H)_(l)],[vdots],[vdots],[E_(k)],[vdots],[vdots],[ hat(G)_(3)],[vdots]),quad(B-99 a)\left(\begin{array}{c} \\ \vdots \\ \tilde{X}_{* 3}^{\prime \prime} \\ \vdots \end{array}\right)=\left(\begin{array}{llll} \cdots & 1 \cdots & 1 \cdots & 1 \cdots \end{array}\right)\left(\begin{array}{c} \vdots \\ \tilde{S}_{3} \\ \vdots \\ \vdots \\ \tilde{H}_{l} \\ \vdots \\ \vdots \\ E_{k} \\ \vdots \\ \vdots \\ \hat{G}_{3} \\ \vdots \end{array}\right), \quad(B-99 a)(X~3)=(111)(S~3H~lEkG^3),(B99a)
Write equation (B-99a) in matrix notation:
X ¯ = L p X ¯ = L p bar(X)^('')=Lp\overline{\mathbf{X}}^{\prime \prime}=\mathbf{L p}X¯=Lp
where X ~ X ~ tilde(X)^('')\tilde{\mathbf{X}}^{\prime \prime}X~ is the column vector of m m mmm-length on the left-hand side in equation (B-99), L L L\mathrm{L}L is the sparse matrix with dimensions ( n s × n c ) × ( n s + n h + n e + n r ) n s × n c × n s + n h + n e + n r (n_(s)xxn_(c))xx(n_(s)+n_(h)+n_(e)+n_(r))\left(n_{s} \times n_{c}\right) \times\left(n_{s}+n_{h}+n_{e}+n_{r}\right)(ns×nc)×(ns+nh+ne+nr) and p p p\mathbf{p}p is the column vector of ( n s + n h + n e + n r ) n s + n h + n e + n r (n_(s)+n_(h)+n_(e)+n_(r))\left(n_{s}+n_{h}+n_{e}+n_{r}\right)(ns+nh+ne+nr)-length on the right-hand side of the same equation. Except the four elements in each row, the L L LLL matrix contains zeros.
We want to estimate for each frequency ω ω omega\omegaω the model parameters p p ppp such that the difference between the actual spectral component X ¯ X ¯ bar(X)\overline{\mathbf{X}}X¯ and the modeled spectral component X ~ X ~ tilde(X)^('')\tilde{\mathbf{X}}^{\prime \prime}X~ is minimum in the least-squares sense.
The error vector v v v\mathbf{v}v is defined as the difference between the modeled and the actual spectral component for each frequency ω ω omega\omegaω
v = X ¯ X ~ v = X ¯ X ~ v= bar(X)- tilde(X)^('')\mathbf{v}=\overline{\mathbf{X}}-\tilde{\mathbf{X}}^{\prime \prime}v=X¯X~
Substituto equation (B-99b) into equation (B-100a) to obtain
v = X ~ L p v = X ~ L p v= tilde(X)-Lp\mathbf{v}=\tilde{\mathbf{X}}-\mathbf{L p}v=X~Lp
Following lines and Treitel (1984), the least-squares solution for equation (B-100b) can be determined. First, the cumulative squared error C C CCC is expressed as
C = v T + v C = v T + v C=v^(T+)vC=\mathbf{v}^{\mathbf{T}+} \mathbf{v}C=vT+v
where T T TTT is for transpose and *** is for complex conjugate. By substituting for v v vvv from equation (B-100b), we get
C = ( X ¯ L p ) T ( X ¯ L p ) C = X ¯ L p T X ¯ L p C=( bar(X)-L_(p))^(T**)( bar(X)-L_(p))C=\left(\overline{\mathbf{X}}-\mathbf{L}_{p}\right)^{\mathbf{T} *}\left(\overline{\mathbf{X}}-\mathbf{L}_{p}\right)C=(X¯Lp)T(X¯Lp)
Minimization of C C CCC with respect to p p p\mathbf{p}p requires that
C S ~ 3 = C H ~ l = C E ~ k = C G ~ 1 = 0 C S ~ 3 = C H ~ l = C E ~ k = C G ~ 1 = 0 (del C)/(del tilde(S)_(3))=(del C)/(del tilde(H)_(l))=(del C)/(del tilde(E)_(k))=(del C)/(del tilde(G)_(1))=0\frac{\partial C}{\partial \tilde{S}_{3}}=\frac{\partial C}{\partial \tilde{H}_{l}}=\frac{\partial C}{\partial \tilde{E}_{k}}=\frac{\partial C}{\partial \tilde{G}_{1}}=0CS~3=CH~l=CE~k=CG~1=0
This requirement yields the desired least-squares solution:
p = ( L T L ) 1 L T X ~ p = L T L 1 L T X ~ p=(L^(T**)L)^(-1)L^(T**) tilde(X)\mathrm{p}=\left(\mathbf{L}^{\mathbf{T} *} \mathbf{L}\right)^{-\mathbf{1}} \mathbf{L}^{\mathbf{T} *} \tilde{\mathbf{X}}p=(LTL)1LTX~
Application of the least-squares minimization to surface-consistent prediction-error filtering is given by Levin (1989), A practical scheme for solving equation (B-98a) is based on the GaussSeidel method. In this scheme, each term on the right-hand side of cquation (B-98a) is computed
by the following set of recursive equations:
S ~ j m = 1 n r i n r { X ~ i j H ~ l m 1 E ~ k m 1 G ~ i m 1 } G ~ ı m = 1 n s j n s { X ~ ı j H ~ l m 1 E ~ k m 1 S ¯ j m 1 } H ~ l m = 1 n c k n e { X ~ ı j S ¯ j m 1 E ¯ k m 1 G ~ i m 1 } S ~ j m = 1 n r i n r X ~ i j H ~ l m 1 E ~ k m 1 G ~ i m 1 G ~ ı m = 1 n s j n s X ~ ı j H ~ l m 1 E ~ k m 1 S ¯ j m 1 H ~ l m = 1 n c k n e X ~ ı j S ¯ j m 1 E ¯ k m 1 G ~ i m 1 {:[ tilde(S)_(j)^(m)=(1)/(n_(r))sum_(i)^(n_(r)){ tilde(X)_(ij)- tilde(H)_(l)^(m-1)- tilde(E)_(k)^(m-1)- tilde(G)_(i)^(m-1)}],[ tilde(G)_(ı)^(m)=(1)/(n_(s))sum_(j)^(n_(s)){ tilde(X)_(ıj)- tilde(H)_(l)^(m-1)- tilde(E)_(k)^(m-1)- bar(S)_(j)^(m-1)}],[ tilde(H)_(l)^(m)=(1)/(n_(c))sum_(k)^(n_(e)){ tilde(X)_(ıj)- bar(S)_(j)^(m-1)- bar(E)_(k)^(m-1)- tilde(G)_(i)^(m-1)}]:}\begin{aligned} & \tilde{S}_{j}^{m}=\frac{1}{n_{r}} \sum_{i}^{n_{r}}\left\{\tilde{X}_{i j}-\tilde{H}_{l}^{m-1}-\tilde{E}_{k}^{m-1}-\tilde{G}_{i}^{m-1}\right\} \\ & \tilde{G}_{\imath}^{m}=\frac{1}{n_{s}} \sum_{j}^{n_{s}}\left\{\tilde{X}_{\imath j}-\tilde{H}_{l}^{m-1}-\tilde{E}_{k}^{m-1}-\bar{S}_{j}^{m-1}\right\} \\ & \tilde{H}_{l}^{m}=\frac{1}{n_{c}} \sum_{k}^{n_{e}}\left\{\tilde{X}_{\imath j}-\bar{S}_{j}^{m-1}-\bar{E}_{k}^{m-1}-\tilde{G}_{i}^{m-1}\right\} \end{aligned}S~jm=1nrinr{X~ijH~lm1E~km1G~im1}G~ım=1nsjns{X~ıjH~lm1E~km1S¯jm1}H~lm=1nckne{X~ıjS¯jm1E¯km1G~im1}
and
E ~ k m = 1 n k l n h { X ¯ t S ~ j m 1 H ~ l m 1 G ~ 2 m 1 } E ~ k m = 1 n k l n h X ¯ t S ~ j m 1 H ~ l m 1 G ~ 2 m 1 tilde(E)_(k)^(m)=(1)/(n_(k))sum_(l)^(n_(h)){ bar(X)_(t)- tilde(S)_(j)^(m-1)- tilde(H)_(l)^(m-1)- tilde(G)_(2)^(m-1)}\tilde{E}_{k}^{m}=\frac{1}{n_{k}} \sum_{l}^{n_{h}}\left\{\bar{X}_{t}-\tilde{S}_{j}^{m-1}-\tilde{H}_{l}^{m-1}-\tilde{G}_{2}^{m-1}\right\}E~km=1nklnh{X¯tS~jm1H~lm1G~2m1}
where m m mmm is the iteration index. The solutions in equations (B-103) are based on the orthogonality of the shot and receiver axes, and the orthogonality of the midpoint and offset axes. Equations (B-103) can be modified as follows:
S ~ 3 m = 1 n r i n r { X ~ ı } 1 n r i n r { H ~ l m 1 E ~ k m 1 G ¯ t m 1 } , G ~ t m = 1 n τ j n t { X ~ ı ȷ } 1 n s j n { H ~ l m i 1 E ~ k m 1 S ~ j m 1 } , H ~ i m = 1 n e k n e { X ~ ı ȷ } 1 n e k n c { S ~ j m 1 E ~ k m 1 G ¯ ı m 1 } , S ~ 3 m = 1 n r i n r X ~ ı 1 n r i n r H ~ l m 1 E ~ k m 1 G ¯ t m 1 , G ~ t m = 1 n τ j n t X ~ ı ȷ 1 n s j n H ~ l m i 1 E ~ k m 1 S ~ j m 1 , H ~ i m = 1 n e k n e X ~ ı ȷ 1 n e k n c S ~ j m 1 E ~ k m 1 G ¯ ı m 1 , {:[ tilde(S)_(3)^(m)=(1)/(n_(r))sum_(i)^(n_(r)){ tilde(X)_(ı)}-(1)/(n_(r))sum_(i)^(n_(r)){ tilde(H)_(l)^(m-1)- tilde(E)_(k)^(m-1)- bar(G)_(t)^(m-1)}","],[ tilde(G)_(t)^(m)=(1)/(n_(tau))sum_(j)^(n_(t)){ tilde(X)_(ıȷ)}-(1)/(n_(s))sum_(j)^(n_(**)){ tilde(H)_(l)^(m_(i)-1)- tilde(E)_(k)^(m-1)- tilde(S)_(j)^(m-1)}","],[ tilde(H)_(i)^(m)=(1)/(n_(e))sum_(k)^(n_(e)){ tilde(X)_(ıȷ)}-(1)/(n_(e))sum_(k)^(n_(c)){ tilde(S)_(j)^(m-1)- tilde(E)_(k)^(m-1)- bar(G)_(ı)^(m-1)}","]:}\begin{aligned} & \tilde{S}_{3}^{m}=\frac{1}{n_{r}} \sum_{i}^{n_{r}}\left\{\tilde{X}_{\imath}\right\}-\frac{1}{n_{r}} \sum_{i}^{n_{r}}\left\{\tilde{H}_{l}^{m-1}-\tilde{E}_{k}^{m-1}-\bar{G}_{t}^{m-1}\right\}, \\ & \tilde{G}_{t}^{m}=\frac{1}{n_{\tau}} \sum_{j}^{n_{t}}\left\{\tilde{X}_{\imath \jmath}\right\}-\frac{1}{n_{s}} \sum_{j}^{n_{*}}\left\{\tilde{H}_{l}^{m_{i}-1}-\tilde{E}_{k}^{m-1}-\tilde{S}_{j}^{m-1}\right\}, \\ & \tilde{H}_{i}^{m}=\frac{1}{n_{e}} \sum_{k}^{n_{e}}\left\{\tilde{X}_{\imath \jmath}\right\}-\frac{1}{n_{e}} \sum_{k}^{n_{c}}\left\{\tilde{S}_{j}^{m-1}-\tilde{E}_{k}^{m-1}-\bar{G}_{\imath}^{m-1}\right\}, \end{aligned}S~3m=1nrinr{X~ı}1nrinr{H~lm1E~km1G¯tm1},G~tm=1nτjnt{X~ıȷ}1nsjn{H~lmi1E~km1S~jm1},H~im=1nekne{X~ıȷ}1neknc{S~jm1E~km1G¯ım1},
and
E ~ k m = 1 n h l n h { X ~ v } 1 n h l n h { S ~ l m 1 H ~ l m 1 G ~ ı m 1 } E ~ k m = 1 n h l n h X ~ v 1 n h l n h S ~ l m 1 H ~ l m 1 G ~ ı m 1 tilde(E)_(k)^(m)=(1)/(n_(h))sum_(l)^(n_(h)){ tilde(X)_(v)}-(1)/(n_(h))sum_(l)^(n_(h)){ tilde(S)_(l)^(m-1)- tilde(H)_(l)^(m-1)- tilde(G)_(ı)^(m-1)}\tilde{E}_{k}^{m}=\frac{1}{n_{h}} \sum_{l}^{n_{h}}\left\{\tilde{X}_{v}\right\}-\frac{1}{n_{h}} \sum_{l}^{n_{h}}\left\{\tilde{S}_{l}^{m-1}-\tilde{H}_{l}^{m-1}-\tilde{G}_{\imath}^{m-1}\right\}E~km=1nhlnh{X~v}1nhlnh{S~lm1H~lm1G~ım1}
This modification enables us to compute and store the sum of the spectral components of input data X t X t sumX_(t)\sum X_{t}Xt, thus circumventing the need for storing the individual spectral components X t X t X_(t)X_{t}Xt (Cary and Lorentz, 1993). The process is iterated until an index m m mmm that attains the least-squares minimization.
The parameter vector p p p\mathbf{p}p that contains the spectral components S ^ j , G ~ t , H ~ l S ^ j , G ~ t , H ~ l hat(S)_(j), tilde(G)_(t), tilde(H)_(l)\hat{S}_{j}, \tilde{G}_{\mathbf{t}}, \tilde{H}_{l}S^j,G~t,H~l, and E ~ k E ~ k tilde(E)_(k)\tilde{E}_{k}E~k, which are associated with the source and recejver locations, offset dependency, and earth's impulse response, is solved for each frequency component ω ω omega\omegaω using equations (B-104). Rcsults from all frequency components are then combined to obtain the terms in equation (B-98a). The surfaceconsistent spiking deconvolution operator to be applicd to each trace in the data set is then the minimum-phase inverse of s 3 ( t ) g 3 ( t ) h l ( t ) s 3 ( t ) g 3 ( t ) h l ( t ) s_(3)(t)**g_(3)(t)**h_(l)(t)s_{3}(t) * g_{3}(t) * h_{l}(t)s3(t)g3(t)hl(t). In the case of predictive deconvolution with a desired prediction lag, for each source, receiver and, midpoint location, a deconvolution operator is computed by using the autocorrelograms of the terms s 3 ( t ) , g 2 ( t ) s 3 ( t ) , g 2 ( t ) s_(3)(t),g_(2)(t)s_{3}(t), g_{2}(t)s3(t),g2(t), and h l ( t ) h l ( t ) h_(l)(t)h_{l}(t)hl(t). To each trace in the data set, these operators are then applied in a cascaded manner.
As a by-product of the derivation of the surface-consistent spectral decomposition equation (B-97), trace amplitudes themselves can be corrected for in a surface-consistent manner (Taner and Koehler, 1981). Sum the individual terms in equation (B-97) aver the frequencies:
ω X ~ i ( ω ) = ω S ~ j ( ω ) + ω H ~ i ( ω ) + ω E ~ k ( ω ) + ω G ¯ 2 ( ω ) ω X ~ i ( ω ) = ω S ~ j ( ω ) + ω H ~ i ( ω ) + ω E ~ k ( ω ) + ω G ¯ 2 ( ω ) sum_(omega) tilde(X)_(i)^(')(omega)=sum_(omega) tilde(S)_(j)(omega)+sum_(omega) tilde(H)_(i)(omega)+sum_(omega) tilde(E)_(k)(omega)+sum_(omega) bar(G)_(2)(omega)\sum_{\omega} \tilde{X}_{i}^{\prime}(\omega)=\sum_{\omega} \tilde{S}_{j}(\omega)+\sum_{\omega} \tilde{H}_{i}(\omega)+\sum_{\omega} \tilde{E}_{k}(\omega)+\sum_{\omega} \bar{G}_{2}(\omega)ωX~i(ω)=ωS~j(ω)+ωH~i(ω)+ωE~k(ω)+ωG¯2(ω)
( B 105 a ) ( B 105 a ) (B-105 a)(B-105 a)(B105a)
Each term yields a scalar that is related to the source, receiver, offset and midpoint locations:
x ~ i j = s ~ j + h ~ t + e ~ k + g ~ i . x ~ i j = s ~ j + h ~ t + e ~ k + g ~ i . tilde(x)_(ij)^(')= tilde(s)_(j)+ tilde(h)_(t)+ tilde(e)_(k)+ tilde(g)_(i).\tilde{x}_{i j}^{\prime}=\tilde{s}_{j}+\tilde{h}_{t}+\tilde{e}_{k}+\tilde{g}_{i} .x~ij=s~j+h~t+e~k+g~i.
( B 105 b ) ( B 105 b ) (B-105 b)(B-105 b)(B105b)
Once computed in the same manner as the terms in equation (B-98a), these scalars are then applied to individual traces in the data set for surface-consistent amplitude corrections.
In practice, application of surface-consistent deconvolution to field data usually involves two terms, only - the source term s 3 ( t ) s 3 ( t ) s_(3)(t)s_{3}(t)s3(t) and the receiver term g i ( t ) g i ( t ) g_(i)(t)g_{i}(t)gi(t). In a transition zone, surface conditions at source and receiver locations may vary significantly from dry to wet surface conditions. Hence, the most likely situation where surface-consistent amplitude corrections and deconvolution may be required is transition-zone data. Figure B-4 shows a field data example of surface-consistent deconvolution. Note the variations in the autocorrelograms from one source location to the next and from one receiver location to the next. Differences in reflection continuity are observed within the first 1 s 1 s 1s1 \mathrm{~s}1 s on the stacked sections created by application of conventional trace-by-trace deconvolution and surface-consistent deconvolution.

B. 9 Inverse Q Q QQQ Filtering

Consider a 1-D seismogram that represents a compressional plane wave that propagates vertically downward in a homogeneous medium with intrinsic attenuation. This plane wave is expressed as the solution to the scalar wave equation:
1 v 2 2 P t 2 = 2 P z 2 1 v 2 2 P t 2 = 2 P z 2 (1)/(v^(2))(del^(2)P)/(delt^(2))=(del^(2)P)/(delz^(2))\frac{1}{v^{2}} \frac{\partial^{2} P}{\partial t^{2}}=\frac{\partial^{2} P}{\partial z^{2}}1v22Pt2=2Pz2
where P ( t , z ) P ( t , z ) P(t,z)P(t, z)P(t,z) is the plane wave represented by the 1-D seismogram - a CMP-stacked trace, t t ttt is the traveltime, z z zzz is the depth variable and v v vvv is the wave velocity. We shall assume that the wave velocity is constant.
To solve equation (B-106), first, Fourier transform in the time direction:
ω 2 v 2 P = 2 P z 2 ω 2 v 2 P = 2 P z 2 (omega^(2))/(v^(2))P=(del^(2)P)/(delz^(2))\frac{\omega^{2}}{v^{2}} P=\frac{\partial^{2} P}{\partial z^{2}}ω2v2P=2Pz2
where P ( ω , z ) P ( ω , z ) P(omega,z)P(\omega, z)P(ω,z) is the Fourier tramsform of the wavefield P ( t , z ) P ( t , z ) P(t,z)P(t, z)P(t,z), and ω ω omega\omegaω is the angular frequency. The upcoming wave solution is then given by
P ( ω , z ) = P ( ω , z = 0 ) exp ( i ω v z ) P ( ω , z ) = P ( ω , z = 0 ) exp i ω v z P(omega,z)=P(omega,z=0)exp(-i(omega )/(v)z)P(\omega, z)=P(\omega, z=0) \exp \left(-i \frac{\omega}{v} z\right)P(ω,z)=P(ω,z=0)exp(iωvz)
To include amplitude decay in wave propagation in a medium with intrinsic attenuation, the wave velocity is defined as a complex variable:
v = α + i β v = α + i β v=alpha+i betav=\alpha+i \betav=α+iβ
Substitute equation (B-109) into equation (B-108) to get
P ( ω , z ) = P ( ω , z = 0 ) exp ( i ω α + i β z ) P ( ω , z ) = P ( ω , z = 0 ) exp i ω α + i β z P(omega,z)=P(omega,z=0)exp(-i(omega)/(alpha+i beta)z)P(\omega, z)=P(\omega, z=0) \exp \left(-i \frac{\omega}{\alpha+i \beta} z\right)P(ω,z)=P(ω,z=0)exp(iωα+iβz)
By simple algebra, rewrite equation (B-110) as follows:
P ( ω , z ) = P ( ω , z = 0 ) 2 exp ( i ω α α 2 + β 2 z ) exp ( ω β α 2 + β 2 z ) P ( ω , z ) = P ( ω , z = 0 ) 2 exp i ω α α 2 + β 2 z exp ω β α 2 + β 2 z P(omega,z)=P(omega,z=0)^(2)exp(-i(omega alpha)/(alpha^(2)+beta^(2))z)exp(-(omega beta)/(alpha^(2)+beta^(2))z)P(\omega, z)=P(\omega, z=0)^{2} \exp \left(-i \frac{\omega \alpha}{\alpha^{2}+\beta^{2}} z\right) \exp \left(-\frac{\omega \beta}{\alpha^{2}+\beta^{2}} z\right)P(ω,z)=P(ω,z=0)2exp(iωαα2+β2z)exp(ωβα2+β2z)
For most rocks, the assumption that β β beta\betaβ is much smaller than α α alpha\alphaα can be made. As a result, equation (B-111) can be simplified as follows:
P ( ω , z ) = P ( ω , z = 0 ) exp ( i ω α z ) exp ( ω β α 2 z ) P ( ω , z ) = P ( ω , z = 0 ) exp i ω α z exp ω β α 2 z P(omega,z)=P(omega,z=0)exp(-i(omega )/(alpha)z)exp(-(omega beta)/(alpha^(2))z)P(\omega, z)=P(\omega, z=0) \exp \left(-i \frac{\omega}{\alpha} z\right) \exp \left(-\frac{\omega \beta}{\alpha^{2}} z\right)P(ω,z)=P(ω,z=0)exp(iωαz)exp(ωβα2z)
a

s

7म्नाम
1 40

12 2 x 12 2 x (12)/(2)x\frac{12}{2} x122x

20
2
C
FIG. B-d. Surface-consistent deconvolution applied to field data: autocorrelograms of (a) the source term, and (b) the receiver term as in equation (B-94), (c) conventional trace-by-trace prestack deconvolution, and (d) surface-consistent deconvolution using the autocorrelation estimates as in (a) and (b) (Analysis by Duane Dopkin).
Now, define a vertical time variable τ τ tau\tauτ equivalent to the depth variable z z zzz via z = α τ z = α τ z=alpha tauz=\alpha \tauz=ατ, and rewrite equation (B-112):
P ( ω , τ ) = P ( ω , τ = 0 ) exp ( i ω τ ) exp ( ω β α τ ) P ( ω , τ ) = P ( ω , τ = 0 ) exp ( i ω τ ) exp ω β α τ P(omega,tau)=P(omega,tau=0)exp(-i omega tau)exp(-omega(beta )/(alpha)tau)P(\omega, \tau)=P(\omega, \tau=0) \exp (-i \omega \tau) \exp \left(-\omega \frac{\beta}{\alpha} \tau\right)P(ω,τ)=P(ω,τ=0)exp(iωτ)exp(ωβατ)
Assume an attenuation constant Q Q QQQ that is independent of frequency ω ω omega\omegaω (Kjartansson, 1979):
1 2 Q = β α 1 2 Q = β α (1)/(2Q)=(beta )/(alpha)\frac{1}{2 Q}=\frac{\beta}{\alpha}12Q=βα
and substitute into equation (B-113) to obtain
P ( ω , τ ) = P ( ω , τ = 0 ) exp ( i ω τ ) exp ( ω τ 2 Q ) P ( ω , τ ) = P ( ω , τ = 0 ) exp ( i ω τ ) exp ω τ 2 Q P(omega,tau)=P(omega,tau=0)exp(-i omega tau)exp(-(omega tau)/(2Q))P(\omega, \tau)=P(\omega, \tau=0) \exp (-i \omega \tau) \exp \left(-\frac{\omega \tau}{2 Q}\right)P(ω,τ)=P(ω,τ=0)exp(iωτ)exp(ωτ2Q)
Note from equation (B-115) that the higher the frequency the greater the attentation.
For a nondissipative medium, β = 0 β = 0 beta=0\beta=\mathbf{0}β=0; hence, equation (B-114) states that Q Q QQQ is infinite. As a result, equation (B-115) takes the special form
P ( ω , τ ) = P ( ω , τ = 0 ) exp ( i ω τ ) P ( ω , τ ) = P ( ω , τ = 0 ) exp ( i ω τ ) P(omega,tau)=P(omega,tau=0)exp(-i omega tau)P(\omega, \tau)=P(\omega, \tau=0) \exp (-i \omega \tau)P(ω,τ)=P(ω,τ=0)exp(iωτ)
The amplitude spectrum of the inverse Q Q QQQ filter is thus given by the exponential scaling function
A ( ω , τ ) = exp ( ω τ 2 Q ) A ( ω , τ ) = exp ω τ 2 Q A(omega,tau)=exp((omega tau)/(2Q))A(\omega, \tau)=\exp \left(\frac{\omega \tau}{2 Q}\right)A(ω,τ)=exp(ωτ2Q)
The phase spectrum can either be set to zero, or more appropriately, assumed to be minimumphase. In the latter case, it can be computed by taking the Hilbert transform of the amplitude spectrum given by equation (B-117a) (Section B.4):
ϕ ( ω , τ ) = H { A ( ω , τ ) } ϕ ( ω , τ ) = H { A ( ω , τ ) } phi(omega,tau)=H{A(omega,tau)}\phi(\omega, \tau)=\mathbf{H}\{A(\omega, \tau)\}ϕ(ω,τ)=H{A(ω,τ)}
where H H H\mathbf{H}H represents the Hilbert transform.
By combining the amplitude and phase spectra given by equations ( B 117 a , b ) B 117 a , b ) B-117 a,b)B-117 a, b)B117a,b), we define the minimum-phase inverse Q Q QQQ filter as
W ( ω , τ ) = A ( ω , τ ) exp { i ϕ ( ω , τ ) } W ( ω , τ ) = A ( ω , τ ) exp { i ϕ ( ω , τ ) } W(omega,tau)=A(omega,tau)exp{-i phi(omega,tau)}W(\omega, \tau)=A(\omega, \tau) \exp \{-i \phi(\omega, \tau)\}W(ω,τ)=A(ω,τ)exp{iϕ(ω,τ)}
The inverse Q Q QQQ filtering equation (B-115) now takes the form
P ( ω , τ ) = P ( ω , τ = 0 ) exp ( i ω τ ) W ( ω , τ ) P ( ω , τ ) = P ( ω , τ = 0 ) exp ( i ω τ ) W ( ω , τ ) P(omega,tau)=P(omega,tau=0)exp(-i omega tau)W(omega,tau)P(\omega, \tau)=P(\omega, \tau=0) \exp (-i \omega \tau) W(\omega, \tau)P(ω,τ)=P(ω,τ=0)exp(iωτ)W(ω,τ)
Note that the time variable t t ttt is associated with the input trace P ( t , τ = 0 ) P ( t , τ = 0 ) P(t,tau=0)P(t, \tau=0)P(t,τ=0) and the time variable τ τ tau\tauτ is associated with the output trace P ( t = 0 , τ ) P ( t = 0 , τ ) P(t=0,tau)P(t=0, \tau)P(t=0,τ) after the application of the inverse Q Q QQQ filter.
To apply the filter W ( ω , τ ) W ( ω , τ ) W(omega,tau)W(\omega, \tau)W(ω,τ) to a trace P ( ω , τ = 0 ) P ( ω , τ = 0 ) P(omega,tau=0)P(\omega, \tau=0)P(ω,τ=0), define a time step Δ τ Δ τ Delta tau\Delta \tauΔτ and write equation (B-119) in its recursive form:
P ( ω , k Δ τ ) = P [ ω , ( k 1 ) Δ τ ] exp ( i ω Δ τ ) W ( ω , Δ τ ) P ( ω , k Δ τ ) = P [ ω , ( k 1 ) Δ τ ] exp ( i ω Δ τ ) W ( ω , Δ τ ) P(omega,k Delta tau)=P[omega,(k-1)Delta tau]exp(-i omega Delta tau)W(omega,Delta tau)P(\omega, k \Delta \tau)=P[\omega,(k-1) \Delta \tau] \exp (-i \omega \Delta \tau) W(\omega, \Delta \tau)P(ω,kΔτ)=P[ω,(k1)Δτ]exp(iωΔτ)W(ω,Δτ)
where k = 1 , 2 , , n k = 1 , 2 , , n k=1,2,dots,nk=1,2, \ldots, nk=1,2,,n, with n n nnn number of time steps (number of samples in the input trace).
Equation (B-120) can now be used to describe a procedure for inverse Q Q QQQ filtering:
(a) Fourier transform the input trace P ( t , τ = 0 ) P ( t , τ = 0 ) P(t,tau=0)P(t, \tau=0)P(t,τ=0) to obtain the complex transform function P ( ω , τ = 0 ) P ( ω , τ = 0 ) P(omega,tau=0)P(\omega, \tau=0)P(ω,τ=0).
(b) Define a time step Δ τ Δ τ Delta tau\Delta \tauΔτ and apply the linear phase shift to P ( ω , τ = 0 ) P ( ω , τ = 0 ) P(omega,tau=0)P(\omega, \tau=0)P(ω,τ=0) by multiplying with the exponential exp ( w Δ τ ) exp ( w Δ τ ) exp(-w Delta tau)\exp (-w \Delta \tau)exp(wΔτ).
(c) Specify a constant Q Q QQQ and apply the inverse Q Q QQQ filter given by equation (B-117a,b) that represents the inverse Q Q QQQ filter.
(d) Repeat steps (a), (b), and (c) for all frequencies.
(e) Sum over all frequencies to obtain the inverse Q Q QQQ-filtered wavcfield at time step Δ τ Δ τ Delta tau\Delta \tauΔτ given by P ( t = 0 , Δ τ ) P ( t = 0 , Δ τ ) P(t=0,Delta tau)P(t=0, \Delta \tau)P(t=0,Δτ).
(f) Repeat step (d) for all time steps k Δ T , k = 1 , 2 , , n k Δ T , k = 1 , 2 , , n k Delta T,k=1,2,dots,nk \Delta T, k=1,2, \ldots, nkΔT,k=1,2,,n, to obtain the inverse Q Q QQQ-filtered wavefield P ( t = 0 , τ ) P ( t = 0 , τ ) P(t=0,tau)P(t=0, \tau)P(t=0,τ) at all times τ τ tau\tauτ.
b
c
d
FIG. B-5. Inverse Q Q QQQ filtering applied to field data (Saatcilar, 1996): Portion of a stacked section with (a) no deconvolution, (b) inverse Q Q QQQ filtering, (c) inverse Q Q QQQ filtering followed by deconvolution, and (d) deconvoiution, only; (e) average amplitude spectrum of the data shown in (a); (f) average amplitude spectrum of the data shown n (b); (g) average amplitude spectrum of the data shown in (c).
Inverse Q Q QQQ filtering often is applied to data using a constant Q Q QQQ factor. An efficient scheme for a vertically varying Q Q QQQ factor is described by Hargreaves and Calvert (1991).
Figure B-5 shows an example of inverse Q Q QQQ filtering applied to field data. Compare the stacked sections and the average amplitude spectra with no deconvolution, inverse Q Q QQQ filtering, juverse Q Q QQQ filtering followed by deconvolution and deconvolution, only. An inverse Q Q QQQ filter restores the high-frequency components of signal subjected to intrinsic attenuation by the propagation medium. The deconvolution that follows the inverse Q Q QQQ filtering then easily flattens the spectrum within the passband.

REFERENCES

Backus, M. M., 1959, Water reverberations: Their nature and elimination: Geophysics, 24, 233-261.
Cambois, G. and Stoffa, P. L., 1992, Surface-consistent deconvolution in the log-Fourier doman: Geophysics, 57, 823-840.
Cary, P. W. and Lorentz, G. A., 1993, Four-component surface-consistent deconvolutiou: Geophysics, 58, 383-392.
Claerbout, J. F., 1976, Fundamentels of geophysical data processing: McGraw-Hill Book Co.
Gibson, B. and Larner, K. L, 1982, Comparison of spectral Hattening techniques: unpublished technical document, Western Geophysical Company.
Goupillaud, P., 1961, An approach to inverse filtering of near-surface layer effects from seismic records: Geophysics, 26, 754-760.
Hale, I. D., 1982, Q Q QQQ-adaptive deconvolution: Stanford Expl, Proj, Rep. No. 30, 133-158.
Hargreaves, N. D. and Calvert, A. J., 1991, Inverse Q Q QQQ filtering by Fourier transform: Geophysics, 56, 519-527.
Kjartansson, E., 1979, Constant Q-wave propagation and attenuation: J. Geophys. Res., 84, 47374748.
Levin, S. A., 1989, Surface-consistent deconvolution: Geophysics, 54, 1123-1133.
Lincs, L. R. and Treitel, S., 1984, Tutorial: A review of least-squares inversion and its application to geophysical problems: Geophys. Prosp., 32, 159-186.
Morley, L. and Claerbout, J. F., 1983, Predictive deconvolution in shot-teceiver space: Geophysics, 48, 515 531 515 531 515-531515-531515531.
Peacock, K. L. and Treitel, S., 1969, Predietive deconvolution - theory and practice: Geophysics, 34 , 155 169 34 , 155 169 34,155-16934,155-16934,155169.
Ristow, D. and Jurezyk, D., 1975, Vibroseis deconvolution: Geophys. Prosp., 23, 363-379.
Robinson, E. A. and Treitel, S., 1980, Geophysical signal analysis: Prentice-Hall Book Co.
Seatcilar, R., 1996, An algorithm for Q Q QQQ-filtering: J. Seis. Expl., 5, 157-168.
Taner, M. T. and Coburn, K., 1981, Surface-consistent deconvolution: Presented at the 51st Ann. Internat. Mtg., Soc. Expl. Geophys.
Taner, M. T. and Koehler, F., Surface-consistent corrections: Geophysics, 46, 17-22.
Treitel, S. and Robinson, E. A., 1966, The dosign of high-resolution filters: Inst. Electr. Electron. Eng., GE-4, 1 .
Walden, A. T. and Hosken, J. W. J., 1984, An investigation of the spectral properties of primary reflections coefficients: Presented at the 46th Ann. Mtg. Eur. Assoc. Expl. Geophys.
Waters, K. H., 1981, Reflection seismology: Second edition, John Wiley & Sons.
Yilmaz, O., 1974, The problems of resolution and reverberations in reflection seismology: J J J\mathrm{J}J. Geophys. Soc. Turkey, 5 , 2 5 , 2 5,25,25,2.

3 Velocity Analysis and Statics Corrections

\begin{abstract}
- Introduction *\cdot Normal Moveout *\cdot NMO for a Flat Reflector *\cdot NMO in a Horizontally Stratified Earth *\cdot FourthOrder Moveout *\cdot NMO Stretching *\cdot NMO for a Dipping Reflector \bullet NMO for Several Layers with Arbitrary Dips *\cdot Moveout Velocity versus Stacking Velocity *\cdot Velocity Analysis *\cdot The Velocity Spectrum *\cdot Measure of Coherency - Factors Affecting Velocity Estimates - Interactive Velocity Analysis - Horizon Velocity Analysis - Coherency Attribute Stacks - Residual Statics Corrections - Residual Statics Estimation by Traveltime Decomposition - Residual Statics Estimation by Stack Power Maximization - Traveltime Decomposition in Practice - Maximum Allowable Shift *\cdot Correlation Window \bullet Other Considerations \bullet Stack-Power Meximization in Practice \bullet Refraction Statics Corrections *\cdot First Breaks *\cdot Field Statics Corrections *\cdot Flat Refractor *\cdot Dipping Refractor *\cdot The PlusMinus Method \bullet The Generalized Reciprocal Method \bullet The Least-Squeres Method \bullet Processing Sequence for Statics Corrections *\cdot Model Experiments *\cdot Field Data Examples *\cdot Exercises *\cdot Appendix C: Topics in Moveout and Statics Corrections *\cdot The Shifted Hyperbola *\cdot Moveout Stretch *\cdot Equations for a Dipping Reflector *\cdot Traveltime Decomposition for Residual Statics Estimation \bullet Depth Estimation from Refracted Arrivals \bullet Equations for a Dipping Refractor ~  The Plus-Minus Times *\cdot Generalized Linear Inversion of Refracted Arrivals - Refraction Traveltime Tomography L 1 L 1 L_(1)L_{1}L1-Norm Refraction Statics *\cdot References
\end{abstract}

3.0 INTRODUCTION

A sonic log log log\loglog represents derect measurement of the velocity with which seismic waves travel in the earth as a function of depth. Seismic data, on the other hand, provide an indinect measurement of velocity. Based on these two types of information, the exploration seismologist derives a large number of different types of velocity - interval, apparent, average, root-mean-square (rms), instantaneous, phase, group, normal moveout (NMO), stacking, and migration velocities. However, the velocity that can be derived reliably from seismic data is the velocity that yields the best stack.
Assuming a layered media, stacking velocity is re- lated to normal-moveout velocity. This, in turn, is related to the root-mean-squared (rms) velocity, from which the average and interval velocities are derived. Interval velocity is the average velocity in an interval between two reflectors.
Several factors influence interval velocity within a rock unit with a certain lithologic composition:
(a) Pore shape,
(b) Pote pressure,
(c) Pore fluid saturation,
(d) Conftning pressure, and
(e) Temperature.

Conflning Pressure (kbar)

FIG. 3.0-1. Change of P P PPP - and S S SSS-wave velocities as a function of confining pressure observed in dry and watersaturated Bedford hmestone samples with pores in the form of microcracks. Fluid volume has been kept constant duting measurements. Here, S = S = S=S=S= saturated, D = d r y , v p = D = d r y , v p = D=dry,v_(p)=D=\mathrm{dry}, v_{p}=D=dry,vp= P P PPP-wave velocity, and v S = S v S = S v_(S)=Sv_{S}=SvS=S-wave velocity. (Adapted from Nur, 1981.)
These factors have been investigated extensively under laboratory conditions. Figure 3.0-1 shows laboratory measurements of velocity as a function of the confining pressure in a Bedford limestone sample with pores in the form of microcracks. The experiment was conducted using enclosed samples to control the pore fluid pressure independent of the confining pressure. tions:
From Figure 3.0-1, we make the following obsetva-
(a) Both compressional ( P ) ( P ) (P)(P)(P) and shear ( S ) ( S ) (S)(S)(S) wave velocities increase with increasing confining pressure. More specifically, velocity generally increases rapidly with confining pressure at small confining pressures, then gradually levels off at high confining pressures. The reason for this is that as the confining pressure increases, pores close. However, at a high confining pressure, not much deformable pore space is left. Therefore, any further increase in the confining pressure will not cause i significant increase in velocity.
(b) Note that, regardless of confining pressure, P P PPP-wave velocity is greater than S S SSS-wave velocity. This is true for any rock type.
(c) The saturated rock sample has a higher P P PPP-wave velocity than the dry sample at low confining pressure. At bigh confining pressures, P P PPP-wave velocity

Confining Pressure (kbar)

FIG. 3.0-2. Change of P P PPP - and S S SSS-wave velocities as a function of confining pressure observed in Berea sandstone sarnples with rounded pores. Fluid volume has been kept constant during measurements. Here, v p = P v p = P v_(p)=Pv_{p}=Pvp=P-wave velocity and v S = S v S = S v_(S)=Sv_{S}=SvS=S.wave velocity. (Adepted from Nur, 1981.)
in the dry sample approaches the magnitude of the P P PPP-wave velocity in the saturated sample.
(d) Note also that the P P PPP-wave velocity in the saturated sample does not change as rapidly as in the dry sample. This is because the fluid is almost as incompressible as the rock. Whether the pores are filled with fluid or not has little effect on S S SSS-wave velocity, since fluids cannot support shear-wave propagation.
We now examine velocity as a function of confining pressure for an enclosed sample of Berea sandstonc with rounded pores (Figure 3.0-2). Again, note the increase in velocity with increasing confining pressure. The important difference between this sample and the one in Figure 3.0-1 is the range of magnitude of the velocity. The rock with microcracks has a higher velocity than the rock with rounded pores at any given confining pressure. The reason for this is that it is easier to close the pores formed as microcracks than it is to close those that are round.
The most prominent factor influencing velocity in a rock of given lithology and porosity probably is confining pressure. This type of pressure arises from the overburden and increases with depth. It is generally true that velocity increases with depth. However, because of factors such as pore pressure, there may be inversion in the velocity within a layer.
FIG. 3.0-3. Velocity range for rocks of different lithologic compasitions at different depths of burial. (Adapted from Sheriff, 1976; courtesy American Association of Petroleum Geologists.)
Figure 3.0-3 shows the variation of velocity with depth for various types of lithology. We make the following observations:
(a) Tertiary clastics, which usually are less indurated than other rocks, occupy the low-velocity end of the graph. They generally start out with a velocity that ranges from 1.5 to 2.5 k m / s 2.5 k m / s 2.5km//s2.5 \mathrm{~km} / \mathrm{s}2.5 km/s at or near the surface, then gradually increase to from 4.5 to 5.5 k m / s k m / s km//s\mathrm{km} / \mathrm{s}km/s at depths greater than 5 k m 5 k m 5km5 \mathrm{~km}5 km.
(b) Carbonates with high porosity occupy the central portion of the graph, starting at about 3 k m / s 3 k m / s 3km//s3 \mathrm{~km} / \mathrm{s}3 km/s and increasing to nearly 6 k m / s 6 k m / s 6km//s6 \mathrm{~km} / \mathrm{s}6 km/s.
(c) Carbonates with low porosity, on the other hand, have a smaller range of variation in velocity. If there is not much pore space to close, then the confining pressure cannot cause much of an increase in velocity.
This chapter discusses ways to estimate velocities from seismic data. Velocity estimation requires the data recorded at nonzero offsets provided by commonmidpoint (CMP) recording. With estimated velocities, we can correct reflection traveltimes for nonzero offset and compress the recorded data volume (in midpointoffset-time coordinates) to a stacked section (Figure 1.5 1 ) 1 ) 1)1)1).
For a single constant-vclocity horizontal layer, the reflection traveltime curve as a function of offet is a hyperbola (Section 3.1). The time difference between traveltime at a given offset and at zero offset is called normal moveout (NMO). The velocity required to correct for normal moveout is called the normal moveout velocaty. In the case of an earth model with a single horizontal reflector, the NMO velocity is equal to the velocity of the medium above the reflector. In the case of an earth model with a single dipping reflector, the NMO velocity is equal to the medium velocity divided by the cosine of the dip angle. When the dipping reflector is viewed in three dimensions, then the azimuth angle (between the dip direction and the profiling direction) becomes an additional factor. Traveltime as a function of offset for a series of horizontal isovelocity layers is approximated by a hyperbola. This approximation is better at small offsets than large offsets. For short offsets, the NMO velocity for a horizontally layered earth model is equal to the rms velocity down to the layer boundary under consideration. In a medium composed of layers with arbitrary dips, the traveltime equation gets complicated. However, in practice, as long as dips are gentle and the spread is small (less than reflector depth), the hyperbolic assumption still can be made. For layer boundaries with arbitrary shapes, the hyperbolic assumption breaks down.
There is a difference between the NMO and stacking velocities that often is ignored in practice. The NMO velocity is based on the small-spread hyperbolic traveltime (Tarer and Koehler, 1969; Al-Chalabi, 1973), while stacking velocity is based on the hyperbola that best fits data over the entire spread length. Nevertheless, stacking velocity and NMO correction velocity generally are considered equivalent.
Conventional velocity analysis is based on the hyperbolic assumption. Various methods for velocity analysis are discussed in Section 3.2. The hyperbolic travcltime equation is linear in the t 2 x 2 t 2 x 2 t^(2)-x^(2)t^{2}-x^{2}t2x2 plane, where t t ttt is the two-way traveltime and x x xxx is the source-recciver offset. Zero-offset time and stacking velocity for a given reflector can be estimated from the line that best fits the traveltime picks plotted on the t 2 x 2 t 2 x 2 t^(2)-x^(2)t^{2}-x^{2}t2x2 plane. Another way to estimate the NMO velocity is to apply different NMO corrections to a CMP gather using a range of constant velocity values, then display them side by side. The velocity that best flattens each event as a function of offset is picked as its NMO velocity. Alternatively, a small portion of a line can be stacked with a range of constant velocity values. These constant-velocity stacks (CVS) can be plotted in the form of a panel. Stacking velocities that yield the desired stack then can be picked from the CVS panel.
Another commonly used velocity analysis technique is based on computing the velocity spectrum (Taner and Kochler, 1969). The idea is to display some
measure of signal coherency on a graph of velocity versus two-way zero-offset time. The underlying principle is to compute the signal coherency on the CMP gather in small time gates that follow a trajectory in offset. Stacking velocities are interpreted from velocity spectra by choosing the velocity function that produces the highest coherency at times with significant event amplitudes.
Occasionally the stacking velocity variation needs to be determined in detail along a particular reflector. Horizon-consistent velocity analysis provides the stacking velocity variation in the lateral direction along a particular horizon of interest.
Reflection traveltimes are not always hyperbolic in horizontally layered media. One reason that traveltine often deviates from a perfect hyperbola is the presence of static time shifts caused by near-surface velocity variations. Statics carl severely distort the reflection hyperbola when there are large surface elevation changes or when the weathering layer varies horizontally. Shown in Figure 3.0-4 is a stacked section that exhibits severe distortions of reflection traveltimes in the susburface, which is known to have generally flat layers, caused by the complexity in the near-surface that is composed of glacia] tills with irregular shapes. The traveltime distortions caused by the near-surface also are observed in the CMP gather shown in Figure 3.0-5a. The velocity spectrum derived from the CMP gather that has not been corrected for the near-surface does not exhibit a reliable stacking velocity trend (Figure 3.0-6a). By estimating a model for the near-surface and correcting for its effects on the reflcction traveltimes in the subsurface using the refracted arrivals from the near-surface, the resulting CMP gathor (Figure 3.0 5 b 3.0 5 b 3.0-5b3.0-5 \mathrm{~b}3.05 b ) yields a more accurate estimate of stacking velocities (Figure 3.0-6b). The CMP stack derived from the CMP gathers with statics corrections exhibits reflection traveltimes free of the near-surface distortions (Figure 3.0-7). A close-up of portions of the CMP stack without (Figure 3.0-4) and with (Figure 3.0-7) statics corrections clearly demonstrates the improvement achieved by the statics corrections as shown in Figure 3.10-8.
Residual statics variations usually remain in the data even after initial corrections for estimated weathering layer variations and elevation changes (field statics) (Section 3.4). Corrections for residual statics normally must be estimated and applied to CMP gathers before stacking. Estimation is done after a preliminary NMO correction using either a regional velocity function or information from a series of preliminary velocity analyses along the line. Following the residual statics corrections, velocity analyses usually are repeated to revise the velocity picks for stacking. Various aspects of residwal statics corrections are discussed in Sections 3.3 and 3.4 .
As a final note, velocities required by stacking and migration are not necessarily the same. In fact, for data collected parallel to the dip direction of a single dipping reflector, stacking velocity is the velocity of the medium above the reflector divided by the cosine of the dip angle, while migration velocity is the velocity of the medium itself. In other words, stacking velocity is dipdependent, while migration velocity is not. Migration velocity estimation is discassed in Section 5.4.

3.2 NORMAL MOVEOUT

Consider a reflection event on a CMP gather. The difference between the two-way time at a given offset and the two-way zero-offset time is called normal moveont (NMO). Reflection traveltimes must be corrected for NMO prior to summing the traces in the CMP gather along the offset axis. The normal moveout depends on velocity above the reflector, offset, two-way zero-offset time associated with the reflection event, dip of the reflector, the source-receiver azimuth with respect to the true-dip direction, and the degree of complexity of the near-surface and the medium above the reflector.

NMO for a Flat Reflector

Figure 3.1-1 shows the simple case of a single horizontal layer. At a given midpoint location M M MMM, we want to compute the reflection traveltime t t ttt along the raypath from shot position S S SSS to depth point D D DDD then back to receiver position G G GGG. Using the Pythagorean theorem, the traveltime equation as a. function of offset is
t 2 = t 0 2 + x 2 v 2 t 2 = t 0 2 + x 2 v 2 t^(2)=t_(0)^(2)+(x^(2))/(v^(2))t^{2}=t_{0}^{2}+\frac{x^{2}}{v^{2}}t2=t02+x2v2
where x x xxx is the distance (offset) between the source and receiver positions, v v vvv is the velocity of the medium above the reflecting interface, and t 0 t 0 t_(0)t_{0}t0 is twice the traveltime along the vertical path M D M D MDM DMD. Note that vertical projection of depth point D D DDD to the surface, along the normal to the reflector, coincides with midpoint M M MMM. This occurs only when the reflector is horizontal.
Equation (3-1) describes a hyperbola in the plane of two-way time versus offset. Figure 3.1-2 is an example of traces in a common-midpoint (CMP) gather. The figure also represents a common-depth-point (CDP) gather, since all the raypaths associated with each source-receiver pair reflect from the same subsurface depth point D D DDD. The offset range in Figure 3.1-2 is 0 to 3150 m 3150 m 3150m3150 \mathrm{~m}3150 m, with a 50 m 50 m 50-m50-\mathrm{m}50m trace separation. The medium velocity above the reflector is 2264 m / s 2264 m / s 2264m//s2264 \mathrm{~m} / \mathrm{s}2264 m/s. All of the traces
3770
Primpthenther
(a)
(b)
FIG. 3.0-5. A CMP gather associated with the stacked section in Figure 3.0-4 (a) without, and (b) with statics corrections.
(a)
(b)
FIG. 3.0-6. Velocity spectra derived from the CMP gather shown in Figure 3.0-5 (a) without, and (b) with statics corrections,
in this CMIP gather contain a refiection from the same depth point.
From equation (3-1), we see that velocity can be computed when offset x x xxx and two-way times t t ttt and t 0 t 0 t_(0)t_{0}t0 are known. Once the NMO velocity is estimated, the traveltimes can be corrected to remove the effect of offset as shown in Figure 3.1-3. Traces in the NMO-corrected gather then are summed to obtain a stack trace at the particular CMIP location.
The numerical procedure involved in hyperbolic moveout correction is illustrated in Figute 3.1-4. The idea is to find the amplitude value at A A A^(')A^{\prime}A on the NMOcorrecterl gather from the amplitude value at A A AAA on the original CMP gather. Given quantities t 0 , x t 0 , x t_(0),xt_{0}, xt0,x, and v N M O v N M O v_(NMO)v_{N M O}vNMO, compute t t ttt from equation (3-1). Assume that this is 1003 mas. If the sampling interval were 4 m s 4 m s 4ms4 \mathrm{~ms}4 ms, then this time is exuivalent to the 250.25 sample index. The amplitude value at this time can be computed using the ampli- tudes at the neighboring integer sample valus, two on each side at 248 , 249 , 251 248 , 249 , 251 248,249,251248,249,251248,249,251, and 252 sample indexes. This is done by an interpolation scheme that involves the four samples.
An alternative numerical method for mapping trace amplitudes from a nonzero-offset to zero offset involves a nearest-neighbor sample as the output value. Accurate implementation of this method requires, first, oversampling the tracts in a CMP gather along the time axis. Specifically, for each trace in the CMP gather, perform 1-D Fourier transform and pad the frequency axis with zeroes, usually by a factor of eight. Then, inverse transform back to the time domain and obtain a trace which has eight times as many samples at a sampling interval that is one-eighth of the original sampling rate. Now, given quantitics t 0 , x t 0 , x t_(0),xt_{0}, xt0,x, and v N M O v N M O v_(NMO)v_{N M O}vNMO, again, compute t t ttt from equation (3-1). Assume that this is t = 1003.4 t = 1003.4 t=1003.4t=1003.4t=1003.4 ms. If the original sampling interval were 4 ms, after

(a)
2727029290313103333035350373703939041410
(b)
FIG. 3.0-8. A close-up of portions of the CMP stacks shown in (a) Figure 3.0-4 and (b) Figure 3.0-7.
oversampling, the new sampling interval is 0.5 m s 0.5 m s 0.5ms0.5 \mathrm{~ms}0.5 ms. Then the amplitude at t = 1003.4 m s t = 1003.4 m s t=1003.4mst=1003.4 \mathrm{~ms}t=1003.4 ms can be borrowed from the nearest-neighbor sample with an index of 2006 without much sacrifice in accuracy.
The NMO correction is given by the difference between t t ttt and t 0 t 0 t_(0)t_{0}t0 :
Δ t N M O = t t 0 Δ t N M O = t t 0 Deltat_(NMO)=t-t_(0)\Delta t_{N M O}=t-t_{0}ΔtNMO=tt0
or, by way of equation (3-1),
Δ t N M O = t 0 [ 1 + ( x v N M O t 0 ) 2 1 ] . Δ t N M O = t 0 1 + x v N M O t 0 2 1 . Deltat_(NMO)=t_(0)[sqrt(1+((x)/(v_(NMO)t_(0)))^(2))-1].\Delta t_{N M O}=t_{0}\left[\sqrt{1+\left(\frac{x}{v_{N M O} t_{0}}\right)^{2}}-1\right] .ΔtNMO=t0[1+(xvNMOt0)21].
Table 3-1 shows the moveout corrections for two different offset values using a realistic velocity function that increases with reflector depth.
From Table 3-1, note that the NMO increases with offset and decreases with zero-offset time, hence, with depth. The NMO also is smaller for higher velocities, and the combined effect of higher velocities at larger depths makes it much smaller.
For a flat reflector with an overlying homogeneous medium, the reflection hyperbola can be corrected for offset if the correct medium velocity is used in the NMO equation. From Figure 3.1-5, if a velocity higher than the actual medium velocity ( 2264 m / s ) ( 2264 m / s ) (2264m//s)(2264 \mathrm{~m} / \mathrm{s})(2264 m/s) is used, then
Table 3-1. NMO correction as a function of offset x x xxx and two-way zero-offset time t 0 t 0 t_(0)t_{0}t0 for a given velocity function v N M O v N M O v_(NMO)v_{N M O}vNMO
Δ t N M O Δ t N M O Deltat_(NMO)\Delta t_{N M O}ΔtNMO, in s
x = 1000 m x = 1000 m x=1000mx=1000 \mathrm{~m}x=1000 m
Deltat_(NMO), in s x=1000m| $\Delta t_{N M O}$, in s | | :---: | | $x=1000 \mathrm{~m}$ |
Δ t N M O Δ t N M O Deltat_(NMO)\Delta t_{N M O}ΔtNMO, in s
x 2000 m x 2000 m x-2000mx-2000 \mathrm{~m}x2000 m
Deltat_(NMO), in s x-2000m| $\Delta t_{N M O}$, in s | | :---: | | $x-2000 \mathrm{~m}$ |
0.25 2000 0.309 0.780
0.5 2500 0.140 0.443
1 1 1\mathbf{1}1 3000 0.054 0.201
2 3500 0.020 0.080
4 4 4\mathbf{4}4 4000 0.008 0.031
"Deltat_(NMO), in s x=1000m" "Deltat_(NMO), in s x-2000m" 0.25 2000 0.309 0.780 0.5 2500 0.140 0.443 1 3000 0.054 0.201 2 3500 0.020 0.080 4 4000 0.008 0.031| | | $\Delta t_{N M O}$, in s <br> $x=1000 \mathrm{~m}$ | $\Delta t_{N M O}$, in s <br> $x-2000 \mathrm{~m}$ | | :--- | :---: | :---: | :---: | | 0.25 | 2000 | 0.309 | 0.780 | | 0.5 | 2500 | 0.140 | 0.443 | | $\mathbf{1}$ | 3000 | 0.054 | 0.201 | | 2 | 3500 | 0.020 | 0.080 | | $\mathbf{4}$ | 4000 | 0.008 | 0.031 |
the hyperbola is not flattened completely. This is called undercorrection. On the other hand, if a lower velocity is used, then overcorrection results.
Figure 3.1-5 also illustrates the basis of conventional velocity analysis. NMO correction is applied to the input CMP gather using a number of trial constant velocity values in equation (3-2b). The velocity that best flattens the reflection hyperbola is the velocity that best corrects for NMO before stacking the traces in the gather. Furthermore, for a simple case of a single horizontal reflector, this velocity also is equal to the velocity of the medium above the reflector.

NMO in a Horizontally Stratified Earth

We now consider a medium composed of horizontal isovelocity layers (Figure 3.1-6). Each layer has a certain thickness that can be defined in terms of twoway zero-offset time. The layers have interval velocities ( v 1 , v 2 , , v N ) v 1 , v 2 , , v N (v_(1),v_(2),dots,v_(N))\left(v_{1}, v_{2}, \ldots, v_{N}\right)(v1,v2,,vN), where N N NNN is the number of layers. Consider the raypath from source S S SSS to depth point D D DDD, back to receiver R R RRR, associated with offset τ τ tau\tauτ at midpoint location M. Taner and Kohler (1969) derived the traveltime equation for this path as
t 2 = C 0 + C 1 x 2 + C 2 x 4 + C 3 x 6 + t 2 = C 0 + C 1 x 2 + C 2 x 4 + C 3 x 6 + t^(2)=C_(0)+C_(1)x^(2)+C_(2)x^(4)+C_(3)x^(6)+cdotst^{2}=C_{0}+C_{1} x^{2}+C_{2} x^{4}+C_{3} x^{6}+\cdotst2=C0+C1x2+C2x4+C3x6+
where C 0 = t 0 2 , C 1 = 1 / v r m g 2 C 0 = t 0 2 , C 1 = 1 / v r m g 2 C_(0)=t_(0)^(2),C_(1)=1//v_(rmg)^(2)C_{0}=t_{0}{ }^{2}, C_{1}=1 / v_{r m g}^{2}C0=t02,C1=1/vrmg2, and C 2 , C 3 , C 2 , C 3 , C_(2),C_(3),cdotsC_{2}, C_{3}, \cdotsC2,C3, are complicated functions that depend on layer thicknesses and interval velocitiss (Section C.1). The rms velocity t τ + n s t τ + n s t_(tau+ns)t_{\tau+n s}tτ+ns down to the reflector on which depth point D D DDD is situated is defined as
v r m s 2 = 1 t 0 i N v i 2 Δ τ 2 v r m s 2 = 1 t 0 i N v i 2 Δ τ 2 v_(rms)^(2)=(1)/(t_(0))sum_(i)^(N)v_(i)^(2)Deltatau_(2)v_{r m s}^{2}=\frac{1}{t_{0}} \sum_{i}^{N} v_{i}^{2} \Delta \tau_{2}vrms2=1t0iNvi2Δτ2
where Δ τ 1 Δ τ 1 Deltatau_(1)\Delta \tau_{1}Δτ1 is the vertical two-way time through the ith layer and t 0 = t 1 N Δ τ z t 0 = t 1 N Δ τ z t_(0)=sum_(t-1)^(N)Deltatau_(z)t_{0}=\sum_{t-1}^{N} \Delta \tau_{z}t0=t1NΔτz. By making the small-spread approximation (offset small compared to depth), the series in equation (3-3) can be truncated to obtain the
FIC. 3.1-1. The NMO geometry for a single horizontal reflector. The trave'time is described by a hyperbola represented by equation (3-1).
familiar hyperbolic form
t 2 = t 0 2 + x 2 v r m s 2 t 2 = t 0 2 + x 2 v r m s 2 t^(2)=t_(0)^(2)+(x^(2))/(v_(rms)^(2))t^{2}=t_{0}^{2}+\frac{x^{2}}{v_{r m s}^{2}}t2=t02+x2vrms2
When equations (3-1) and (3-4b) are compared, we see that the velocity required for NMO correction for a horizontally stratified medium is equal to the rms velocity, provided the small-spread approximation is made.
How much error is caused by dropping the higher order terms in equation (3-3)? Figure 3.1-7a shows a CMP gather based on the velocity model in Figure 3.18. Traveltimes to all four reflectors were computed by the raypath integral equations (Grant and West, 1965) that exactly describe wave propagation in a horizontally layered earth model with a given interval velocity function. We now replace the layers above the second shallow event at t 0 = 0.8 s t 0 = 0.8 s t_(0)=0.8st_{0}=0.8 \mathrm{~s}t0=0.8 s with a single layer with a velocity equal to the rms velocity down to this reflector
2264 m / s 2264 m / s 2264m//s2264 \mathrm{~m} / \mathrm{s}2264 m/s. The resulting traveltime curve, computed using equation (3-4b), is shown in Figure 3.1-7b. This procedure is repeated for the deeper events at t 0 = 1.2 t 0 = 1.2 t_(0)=1.2t_{0}=1.2t0=1.2 and 1.6 s 1.6 s 1.6s1.6 \mathrm{~s}1.6 s as shown in Figures 3.1 7 c 3.1 7 c 3.1-7c3.1-7 \mathrm{c}3.17c and d d d\mathrm{d}d. Note that the traveltime curves in Figures 3.1-7b, c c ccc, and d d ddd are perfect lyperbolas. How different are the traveltime curves in Figure 3.1-7a from these hyperbolas? After careful examination, note that the traveltimes are slightly different for the shallow events at t 0 = 0.8 t 0 = 0.8 t_(0)=0.8t_{0}=0.8t0=0.8 and 1.2 s 1.2 s 1.2s1.2 \mathrm{~s}1.2 s only at large offsets particularly beyond 3 k m particularly beyond  3 k m _("particularly beyond ")3km{ }_{\text {particularly beyond }} 3 \mathrm{~km}particularly beyond 3 km. By dropping the higher order terms, we approximate the reflection times in a horizontally layered earth with a small-spread hyperbola.

Fourth-Order Moveout

A review of the moveout equation (3-3) to attain higher accuracy at, far offsets is given in Section C.1. At first,
FIG. 3.1-2. Systhetic CMP gather associated with the geometry in Figure 3.1-1. Traveltime curve for a flat reflector is a hyperbola with its apex at zero-offset trace.
it serms that including the terms up to the fourth-order in equation (3-3) should achieve this objective:
t 2 = t 0 2 + x 2 v r m s 2 + C 2 x 4 t 2 = t 0 2 + x 2 v r m s 2 + C 2 x 4 t^(2)=t_(0)^(2)+(x^(2))/(v_(rms)^(2))+C_(2)x^(4)t^{2}=t_{0}^{2}+\frac{x^{2}}{v_{r m s}^{2}}+C_{2} x^{4}t2=t02+x2vrms2+C2x4
Nevertheless, to compute a velocity spectrum using this equation requires scanning for two parameters v r m s v r m s v_(rms)v_{r m s}vrms and C 2 C 2 C_(2)C_{2}C2; thus, making equation (3-5a) cumbersome to use for velocity analysis. Below, a practical scheme to
(a)
FIG. 3.1-3. NMO correction (equation 3-2a) involves mapping nonzero-offset traveltime t t ttt onto zero-offset traveltime t 0 t 0 t_(0)t_{0}t0. (a) Before and (b) after NMO correction.
FIG. 3.1-4. Computational description of NMO correction. For a given integer value for t 0 t 0 t_(0)t_{0}t0, and velocity v v vvv and offset x x xxx, compute t t ttt using equation (3-1). The amplitude at time t t ttt, denoted by A A AAA, does not necessarily fall onto an input integer sample location. By using two samples on each side of t t ttt (denoted by solid dots), we can interpolate between the four amplitude values to compute the amplitude value at t t ttt. This amplitude value then is mapped onto output integer sample t 0 t 0 t_(0)t_{0}t0 denoted by A A A^(')A^{\prime}A at the corresponding offset.
compute a velocity spectrum using equation (3-5a) is suggested:
(a) Drop the fourth-order term to get the small-spread hyperbolic equation (3-4b). Compute the conven-
(a)
(b)
(c)
(d)
FIG. 3.1-5. (a) CMP gather containing a single event with a moveout velocity of 2264 m / s 2264 m / s 2264m//s2264 \mathrm{~m} / \mathrm{s}2264 m/s, (b) NMO-corrected gather using the appropriate moveout velocity, (c) overcorrection because too low a velocity ( 2000 m / s 2000 m / s 2000m//s2000 \mathrm{~m} / \mathrm{s}2000 m/s ) was used in equation (3-2b), and (d) undercorrection because too high a velocity ( 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s ) was used in equation (3-2b).
tional velocity spectrum (Section 3.2) by varying v r m s v r m s v_(rms)v_{r m s}vrms in equation (3-4b), and pick an initial velocity function v r m s ( t 0 ) v r m s t 0 v_(rms)(t_(0))v_{r m s}\left(t_{0}\right)vrms(t0).
(b) Use this picked velocity function in equation (35a) to compute a velocity spectrum by varying the parameter C 2 C 2 C_(2)C_{2}C2, and pick a function C 2 ( t 0 ) C 2 t 0 C_(2)(t_(0))C_{2}\left(t_{0}\right)C2(t0).
(c) Use the picked function C 2 ( t 0 ) C 2 t 0 C_(2)(t_(0))C_{2}\left(t_{0}\right)C2(t0) in equation (3-5a) to recompute the velocity spectrum by varying v r m s v r m s v_(rms)v_{r m s}vrms. Finall y 2 y 2 y_(2)y_{2}y2 pick an updated velocity function v r m s ( t 0 ) v r m s t 0 v_(rms)(t_(0))v_{r m s}\left(t_{0}\right)vrms(t0) from this velocity spectrum.
Castle (1994) shows that a time-shifted hyperbola of the form
t = t 0 ( 1 1 S ) + ( t 0 S ) 2 + x 2 S v r m s 2 ( 3 5 b ) t = t 0 1 1 S + t 0 S 2 + x 2 S v r m s 2 ( 3 5 b ) t=t_(0)(1-(1)/(S))+sqrt(((t_(0))/(S))^(2)+(x^(2))/(Sv_(rms)^(2)))quad(3-5b)t=t_{0}\left(1-\frac{1}{S}\right)+\sqrt{\left(\frac{t_{0}}{S}\right)^{2}+\frac{x^{2}}{S v_{r m s}^{2}}} \quad(3-5 b)t=t0(11S)+(t0S)2+x2Svrms2(35b)
is an exact equivalent of the fourth-order moveout equa tion (3-5a). Here, S S SSS is a constant (Section C.1). For S = 1 S = 1 S=1S=1S=1, equation (3-5b) reduces to the conventional small-spread moveout equation (3-4b).
As for the fourth-order moveout equation (3-5a), the time-shifted hyperboiic cquation (3-5b) can, in principle, be used to conduct velocity analysis of CMP gathers.
FIG. 3.1-6. A hormontally layered earth model geometry. The traveltume to the deepest reflector is described by equation (3-3). An approximate form of this equation used in practice is given by equation (3-4b).
(a)
(b)
(c)
(d)
FIG. 3.1-7. (a) A synthetic CMP gather derived from the velocity function depicted in Figure 3.1-8; (b), (c), and (d) are CMP gathers derived from the rms velocities (indicated at the top of each gather) associated with the second, third, and fourth reflectors from the top The traveltimes in (a) were derived using the raypath integral equations for a horizontally layered earth model.
(a) Set S = 1 S = 1 S=1S=1S=1 in equation (3-5b) to get equation (3-4b). Compute the velocity spectrum by varying v r m s v r m s v_(rms)v_{r m s}vrms in equation (3-4b), and pick an initial velocity function v r m s ( t 0 ) v r m s t 0 v_(rms)(t_(0))v_{r m s}\left(t_{0}\right)vrms(t0).
(b) Use this picked volocity function in equation (35b) and compute a velocity spectrum by varying the parameter S S SSS. Pick a function S ( t 0 ) S t 0 S(t_(0))S\left(t_{0}\right)S(t0), and
(c) use it in equation (3-5b) to recompute the velocity spectrum by varying v r m s v r m s v_(rms)v_{r m s}vrms. Finally, pick an updated velocity function v r m s ( t 0 ) v r m s t 0 v_(rms)(t_(0))v_{r m s}\left(t_{0}\right)vrms(t0) from this velocity spectrum.
De Bazelaire (1988) offers an alternative moveout equation to achieve higher-order accuracy at far offsets:
t = ( t 0 t p ) + t p 2 + x 2 v s 2 t = t 0 t p + t p 2 + x 2 v s 2 t=(t_(0)-t_(p))+sqrt(t_(p)^(2)+(x^(2))/(v_(s)^(2)))t=\left(t_{0}-t_{p}\right)+\sqrt{t_{p}^{2}+\frac{x^{2}}{v_{s}^{2}}}t=(t0tp)+tp2+x2vs2
where t 0 t 0 t_(0)t_{0}t0 is the two-way zero-offset time, t p t p t_(p)t_{p}tp is related to the time at which the asymptotes of the hyperbolic traveltime trajectory converge (Section C.1), and v s v s v_(s)v_{s}vs is the reference velocity assigned to the layer below the recording surface (not the near-surface layer). When t p = t 0 t p = t 0 t_(p)=t_(0)t_{p}=t_{0}tp=t0, cquation (3-5c) reduces to the small-spread hyperbolic equation (3-4b).
Thore and Kelly (1992) demonstrate the use of equation (3-5c) to obtain a stacked section with a higher stack power compared to the conventional stack de rived from the small-spread moveout equation (3-4b). To use equation (3-5c) for velocity analysis, choose a fixed value of reference velocity v s v s v_(s)v_{s}vs. Then, for each output time t 0 t 0 t_(0)t_{0}t0 and for each offset x x xxx, apply time shift t p t p t_(p)t_{p}tp to traces in the CMP gather and compute the input time t t ttt for the offset under consideration. Compute a velocity spectrum for a range of t p t p t_(p)t_{p}tp values. Finally, pick a function t p ( t 0 ) t p t 0 t_(p)(t_(0))t_{p}\left(t_{0}\right)tp(t0) from the velocity spectrum.

NMO Stretching

Figure 3.1-9b shows the CMP gather in Figure 3.1 7 a 7 a 7a7 \mathrm{a}7a after N M O N M O NMO\mathrm{NMO}NMO correction. The rms velocity function shown in Figure 3.1-8 was used in equation (3-2b) for this correction. As a result of the NMO correction, a frequency distortion occurs, particularly for shallow events and at large offsets. This is called NMO stretching and is illustrated in Figure 3.1-10. The waveform with a dominant period T T TTT is stretched so that its period T 0 T 0 T_(0)T_{0}T0, after NMO correction, is greater than T T TTT. Stretching is a frequency distortion in which events are shifted to lower frequencies. Stretching is quantified by
FIG. 3.1-8. A hypothetical velocity function used in generating the synthetic CMP gather in Figure 3.1-7a.
Δ f f = Δ t N M O t 0 Δ f f = Δ t N M O t 0 (Delta f)/(f)=(Deltat_(NMO))/(t_(0))\frac{\Delta f}{f}=\frac{\Delta t_{N M O}}{t_{0}}Δff=ΔtNMOt0
where f f fff is the dominant frequency, Δ f Δ f Delta f\Delta fΔf is the change in frequency, and Δ t NMO Δ t NMO  Deltat_("NMO ")\Delta t_{\text {NMO }}ΔtNMO  is given by equation (3-2b). The derivation of equation (3-6) is given in Section C.1.
Table 3-2 lists the percent frequency changes caused by the NMO stretching associated with the velocity function in Table 3-1. Note that stretching is confined mainly to large offsets and shallow times. For c x c x cx\mathrm{cx}cx ample, a wavcform with a 30 H z 30 H z 30-Hz30-\mathrm{Hz}30Hz dominant frequency at 2000 m 2000 m 2000-m2000-\mathrm{m}2000m offset and t 0 = 0.25 s t 0 = 0.25 s t_(0)=0.25st_{0}=0.25 \mathrm{~s}t0=0.25 s shifts to nearly 10 H z 10 H z 10Hz10 \mathrm{~Hz}10 Hz after N M O N M O NMO\mathrm{NMO}NMO correction.
Because of the stretched waveform at large offsets, stacking the NMO-corrected CMP gather (Figure 3.1 9 b 3.1 9 b 3.1-9b3.1-9 b3.19b ) will severely damage the shallow events. This problem can be circunvented by muting the stretched zones in the gather. Autonatic muting is done by using the quantitative definition of stretching given by equation (3-6). Figures 3.1-9c and d d ddd show two versions of the CMP gather after NMO correction and muting; one version has a stretch linit of 50 percent, while the other has a stretch limit of 100 percent. The 50 -percent stretch limit does not show significant frequency distortion. However, the stretch limit can be extended to 100 percent because we want to include as much of the CMP gather in the stack as possible without degradation.
A trade-off exists between the signal-to-noise ratio and mute. In particular, if the signal-to-noise ratio is good, then it may be preferable to mute more than stretch tnute requirements to preserve signal bandwidth. On the other band, if the signal-to-noise ratio is
Table 3-2. NMO stretching
% Δ f / f % Δ f / f %Delta f//f\% \Delta f / f%Δf/f for % Δ f / f % Δ f / f %Delta f//f\% \Delta f / f%Δf/f for
t 0 , s t 0 , s t_(0),st_{0}, \mathrm{~s}t0, s v NMO , m / s v NMO  , m / s v_("NMO "),m//sv_{\text {NMO }}, \mathrm{m} / \mathrm{s}vNMO ,m/s
% = 1000 m % = 1000 m %=1000m\%=1000 \mathrm{~m}%=1000 m
x 2000 m x 2000 m x-2000mx-2000 \mathrm{~m}x2000 m
%=1000m x-2000m| $\%=1000 \mathrm{~m}$ | | :---: | | $x-2000 \mathrm{~m}$ |
0.25 2000 123 312
0.5 2500 28 89
1 3000 5 20
2 3500 1 4
4 4000 0.2 0.8
%Delta f//f for %Delta f//f for t_(0),s v_("NMO "),m//s "%=1000m x-2000m" 0.25 2000 123 312 0.5 2500 28 89 1 3000 5 20 2 3500 1 4 4 4000 0.2 0.8| | | $\% \Delta f / f$ for | $\% \Delta f / f$ for | | :--- | :---: | :---: | :---: | | $t_{0}, \mathrm{~s}$ | $v_{\text {NMO }}, \mathrm{m} / \mathrm{s}$ | $\%=1000 \mathrm{~m}$ <br> $x-2000 \mathrm{~m}$ | | | 0.25 | 2000 | 123 | 312 | | 0.5 | 2500 | 28 | 89 | | 1 | 3000 | 5 | 20 | | 2 | 3500 | 1 | 4 | | 4 | 4000 | 0.2 | 0.8 |
poor, it may be necessary to accept a large antount of stretch to get any events on the stack. A real data example is provided in Figure 3.1-11. Here, the stretched zone is sen as the low-frequency zone at the shallow part of the CMP gathers without mute applied.
Another method for optimurn selection of the mute zone is to progressively stack the data. Figure 3.1-12a is an NMO-corrected CMP gather without mute applied. Figure 3.1-12b shows the stack traces derived from the CMP gather (Figure 3.1-12a). The far right trace is the same as the far right trace in the input CMP gather. The second trace from the right is the sum of the two near-offsct traces, and so on, progressively increasing the stacking fold. The far left trace is the full-fold stack of the input CMP gather. By following the waveform along a certain event and observing where changes occur, the mute zone is derived as shown in Figure 3.1-12b. A similar procedure can be followed to determine an inside mute. This time, the stacking fold is progressively increased in the near-offset direction.
Aside from the signal-to-noise ratio, attenuation of multiples dictates the choice of a suitable mute pattern. Specifically, large offsets often are needed to attenuate multiple reflections based on moveout discrimination between primaries and multiples. An inside mute may be needed in addition to the application of a multiple attenuation technique to alleviate the small moveout discrimination between primaries and multiples at small offsets. An inside mute also may be applied to lend records to suppress ground-roll energy and air waves associated with surface sources.
Muting also is dependent upon the ultimate use of the stacked data. If the stacked data are iutended as input to amplitude inversion, you may want to apply a harsh mute to minimize the angle-dependency of reflection amplitudes inferred by the Zoeppritz equations (Section 11.3). If the stacked data are intended as input to poststack depth migration, then a limited-offset stack may be needed to minimize the amplitude and traveltine distortions caused by the nonhyperbolic noveout
(a)
(b)
(c)
(d)
FIG. 3.1-9. (a) Same gather as in Figure 31 7 a 1 31 7 a 1 31-7a_(1)31-7 a_{1}317a1 (b) after moveout correction using the rms velocty function depicted in Figure 31 8 31 8 31-831-8318, (c) and (d) after muting using threshold stretch linits of 50 and 100 percent, respectively.
associated with reflections below conplex overburden structures (Section 8.0).

NMO for a Dipping Reflector

Figure 3.1-13 depicts a medium with a single dipping reflector. We want to compute the traveltime from source location S S SSS to the reflector at depth point D D DDD, then back to receiver location G G GGG. For the dipping reflector, midpoint M M MMM is no longer a vertical projection of the depth point to the surface. The terms C D P C D P CDPC D PCDP gather and C M P C M P CMPC M PCMP gather are equivalent only when the earth is horizontally stratified. When there is subsurface dip or lateral velocity variation, the two gathers are different. Midpoint M M MMM and the normal-incidence reflection point D D D^(')D^{\prime}D remain common to all of the source-receiver pairs within the gather, regardless of dip. Depth point D D DDD, however, is different for each source-receiver pair in a CMP gather recorded over a dipping reflector.
Levin (1971), using the geometry of Figure 3.1-13, derived the following two-dimensional (2-D) traveltime
(a)
FIG. 3.1-10. A signal (a) with a period of T T TTT is stretched to a signal (b) with a period of T 0 > T T 0 > T T_(0) > TT_{0}>TT0>T after NMO correction.
(a)
(b)
(c)
FIG. 3.1-11. NMO correction and muting of a stretched zone on field data, (a) CMP gathers, (b) NMO correction, and (c) mute.
equation for a dipping reflector (Section C.3):
t 2 = t 0 2 + x 2 sin 2 α v 2 t 2 = t 0 2 + x 2 sin 2 α v 2 t^(2)=t_(0)^(2)+(x^(2)sin^(2)alpha)/(v^(2))t^{2}=t_{0}^{2}+\frac{x^{2} \sin ^{2} \alpha}{v^{2}}t2=t02+x2sin2αv2
where the two-way traveltime t t ttt is associated with the nonzero-offset raypath S D G S D G SDGS D GSDG from source S S SSS to reflection point D D DDD to receiver G G GGG, the two-way zero-offset time t 0 t 0 t_(0)t_{0}t0 is associated with the normal-incidence raypath M D M D MD^(')M D^{\prime}MD at midpoint M M MMM, and α α alpha\alphaα is the angle between the normal to the dipping reflector and the direction of the line of recording (Figure 3.1-13). The moveout velocity is then given by
t N M O = v sin α t N M O = v sin α t_(NMO)=(v)/(sin alpha)t_{N M O}=\frac{v}{\sin \alpha}tNMO=vsinα
For the 2-D geometry of the dipping reflector shown in Figure 3.1-13, note that
sin α = cos ϕ sin α = cos ϕ sin alpha=cos phi\sin \alpha=\cos \phisinα=cosϕ
where ϕ ϕ phi\phiϕ is the dip angle of the reflector. Hence, equations (3-7) and (3-8) are written in terms of the reflector dip ϕ dip ϕ dip phi\operatorname{dip} \phidipϕ
t 2 = t 0 2 + x 2 cos 2 ϕ v 2 t 2 = t 0 2 + x 2 cos 2 ϕ v 2 t^(2)=t_(0)^(2)+(x^(2)cos^(2)phi)/(v^(2))t^{2}=t_{0}^{2}+\frac{x^{2} \cos ^{2} \phi}{v^{2}}t2=t02+x2cos2ϕv2
and
v N M O = v cos ϕ . v N M O = v cos ϕ . v_(NMO)=(v)/(cos phi).v_{N M O}=\frac{v}{\cos \phi} .vNMO=vcosϕ.
The traveltime equation (3-10) for a dipping reflector represents a hyperbola as for the flat reflector (equation 3-1). However, the NMO velocity now is given by the medium velocity divided by the cosine of the dip angle as defined by equation (3-11). This equation indicates that proper stacking of a dipping event requires a velocity that is greater than the velocity of the medium above the reflector.
Table 3-3. NMO velocity for various earth models.
Model NMO Velocity
Single Horizontal
Layer
Single Horizontal Layer| Single Horizontal | | :--- | | Layer |
Velocaty of the medaum above
the reflectang interjace
Velocaty of the medaum above the reflectang interjace| Velocaty of the medaum above | | :--- | | the reflectang interjace |
Horizontally Stratified
Earth
Horizontally Stratified Earth| Horizontally Stratified | | :--- | | Earth |
The rms velocity function
proved the spread is small
The rms velocity function proved the spread is small| The rms velocity function | | :--- | | proved the spread is small |
Single Dipping Layer
Medium velocuty duvded by
cosine of the dip angle
Medium velocuty duvded by cosine of the dip angle| Medium velocuty duvded by | | :--- | | cosine of the dip angle |
Multilayered Earth
with Arbitrary Dips
Multilayered Earth with Arbitrary Dips| Multilayered Earth | | :--- | | with Arbitrary Dips |
The rms velocity function
pronded the spread is small
and the dips are gentle
The rms velocity function pronded the spread is small and the dips are gentle| The rms velocity function | | :--- | | pronded the spread is small | | and the dips are gentle |
Model NMO Velocity "Single Horizontal Layer" "Velocaty of the medaum above the reflectang interjace" "Horizontally Stratified Earth" "The rms velocity function proved the spread is small" Single Dipping Layer "Medium velocuty duvded by cosine of the dip angle" "Multilayered Earth with Arbitrary Dips" "The rms velocity function pronded the spread is small and the dips are gentle"| Model | NMO Velocity | | :---: | :---: | | Single Horizontal <br> Layer | Velocaty of the medaum above <br> the reflectang interjace | | Horizontally Stratified <br> Earth | The rms velocity function <br> proved the spread is small | | Single Dipping Layer | Medium velocuty duvded by <br> cosine of the dip angle | | Multilayered Earth <br> with Arbitrary Dips | The rms velocity function <br> pronded the spread is small <br> and the dips are gentle |
(a)
(b)
FIG. 3.1-12. Optimum mute selection. Starting with the NMO-corrected CMP gather in panel (a), a substack gather (b) is obtained. The far right trace m m mmm this gather is the same as that in the orignnal gather. The second trace from the right is the stack of the two near traces of the original gather. Finally, the far left trace is the full-fold stack obtenned from the original gather. The area above the dotted line in (b) is the mute zone.
FIG. 3.1-13. Geometry for NMO of a single dipping reflector. See text for details.
In conclusion, the NMO velocity for a dipping reflector depends on the dip angle. The larger the dip angle, the higher the moveout volocity, hence the smaller the moveout. There is a 4 percent difference between moveout velocity v N M O v N M O v_(NMO)v_{N M O}vNMO and medium velocity v v vvv for a 15 degree dip. The difference is 50 percent at a 30 -degree dip and rapidly increases at steep dips. An accompanying observation is that a horizontal layer with a high velocity can yield the same moveout as a dipping layer with a low velocity, as illustrated in Figure 3.1-14.

NMO for Several Layers with Arbitrary Dips

Figure 3.1-15 shows a 2-D subsurface geometry that is composed of a number of layers, each with an arbitrary dip. We want to compute the traveltime from source location S S SSS to depth point D D DDD, then back to receiver location G G GGG, which is associated with midpoint M M MMM. Note that the CMP ray from midpoint M M MMM hits the dipping interface at normal incidence at. D D D^(')D^{\prime}D, which is not the same as D D DDD. The zero-offset time is the two-way time along the raypath from M M MMM to D D D^(')D^{\prime}D.
Hubral and Krey (1980) derived the expression for traveltime t t ttt along S D G S D G SDGS D GSDG as
t 2 = t 0 2 + x 2 v N M O 2 + higher order terms, ( 3 12 ) t 2 = t 0 2 + x 2 v N M O 2 +  higher order terms,  ( 3 12 ) t^(2)=t_(0)^(2)+(x^(2))/(v_(NMO)^(2))+" higher order terms, "quad(3-12)t^{2}=t_{0}^{2}+\frac{x^{2}}{v_{N M O}^{2}}+\text { higher order terms, } \quad(3-12)t2=t02+x2vNMO2+ higher order terms, (312)
where the NMO velocity is given by
v N M O 2 = 1 t 0 cos 2 β 0 i = 1 N v 2 2 Δ t ı k = 1 i 1 ( cos 2 α k cos 2 β k ) v N M O 2 = 1 t 0 cos 2 β 0 i = 1 N v 2 2 Δ t ı k = 1 i 1 cos 2 α k cos 2 β k v_(NMO)^(2)=(1)/(t_(0)cos^(2)beta_(0))sum_(i=1)^(N)v_(2)^(2)Deltat_(ı)prod_(k=1)^(i-1)((cos^(2)alpha_(k))/(cos^(2)beta_(k)))v_{N M O}^{2}=\frac{1}{t_{0} \cos ^{2} \beta_{0}} \sum_{i=1}^{N} v_{2}^{2} \Delta t_{\imath} \prod_{k=1}^{i-1}\left(\frac{\cos ^{2} \alpha_{k}}{\cos ^{2} \beta_{k}}\right)vNMO2=1t0cos2β0i=1Nv22Δtık=1i1(cos2αkcos2βk)
The angles α α alpha\alphaα and β β beta\betaβ are defined in Figure 3.1-15. For a single dipping layer, equation (3-13) reduces to equation (3-8). Moreover, for a horizontally stratified earth, equation (3-13) reduces to equation (3-4), As Iong as
(a)
Offset rarr\rightarrow
(b)
(c)
FIG. 3.1-14. Moveout for low-volocity event (a) is larger than for high-velocity event (b). Moveout for low-velocity dipping event (c) may not be distinguishable from highvelocity horizontal event (b). These observations are direct consequences of equation (3-7).
the dips are gentle and the spread is small, the traveltime equation is approxinately represented by a hyperbola (equation 3-5), and the velocity required for NMO correction is approximately the rms volocity function (aquation 3-4).

Moveout Velocity versus Stacking Velocity

Table 3-3 summarizes the NMO velocity obtained from various earth models. After making the small-spread and small-dip approximations, moveout is hyperbolic for all cases and is given by
t 2 ( x ) = t 2 ( 0 ) + x 2 v N M O 2 t 2 ( x ) = t 2 ( 0 ) + x 2 v N M O 2 t^(2)(x)=t^(2)(0)+(x^(2))/(v_(NMO)^(2))t^{2}(x)=t^{2}(0)+\frac{x^{2}}{v_{N M O}^{2}}t2(x)=t2(0)+x2vNMO2
The byperbolic moveout velocity should be distinguished from the stacking velocity that optimally allows stacking of traces in a CMP gather. The hyperbolic form is used to define the best stacking path t s t k t s t k t_(stk)t_{s t k}tstk as
t s t k 2 ( x ) = t s t k 2 ( 0 ) + x 2 v s t k 2 t s t k 2 ( x ) = t s t k 2 ( 0 ) + x 2 v s t k 2 t_(stk)^(2)(x)=t_(stk)^(2)(0)+(x^(2))/(v_(stk)^(2))t_{s t k}^{2}(x)=t_{s t k}^{2}(0)+\frac{x^{2}}{v_{s t k}^{2}}tstk2(x)=tstk2(0)+x2vstk2
where v s t k v s t k v_(stk)v_{s t k}vstk is the velocity that allows the best fit of the traveltime trajectory on a CMP gather to a hyperbola within the spread length.
The optimum stacking hyperbola described by equation (3-15) is not necessarily the small-spread hyperbola given by equation (3-14). Refer to the traveltimes illustrated in Figure 3,1-16 and note the following:
(a) The observed two-way zero-offset time O C = t ( 0 ) O C = t ( 0 ) OC=t(0)O C=t(0)OC=t(0) in equation (3-14) can be different from the twoway zero-offet time O B = t s t k ( 0 ) O B = t s t k ( 0 ) OB=t_(stk)(0)O B=t_{s t k}(0)OB=tstk(0) associated with the best-fit hyperbola (equation 3-15). This occurs,
FIG. 3.1-15. Geometry for the moveout for a dipping interface in an earth model with layers of arbitracy dips (Adapted from Hubral and Krey, 1980.)
for example, if some heterogeneity exists in the velocity layers above a reflector under consideration.
(b) The difference between the stacking velocity v stk v stk  v_("stk ")v_{\text {stk }}vstk  and NMO velocity v N M O v N M O v_(NMO)v_{N M O}vNMO is called spread-length bas (Al-Chalabi, 1973; Hubral and Krey, 1980). From equations (3-14) and (3-15), the smaller the spread length, the closer the optimum stacking hyperbola to the small-spread hyperbola, hence the smallor the difference between v s t k v s t k v_(stk)v_{s t k}vstk and v N M O v N M O v_(NMO)v_{N M O}vNMO.
In practice, when we refer to stacking velocity and the zero-offset time associated with the optimum stacking hyperbola described by equation (3-15), we almost always think of the moveout velocity and the zero-offset time associated with the small-spread hyperbola given by equation (3-14).

3.2 VELOCITY ANALYSIS

Normal moveout is the basis for determining velocities from seismic data. Computed velocities can in turn be
FIG. 3.1-16. The equation for moveout velocity is derived by assuming a small-spread hyperbola (equtation 3-14). On the other hand, stacking velocity is derived from the bestfit hyperbola over the entire spread length (equation 3-15). Here, (a) is the actual traveltime, (b) is best-fit hyperbola over the offset range O A O A OAO AOA, and (c) is small-spread hyperbola. (Adapted from Hubral and Krey, 1980.)
used to correct for NMO so that reflections are aligned in the traces of a CMP gather before stacking. From equation (3-15), we can develop a practical way to determine stacking velocity from a CMP gather. Equation (3-14) describes a line on the t 2 x 2 t 2 x 2 t^(2)-x^(2)t^{2}-x^{2}t2x2 plane. The slope of the line is ( 1 / v N M O 2 ) 1 / v N M O 2 (1//v_(NMO)^(2))\left(1 / v_{N M O}^{2}\right)(1/vNMO2) and the intercept value at x = 0 x = 0 x=0x=0x=0 is t 0 t 0 t_(0)t_{0}t0. The synthetic gather in Figure 3.2-1 was derived from the velocity model in Figure 3.1-8. The far right frame of Figure 3.2-1 shows the picked traveltimes of four events at a number of offsets plotted on the t 2 x 2 t 2 x 2 t^(2)-x^(2)t^{2}-x^{2}t2x2 plane. To find the stacking velocity for a given event, the points corresponding to that event have been connected by a straight line. The inverse of the slope of the line is the stacking velocity. (In practice, least-squares fitting can be used to define the line slopes.) A comparison between the computed stacking velocitics and the actual rms velocities is made in Table 3-4.
The t 2 x 2 t 2 x 2 t^(2)-x^(2)t^{2}-x^{2}t2x2 velocity analysis is a reliable way to estimate stacking velocities. The accuracy of the method depends on the signal-to-noise ratio, which affects the quality of picking. In Figure 3.2-1, results are compared with the velocity spectrum (center frame) approach, which is discussed later in the section.
A real data example is shown in Figure 3.2-2. Velocities estimated from the t 2 x 2 t 2 x 2 t^(2)-x^(2)t^{2}-x^{2}t2x2 analysis are shown by triangles on the velocity spectrum. Note that
Table 3-4. Computed stacking and actual rms velocities for the synthetic model in Figure 3.2-1.
t t 0 , s t 0 , s t_(0),st_{0}, \mathrm{~s}t0, s
Computed Stacking
Vclocities, m / s m / s m//s\mathrm{m} / \mathrm{s}m/s
Computed Stacking Vclocities, m//s| Computed Stacking | | :---: | | Vclocities, $\mathrm{m} / \mathrm{s}$ |
Actual r m s r m s rms\mathrm{rms}rms
Velocities, m/s
Actual rms Velocities, m/s| Actual $\mathrm{rms}$ | | :---: | | Velocities, m/s |
0.4 2000 2000
0.8 2264 2264
1.2 2519 2533
1.6 2828 2806
t t_(0),s "Computed Stacking Vclocities, m//s" "Actual rms Velocities, m/s" 0.4 2000 2000 0.8 2264 2264 1.2 2519 2533 1.6 2828 2806| t $t_{0}, \mathrm{~s}$ | Computed Stacking <br> Vclocities, $\mathrm{m} / \mathrm{s}$ | Actual $\mathrm{rms}$ <br> Velocities, m/s | | :---: | :---: | :---: | | 0.4 | 2000 | 2000 | | 0.8 | 2264 | 2264 | | 1.2 | 2519 | 2533 | | 1.6 | 2828 | 2806 |
agrement between the t 2 x 2 t 2 x 2 t^(2)-x^(2)t^{2}-x^{2}t2x2 approach and the picks from the velocity spectrum are satisfactory.
Claerbout (1978) proposed a way to determine interval velocities manually from CMP gathers. The basic idea is illustrated in Figure 3.2-3. First, measure the slope along a slanted path that is tangential to both the top and bottom reflections of the interval of interest (slope 1). Then, connect the two tangential points and measure the slope of this line (slope 2). The interval velocity then is equal to the square root of the product of the two slope values. The accuracy of this method primarily depends on the signal-to-noise ratio.
The method of constant velocity scans of a CMP gather is an alternative technique for velocity analysis. Figure 3.2 4 3.2 4 3.2-43.2-43.24 b shows a CMP gather which has been NMO corrected repeatedly using a range of constant velocities between 1500 and 4500 m / s 4500 m / s 4500m//s4500 \mathrm{~m} / \mathrm{s}4500 m/s. Scan the constant-velocity moveout-corrected gathers displayed to the right of the original gather (b) starting from the low-velocity end and identify flat events. A velocity function can be composed by noting the velocity-time pairs that correspond to the flat events (Table 3-5). By using this velocity function, the CMP gather (Figure 3.2-4b) is moveout corrected for stacking (Figure 3.24a).
Accuracy in velocity picking depends on cable length, the two-way zero-offset time associated with the reflection event, and the velocity itsolf. The higher the velocity, the deeper the reflector and the shorter the cable length, the poorer the velocity resolution. The resolution in velocity picking also depends on the signal bandwidth; the more compact the wavelet is along the reflection traveltime trajectory in the CMP gather, the more accurate is the velocity pick. Prestack deconvolution (Section 2.5) prior to velocity analysis aimed at wavelet compression helps to improve velucity resolution.
Whle Figure 3.2-4 exhibits primary reflection events before 3 s, Figure 3.2-5 exhibits primary reflections bclow 3 s 3 s 3s3 \mathrm{~s}3 s. Follow the NMO for event A A AAA. Note
FIG. 3,2-1. The t 2 x 2 t 2 x 2 t^(2)-x^(2)t^{2}-x^{2}t2x2 velocity analysis applied to the synthetic gather derived from the velocity function depicted in Figure 3.1-8. The center panel is the velocity spectrum based on equation (3-19b).
that this event is overcorrected at low velocities and undercorrected at high velocities. The evert is flat on the NMO-corrected gather that corresponds to the 2500 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s volocity; thus, this is the optimun st acking velocity for event A A AAA. Event B B BBB is flat on the NMO-corrected gather that corresponds to the 2800 m / s 2800 m / s 2800m//s2800 \mathrm{~m} / \mathrm{s}2800 m/s velocity. N e v N e v Nev-\mathrm{Nev}-Nev ertheless, there is a range of velocities around 2800 m / s 2800 m / s 2800m//s2800 \mathrm{~m} / \mathrm{s}2800 m/s which exhibits nearly flat character for event B B BBB. This results in an uncertainty in making an accurate velocity pick.
The most important reason to obtain a reliable velocity function is to get the best quality stack of signal. Therefore, stacking velocities often are estimated from data stacked with a range of constant velocities on the basis of stacked event amplitude and continuity. Figure 3.2-6 illustrates this approach. Herc, a portion of a line containing 100 C M P 100 C M P 100CMP100 \mathrm{CMP}100CMP gathers has been NMO-corrected and stacked with a range of constant velocities. The resulting constant-velocity CMP stacks then were dis- played as a panel. Stacking velocities are picked directly from the constant-velocity st ack (CVS) panel by choosing the velocity that yields the best stack response at a selected event time.
The pand of constant-velocity stacks in Figure 3.27 demonstrates how velocity resolution decreases with increasing depth. The doep event at 3.6 s 3.6 s 3.6s3.6 \mathrm{~s}3.6 s seems to stack at a wide range of velocity values.
A variation of CVS analysis is a panel of CMP stacks using a family of velocity functions that are a fixed percentage higher and lower than a base velocity function (Figure 3.2-8). This type of velocity analysis pand usually is used in combination with a velucity spectrum computed at the central CMP location to pick an optimum stacking velocity function.
The constant velocities used in the CVS method described above should be chosen carefully. There are two issues to consider besides the expected range of actual velocities in the subsurface: (a) the range of ve-
FIG. 3.2-2. The t 2 x 2 t 2 x 2 t^(2)-x^(2)t^{2}-x^{2}t2x2 velocity analysis applied to & CMP gather. The triangles on the velocity spectrum (center panel based on equation 3-19b) represent velocity values derived from the slopes of the lines shown on the graph at the right.
Table 3-5. Velocity function derived from the constantvelocity panel of Figure 3.2-4.
Two-way Zero-Ofset RMS Velocity
time, m s m s ms\mathrm{ms}ms Picked, m / s m / s m//s\mathrm{m} / \mathrm{s}m/s
Two-way Zero-Ofset RMS Velocity time, ms Picked, m//s| Two-way Zero-Ofset | RMS Velocity | | :---: | :---: | | time, $\mathrm{ms}$ | Picked, $\mathrm{m} / \mathrm{s}$ |
0 1500
100 1500
760 1900
1400 2700
1800 3000
2150 3600
5000 4000
0 1500 100 1500 760 1900 1400 2700 1800 3000 2150 3600 5000 4000| 0 | 1500 | | ---: | ---: | | 100 | 1500 | | 760 | 1900 | | 1400 | 2700 | | 1800 | 3000 | | 2150 | 3600 | | 5000 | 4000 |
locities needed to stack the data and (b) the spacing between trial stacking velocities. In choosing a range, consideration should be given to the fact that dipping events and useful out-of-plane reflections may have anomalously high stacking velocities. In choosing the spacing of constant velocities, keep in mind that it is moveout, not velocity, that is the basis for velocity estimation. Thus, it is better to scan in increments of equal Δ t N M O Δ t N M O Deltat_(NMO)\Delta t_{N M O}ΔtNMO than equal v N M O v N M O v_(NMO)v_{N M O}vNMO. This prevents oversampling of the high-velocity events and undersampling of the low-volocity events. A good way to choose Δ ( Δ t N M O ) Δ Δ t N M O Delta(Deltat_(NMO))\Delta\left(\Delta t_{N M O}\right)Δ(ΔtNMO) is to pick it so that the moveout difference between adjacent trial velocities at the maxinum offset to be stacked
FIG. 3.2-3. The interval velocity between two reflectors is equal to the square-root of the products of the slope values measured as shown above. This is the same gather as in Figure 3.1-7a. Trace spacing is 50 m 50 m 50m50 \mathrm{~m}50 m, slope 1 = 3150 / 043 1 = 3150 / 043 1=3150//0431=3150 / 0431=3150/043, slope 2 = 550 / 0.44 2 = 550 / 0.44 2=550//0.442=550 / 0.442=550/0.44, and thus, the interval velocity between 08 and 1.2 s 1.2 s 1.2s1.2 \mathrm{~s}1.2 s is 3026 m / s 3026 m / s 3026m//s3026 \mathrm{~m} / \mathrm{s}3026 m/s.
is approximately 1 / 3 1 / 3 1//31 / 31/3 of the dominant period of the data (S. Doberty, 1986, personal communication). Shallow data have short maximum offsets because of muting, while deep data have large dominant periods. Thus, the number of trial stacking velocities needed to adequately sample the data can be reduced considerably.
The CVS method is especially useful in areas with complex structure (Exercise 3-5). In such areas, this method allows the interpreter to directly choose the stack with the best possible event continuity. (Often the stacking velocities themselves are of minimal importance.) Constant-velocity stacks often contain many CMP traces and sometimes consist of an entire line.
The velocity spectrum method is described in the next section. Unlike the CVS method, it is based on the crosscorrelation of the traces in a CMP gather and not on lateral continuity of the stacked events. Because of this, when compared to the CVS method, it is more suitable for data heavily contaminated with multiple reflections and somewhat less suitable for data associated with complex structures.

The Velocity Spectrum

The input CMP gather in Figure 3.2-9a contains a single reflection hyperbola from a flat interface. The medium velocity above the reflector is 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s. Suppose that this gather is NMO-corrected and stacked, repeatedly, using a range of constant velocities from 2000 to 4300 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s. Figure 3.2 9 b 3.2 9 b 3.2-9b3.2-9 \mathrm{~b}3.29 b displays the resultant stack traces for each velocity side by side on a plane of velocity versus two-way zero-offset time. This is called the velocity spectrum (Taner and Koehler, 1969). We have transformed the data from the offset versus two-way time domain (Figure 3.2-9a) to the stacking velocity versus two-way zero-offset time domain (Figure 3.2-9b)
The highest stacked amplitude occurs with a velocity of 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s. This is the velocity that should be used to stack the event in the input CMP gather. The lowamplitude horizontal streak on the velocity spectrum results from the contribution of small offsets, while the large-emplitude region on the spectrum is due to the contribution of the full range of offsets (Sherwood and Poe, 1972). Hence, we need Iong offsets for good resolution on the velocity spectrum. A way to minimize the streak effect of finite-cable length on the velocityspectrum is to transform the CMP gather from offset to velocity domain by way of discrete Radon transform (Section 6.4).
A CMP gather associated with a layered earth model is shown in Figure 3.2-10a. Based on the stacked amplitudes, the following picks for stacking velocity function are made from the velocity spectrum (Figure 3.2 10 b ) ; 2700 , 2800 3.2 10 b ) ; 2700 , 2800 3.2-10b);2700,28003.2-10 \mathrm{~b}) ; 2700,28003.210 b);2700,2800, and 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s. These picks correspond to the shallow, middle, and deep events, respectively. The velocity spectrum not only can provide the stacking velocity function, but it also allows one to distinguish between primary and multiple reflections.
The quantity displayed on the velocity spectra in Figures 3.2 9 b 3.2 9 b 3.2-9b3.2-9 \mathrm{~b}3.29 b and 3.2 10 b 3.2 10 b 3.2-10b3.2-10 \mathrm{~b}3.210 b is the stacked amplitude.

FIG. 3.2-5. Constant-velocity moveout corrections applied to a CMP gather using a velocity range of 1500 4200 m / s 1500 4200 m / s 1500-4200m//s1500-4200 \mathrm{~m} / \mathrm{s}15004200 m/s with an increment of 100 m / s 100 m / s 100m//s100 \mathrm{~m} / \mathrm{s}100 m/s. Events A A AAA and B B BBB are discussed in the text.
When the signal-to-noise ratio of the input data is poor, then the stacked amplitude may not be the best display quantity. The aim in velocity analysis is to obtain picks that correspond to the best coherency of the signal along a hyperbolic trajectory over the entire spread length of the CMP gather. Neidell and Taner (1971) described various types of coherency measures that can be used as attributes in computing velocity spectra,

Measure of Coherency

Consider the CMP gather with a single reflection sketched in Figure 3.2-11. Stacked amplitude S S SSS at two- way zero-olfiset time t 0 t 0 t_(0)t_{0}t0 is defined as
S = i = 1 M f i , t ( i ) S = i = 1 M f i , t ( i ) S=sum_(i=1)^(M)f_(i,t(i))S=\sum_{i=1}^{M} f_{i, t(i)}S=i=1Mfi,t(i)
where f i , t ( i ) f i , t ( i ) f_(i,t(i))f_{i, t(i)}fi,t(i) is the amplitude value on the i i iii th trace at two-way time t ( i ) t ( i ) t(i)t(i)t(i), and M M MMM is the number of traces in the CMP gather. Two-way time t ( i ) t ( i ) t(i)t(i)t(i) lies along the stacking hyperbola associated with a trial velocity v s t k v s t k v_(stk)v_{s t k}vstk :
t ( i ) = t 0 2 + x i 2 v s t k 2 t ( i ) = t 0 2 + x i 2 v s t k 2 t(i)=sqrt(t_(0)^(2)+(x_(i)^(2))/(v_(stk)^(2)))t(i)=\sqrt{t_{0}^{2}+\frac{x_{i}^{2}}{v_{s t k}^{2}}}t(i)=t02+xi2vstk2
Normalized stacked amplitude is defined as
N S = i 1 M f i , t ( i ) i = 1 M | f i , t ( i ) | N S = i 1 M f i , t ( i ) i = 1 M f i , t ( i ) NS=(sum_(i-1)^(M)f_(i,t(i)))/(sum_(i=1)^(M)|f_(i,t(i))|)N S=\frac{\sum_{i-1}^{M} f_{i, t(i)}}{\sum_{i=1}^{M}\left|f_{i, t(i)}\right|}NS=i1Mfi,t(i)i=1M|fi,t(i)|


FIG. 3.2-7. Constant-velocity stacks of 24 CMP gathers using a range of velocities 1500 4400 m / s 1500 4400 m / s 1500-4400m//s1500-4400 \mathrm{~m} / \mathrm{s}15004400 m/s with an increment of 100 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s.
where the range of N S N S NSN SNS is 0 N S 1 0 N S 1 0 <= NS <= 10 \leq N S \leq 10NS1. As for the stacked amplitude given by equation (3-16), the normalized stacked amplitude given by equation (3-18) is defined at two-way zero-offiset time.
Another quantity that is used in velocity spectrum calculations is the unnormalized crosscorrelation sum within a time gate T T TTT that follows the path corresponding to the trial stacking hyperbols across the CMP gather. The expression for the unnormalized crosscorrelation sum is given by
C C = 1 2 t { [ i = 1 M f i , t ( i ) ] 2 i = 1 M f i , t ( i ) 2 } , ( 3 19 a ) C C = 1 2 t i = 1 M f i , t ( i ) 2 i = 1 M f i , t ( i ) 2 , ( 3 19 a ) CC=(1)/(2)sum_(t){[sum_(i=1)^(M)f_(i,t(i))]^(2)-sum_(i=1)^(M)f_(i,t(i))^(2)},quad(3-19 a)C C=\frac{1}{2} \sum_{t}\left\{\left[\sum_{i=1}^{M} f_{i, t(i)}\right]^{2}-\sum_{i=1}^{M} f_{i, t(i)}^{2}\right\}, \quad(3-19 a)CC=12t{[i=1Mfi,t(i)]2i=1Mfi,t(i)2},(319a)
or, by way of equation (3-16),
C C = 1 2 t [ S t 2 i = 1 M f i , t ( 0 ) 2 ] , ( 3 19 b ) C C = 1 2 t S t 2 i = 1 M f i , t ( 0 ) 2 , ( 3 19 b ) CC=(1)/(2)sum_(t)[S_(t)^(2)-sum_(i=1)^(M)f_(i,t(0))^(2)],quad(3-19 b)C C=\frac{1}{2} \sum_{t}\left[S_{t}^{2}-\sum_{i=1}^{M} f_{i, t(0)}^{2}\right], \quad(3-19 b)CC=12t[St2i=1Mfi,t(0)2],(319b)
where C C C C CCC CCC can be interpreted as half the difference between the output energy of the stack and the input energy. The outer summation is over the two-way zerooffset time samples t t ttt within the correlation gate T T TTT.
A normalized form of C C C C CCC CCC is another attribute that often is used in velocity spectrum calculations and is given by
N C = M F t k = 1 M 1 i = 1 M k f i , t ( i ) f i + k , t ( i + k ) t f i , t ( i ) 2 t f i + k , t ( i + k ) 2 , N C = M F t k = 1 M 1 i = 1 M k f i , t ( i ) f i + k , t ( i + k ) t f i , t ( i ) 2 t f i + k , t ( i + k ) 2 , NC=MFsum_(t)sum_(k=1)^(M-1)sum_(i=1)^(M-k)(f_(i,t(i))f_(i+k,t(i+k)))/(sqrt(sum_(t)f_(i,t(i))^(2)sum_(t)f_(i+k,t(i+k))^(2))),N C=M F \sum_{t} \sum_{k=1}^{M-1} \sum_{i=1}^{M-k} \frac{f_{i, t(i)} f_{i+k, t(i+k)}}{\sqrt{\sum_{t} f_{i, t(i)}^{2} \sum_{t} f_{i+k, t(i+k)}^{2}}},NC=MFtk=1M1i=1Mkfi,t(i)fi+k,t(i+k)tfi,t(i)2tfi+k,t(i+k)2,
where M F = 2 / [ M ( M 1 ) ] M F = 2 / [ M ( M 1 ) ] MF=2//[M(M-1)]M F=2 /[M(M-1)]MF=2/[M(M1)].
Another coherency messure used in computing velocity spectrum is the energy-normalized crosscorrelation sum
FIG. 3.2-8. Stacks of 100 C M P 100 C M P 100CMP100 \mathrm{CMP}100CMP gathers using seven velocity functions which are a percent apart from a central function.
FIG. 3.2-9. Transformation of a synthetic CMP gather containing a single reflection event from offset to velocity domain. Each trace in the velocity-stack gather (b) is a stack of the traces in the CMP gather (a) using a constant-velocity NMO correction.
FIG. 3.2-10. Transformation of a synthetic CMP gather containing three reflection events from offset to velocity domain. Each trace in the velocity-stack gather (b) is a stack of the traces in the CMP gather (a) using a constant-velocity NMO correction.
FIG. 3.2-11. Stacked amplitude along a hyperbolic trajectory. Amplitudes f 2 , t ( 1 ) f 2 , t ( 1 ) f_(2,t(1))f_{2, t(1)}f2,t(1) along the best-fit hyperbola (equation 3-17) defined by optimum stacking velocity v s i k v s i k v_(sik)v_{s i k}vsik are summed to get the stacked amplitude S S SSS (equation 3-16).
E C = 2 ( M 1 ) C C t t = 1 M f ı , t ( 2 ) 2 E C = 2 ( M 1 ) C C t t = 1 M f ı , t ( 2 ) 2 EC=(2)/((M-1))(CC)/(sum_(t)sum_(t=1)^(M)f_(ı,t(2))^(2))E C=\frac{2}{(M-1)} \frac{C C}{\sum_{t} \sum_{t=1}^{M} f_{\imath, t(2)}^{2}}EC=2(M1)CCtt=1Mfı,t(2)2
The range of E C E C ECE CEC is [ 1 / ( M 1 ) ] < E C 1 [ 1 / ( M 1 ) ] < E C 1 [-1//(M-1)] < EC <= 1[-1 /(M-1)]<E C \leq 1[1/(M1)]<EC1.
Finally, semblance, which is the normalized outputto-input energy ratio, is given by
N E = 1 M t t = 1 M f t , t ( t ) t t = 1 M f t , t ( t ) 2 N E = 1 M t t = 1 M f t , t ( t ) t t = 1 M f t , t ( t ) 2 NE=(1)/(M)(sum_(t)sum_(t=1)^(M)f_(t,t(t)))/(sum_(t)sum_(t=1)^(M)f_(t,t(t))^(2))N E=\frac{1}{M} \frac{\sum_{t} \sum_{t=1}^{M} f_{t, t(t)}}{\sum_{t} \sum_{t=1}^{M} f_{t, t(t)}^{2}}NE=1Mtt=1Mft,t(t)tt=1Mft,t(t)2
The following expression shows the relation of N E N E NEN ENE to EC:
E C = 1 M 1 ( M × N E 1 ) E C = 1 M 1 ( M × N E 1 ) EC=(1)/(M-1)(M xx NE-1)E C=\frac{1}{M-1}(M \times N E-1)EC=1M1(M×NE1)
The range of N E N E NEN ENE is 0 N E 1 0 N E 1 0 <= NE <= 10 \leq N E \leq 10NE1.
Table 3-6 shows the values of the attributes defined by equation (3-16) and equations (3-18) through (3-22) for the special case of a two-fold CMP gather where the second trace is a scaled version of the first as follows:
f 1 , t = f t , ( 3 23 a ) f 2 , t = a f t . ( 3 23 b ) f 1 , t = f t , ( 3 23 a ) f 2 , t = a f t . ( 3 23 b ) {:[f_(1,t)=f_(t)",",(3-23 a)],[f_(2,t)=af_(t).,(3-23 b)]:}\begin{array}{ll} f_{1, t}=f_{t}, & (3-23 a) \\ f_{2, t}=a f_{t} . & (3-23 b) \end{array}f1,t=ft,(323a)f2,t=aft.(323b)
Table 3-6. Various measures of coherency as applied to the two-fold case given by equation (3-23).
Attribute a = 0.5 a = 0.5 a=0.5a=0.5a=0.5 a = 0.5 a = 0.5 a=-0.5a=-0.5a=0.5
Stacked Amplitude
S S SSS (equation 3-16)
Stacked Amplitude S (equation 3-16)| Stacked Amplitude | | :--- | | $S$ (equation 3-16) |
1.5 f ( t ) 1.5 f ( t ) 1.5 f(t)1.5 f(t)1.5f(t) 0.5 f ( t ) 0.5 f ( t ) 0.5 f(t)0.5 f(t)0.5f(t)
Normalized
Stacked Amplitude
NS (equation 3-18)
Normalized Stacked Amplitude NS (equation 3-18)| Normalized | | :--- | | Stacked Amplitude | | NS (equation 3-18) |
1 0.333
Unnormalized
Crosscorrelation Sum
C C C C CCC CCC (equation 3-19b)
Unnormalized Crosscorrelation Sum CC (equation 3-19b)| Unnormalized | | :--- | | Crosscorrelation Sum | | $C C$ (equation 3-19b) |
0.5 t f 2 ( t ) 0.5 t f 2 ( t ) 0.5sum_(t)f^(2)(t)0.5 \sum_{t} f^{2}(t)0.5tf2(t) 0.5 t f 2 ( t ) 0.5 t f 2 ( t ) -0.5sum_(t)f^(2)(t)-0.5 \sum_{t} f^{2}(t)0.5tf2(t)
Normalized
Crosscorrelation Sum
N C N C NCN CNC (equation 3 20 3 20 3-203-20320 )
Normalized Crosscorrelation Sum NC (equation 3-20 )| Normalized | | :--- | | Crosscorrelation Sum | | $N C$ (equation $3-20$ ) |
1 1
Energy-Normalized
Crosscorrelation Sum
E C E C ECE CEC (equation 3-21)
Energy-Normalized Crosscorrelation Sum EC (equation 3-21)| Energy-Normalized | | :--- | | Crosscorrelation Sum | | $E C$ (equation 3-21) |
0.8 -0.8
Semblance
N E N E NEN ENE (equation 3-22a)
Semblance NE (equation 3-22a)| Semblance | | :--- | | $N E$ (equation 3-22a) |
0.9 0.1
Attribute a=0.5 a=-0.5 "Stacked Amplitude S (equation 3-16)" 1.5 f(t) 0.5 f(t) "Normalized Stacked Amplitude NS (equation 3-18)" 1 0.333 "Unnormalized Crosscorrelation Sum CC (equation 3-19b)" 0.5sum_(t)f^(2)(t) -0.5sum_(t)f^(2)(t) "Normalized Crosscorrelation Sum NC (equation 3-20 )" 1 1 "Energy-Normalized Crosscorrelation Sum EC (equation 3-21)" 0.8 -0.8 "Semblance NE (equation 3-22a)" 0.9 0.1| Attribute | $a=0.5$ | $a=-0.5$ | | :---: | :---: | :---: | | Stacked Amplitude <br> $S$ (equation 3-16) | $1.5 f(t)$ | $0.5 f(t)$ | | Normalized <br> Stacked Amplitude <br> NS (equation 3-18) | 1 | 0.333 | | Unnormalized <br> Crosscorrelation Sum <br> $C C$ (equation 3-19b) | $0.5 \sum_{t} f^{2}(t)$ | $-0.5 \sum_{t} f^{2}(t)$ | | Normalized <br> Crosscorrelation Sum <br> $N C$ (equation $3-20$ ) | 1 | 1 | | Energy-Normalized <br> Crosscorrelation Sum <br> $E C$ (equation 3-21) | 0.8 | -0.8 | | Semblance <br> $N E$ (equation 3-22a) | 0.9 | 0.1 |
Several conclusions can be made from the results shown in Table 3-6. Note that stacked amplitude is sensitive to trace polarity. The unnormalized crosscorrelation offers a better standout of the strong reflections on the velocity spectrum, while the normalized or energynormalized crosscorrelation brings out weak reflections on the velocity spectrum. As equation (3-22b) implies, semblance is a bissed version of the energy-normalized crosscorrelation sum.
The velocity spectrum normally is not displayed as shown in Figures 3.2-9b or 3.2-10b. Instead, two popular types of displays are used to pick velocities in the form of a gated row plot or a contour plot as shown in Figure 3.2-12. Another quantity that helps picking is the maxima of the coherency values from each time gate displayed as a function of time next to the velocity spectrum, as shown in Figure 3,2-12. Unless otherwise indicated, the unnormalized correlation was used to construct the velocity spectrum of the synthetic CMP gather (Figure 3.2-12a) that is used in subsequent discussions.

Factors Affecting Velocity Estimates

Velocity estimation from seismic data is limited in accuracy and resolution for the following reasons: (a) Spread length,
(b) Stacking fold,
(c) signal-to-noise ratio,
(d) Muting,
(e) Time gate length,
(f) Velocity sampling,
(g) Choice of coherency measure,
(h) True departures from hyperbolic moveout, and
(i) Bandwidth of data.
Figure 3.2-13 shows a synthetic CMP gather with velocity spectra generated by using gradually decreasing spread lengths. Lack of large-offset information means lack of the significant moveout required for velocity discrimination. Note the loss in sharpness of the peaks in the velocity spectra computed from the smallspread portion of the CMP gather. Resolution decreases first in the deeper part of the spectrum where there is little moveout (Table 3-1).
Figure 3.2-14 shows velocity spectra computed from a real data set using spread lengths as indicated. The broadened peaks caused by the use of smaller spreads indicate loss of resolution in the velocity spectrum. This problem may be compounded by the poor signal-to-noise ratio or residusl static shifts. An example of residual statics effect is shown in Figure 3.2-15. Velocity spectrum computed from a spread length that includes small offets (center panel) infers an incorrect velocity function. As the spread length is made smaller (right panel), the velocity trend becomes indistinct.
What if only the far offsets are included when computing the velocity spectrum? Although far-offset data are needed to better resolve the velocity picks, there is a stretching problem in the far-offset region. Therefore, a velocity spectrum computed on the basis of only the faroffset region of a CMP gather suffers from the effects of muting at shallow times. This problem is demonstrated in Figure 3.2-16, where the spread is increasingly confined to the far-offset region of the input CMP gather. Note the loss of coherency peaks from the shallow events because of muting, and the further degradation of the coherency peaks corresponding to deeper events. Thus, adequate resolution in the velocity spectrum can only be obtaned with a sufficrently large spread that spans both near and far offsets. This is analogous to the lesson learned in Section 1.1 on temporal resolution, which requires both low and high frequencies.
Stacking fold plays a significant part in the degree of resolution achieved from velocity spectra. In contemporary seismic data acquisition, it is common to record data with 240 or more channels. For computational savings, high-fold data sometimes are reduced to a low-fold equivalent gather by partial stacking. The idea is to
(a)
(b)
(c)
FIG. 3.2-12. (a) A CMP gather, and two ways of displaying velocity spectrum computed from this gather: (b) gated raw plot, and (c) contour plot.
FIG. 3.2-13. Effect of spread length on velocity resolution. Lack of long offets causes loss of resolution, especially at later times.
FIG. 3.2-14. Missing large-offset traces cause loss of resolution in the velocity spectra, especially at later times.
FIG. 3.2-15. Velocity spectra can be distorted severely, particularly in areas with statics problems. When coupled with a lack of long-offset traces, the velocity function that is derived can be misleading (center and right).
FIG, 3.2-16. Lack of short-offset traces can degrade the velocity spectrum. Note the loss of information at shallow times and poor picks at later times.
FIG, 3.2-17. Partial stacking can reduce computational cost. However, do not use partial stacking if it could degrade the velocity spectrum, (In this example, 8-fold partial stacking is too much.)
FIG, 3.2-18. The synthetic CMP gather derived from the velocity function depicted in Figure 31 8 31 8 31-831-8318 and the same gather with nose added at various strengths. The numbers on top represent the ratio of peak signal amplitude to peak noise amplitude.
stack a number of traces in a CMP gather from adjacent offsets to produce a CMP gather with lower fold. For example, a reduction of fold from 64 to 16 amounts to producing one output trace for each set of four adjacent input traces. Partial stacking involves differential NMO application to each group of adjacent traces using a reasonable, previously estimated velocity function so that primaries are aligned before stacking. The CMP gather in Figure 3.2-17 was partially stacked down to 32-, 16and 8-fold gathers. Corresponding velocity spectra also are shown in Figure 3.2-17. No harm was done by reducing the fold to 32 . Even the 16 -fold data seem to produce accurate picks. However, use of lower fold significantly shifts the peaks in the spectrum. Reducing the fold by partial stacking merely to save computation must not be done at the expense of accuracy.
Noise in seismic data has a direct effect on the quality of a velocity spectrum. Add band-limited random noise to the CMP gather at increasingly higher levels of amplitude (Figure 3.2-18). The corresponding velocity spectra are shown in gated row piot form in Figure 3.2-19 and, for comparison, in contour form in Figure 3.2-20. The velocity spectrum distinguishes signal along hyperbolic paths even with high levels of random noise. (Refer to the velocity spectrum for SNR = 3 = 3 =3=3=3 in Figure 3.2-19.) This is because of the power of crosscorreletion in measuring coherency. The accuracy of the velocity spectrum is limited when the signal-to-noise ratio is poor. Refer to SNR = 1 in Figures 3.2-19 or 3.2-20. The event at 0.8 s 0.8 s 0.8s0.8 \mathrm{~s}0.8 s still can be picked, but the others are difficult to distinguish.
3
1
FIG. 3.2-19. Velocity spectra derived from the CMP gathers in Figure 32-18 The display mode is gated row.
Peak SNR
3
1
FIG. 3.2-20. Velocity spectra derived from the CMP gathers in Figure 3.2-18. The display mode is contour. See Figure 3.2-19 for the gated row plots of the same spectra for comparison.
(a)
(b)
(c)
FIG. 3.2-21. Muting effect on correlation values: (a) CMP gather, (b) mute compensated, (c) no compensation.
As a result of moveout correction, the waveform along a reflection hyperbola is stretched (Section 3.1). Stretching is more severe in the shallow part of the moveout-corrected gather, especially at large offsets. The stretched zone must be muted to prevent degradation of the stacked amplitudes associated with shallow events. However, muting reduces fold in the stacking process for shallow data (Figure 3.1-11c). It also has an adverse effect on the velocity spectrum, for it canses weakening of the peak amplitude that falls within the mute zone, as demonstrated in Figure 3.2-21. These peaks must be corrected for the weakening effect of the muting process. This is done by multiplying stacked amplitudes by a scale factor equal to the ratio of the actual multiplicity to the number of live traces in the mute zone.
The velocity spectrum is computed along hyperbolic search paths for a range of constant velocity values, or constant Δ t N M O Δ t N M O Deltat_(NMO)\Delta t_{N M O}ΔtNMO (equation 3-2a). The hyperbolic path spans a two-way time gate specified at zerooffset. Figure 3.2-22 shows velocity spectra computed with four different gate lengths. If the gate length chosen is too coarse, the spectrum suffers especially from lack of temporal resolution. This becomes more evident on the same spectra displayed in contour form in Figure 3.2-23. In practice, the gate length is chosen between one-half and one times the dominant period of the signal, typically 20 to 40 m s 40 m s 40ms40 \mathrm{~ms}40 ms. Since the dominant period can be time-variant (small in early and large in late times), the gate length can be specified accordingly.
The velocity range used in the analysis must be chosen carefully; it should span the velocities that correspond to those of primary reflections present in the
FIG. 3.2-22. Too large a correlation gate length can lower resolution.
FIG. 3.2-23. The same velocity spectra as in Figure 3.2-22 displayed using the contour display mode for comparison.
FIG. 3.2-24. The CMP gathers associated with six neighboring midpoint locations. The reflectors have a gentle downdip from left to right.
(a)
(b)
(c)
FIG. 3.2-25. (a) Velocity spectrum derived from a single CMP gather (CMP 1) in Figure 3.2-24, (b) from the sum of six CMP gathers in Figure 3.2-24, and (c) from the sum of six individual velocity spectra.
Table 3-7. Acceptable velocity errors (after Schnejder, 1971).
Use of Velocity
% Error % Error
for rms for Interval
% Error % Error for rms for Interval| % Error % Error | | :---: | | for rms for Interval |
NMO corrections for
conventional stack
NMO corrections for conventional stack| NMO corrections for | | :---: | | conventional stack |
2 10 2 10 2-102-10210 -
Structural anomaly detection:
30 m 30 m 30-m30-\mathrm{m}30m anomaly at 3000 m 3000 m 3000-m3000-\mathrm{m}3000m depth
Structural anomaly detection: 30-m anomaly at 3000-m depth| Structural anomaly detection: | | :---: | | $30-\mathrm{m}$ anomaly at $3000-\mathrm{m}$ depth |
0.5 -
Gross lithologic identification:
300-m interval at 3000 m 3000 m 3000-m3000-\mathrm{m}3000m depth
Gross lithologic identification: 300-m interval at 3000-m depth| Gross lithologic identification: | | :---: | :---: | | 300-m interval at $3000-\mathrm{m}$ depth |
0.7 10
Stratigraphic detailing:
150-m interval at 3000 m 3000 m 3000-m3000-\mathrm{m}3000m depth
Stratigraphic detailing: 150-m interval at 3000-m depth| Stratigraphic detailing: | | :---: | | 150-m interval at $3000-\mathrm{m}$ depth |
0.1 3
Use of Velocity "% Error % Error for rms for Interval" "NMO corrections for conventional stack" 2-10 - "Structural anomaly detection: 30-m anomaly at 3000-m depth" 0.5 - "Gross lithologic identification: 300-m interval at 3000-m depth" 0.7 10 "Stratigraphic detailing: 150-m interval at 3000-m depth" 0.1 3| Use of Velocity | % Error % Error <br> for rms for Interval | | | :--- | :---: | :---: | | NMO corrections for <br> conventional stack | $2-10$ | - | | Structural anomaly detection: <br> $30-\mathrm{m}$ anomaly at $3000-\mathrm{m}$ depth | 0.5 | - | | Gross lithologic identification: <br> 300-m interval at $3000-\mathrm{m}$ depth | 0.7 | 10 | | Stratigraphic detailing: <br> 150-m interval at $3000-\mathrm{m}$ depth | 0.1 | 3 |
CMP gather. The velocity increment must not be too coarse, for it can degrade the resolution, ospecially for high-velocity events.
Several options are considered in constructing the velocity spectrum. Partial stacking is one option that already was discussed. Band-pass filtering and automatic gain control (AGC) sometimes can improve the crosscorrelation process, especially when the input gather has poor signal-to-noise ratio.
Another way to improve the quality of a velocity spectrum is to use several neighboring CMP gathers in the analysis. Figure 3.2-24 shows six neighboring CMP gathers. By using the first CMP gather in the group, we get the velocity spectrum in Figure 3.2-25a. There are two ways to analyze these gathers as a group. One way is to sum the gathers and compute the velocity spectrum from the sum. This is shown in Figure 3.2-25b. Another way is to compute the velocity spectra from each individual gather and sum the spectra as shown in Figure 3.2-25c. Clearly, the former is more cost-effective than the latter. In practice, the number of CMP gathers that may be used must be chosen so that there is negligible dip across the gathers under consideration. If the structural dip is significant, then the number of CMP gathers included in the velocity analysis must be kept small. Note that the peak corresponding to the shallow event in Figure 3.2-25b is smaller than its counterpart in Figure 3.2 25 c 3.2 25 c 3.2-25c3.2-25 \mathrm{c}3.225c. Look closely at the CMP gathers in Figure 3.2-24 and note the slight difference in traveltimes from gather to gather, especially for the shallow event. Summing these gathers distorts the hyperbolic path and causes degradation in the velocity spectrum.
When the input gather has a significant noise level, some smoothing may be done on the velocity spectrum matrix by averaging over vclocity or time gates, or by some combination of the two. Another way to suppress small-amplitude correlation peaks that may be related to the ambient noise level in the data is to apply some percentage of bias to the correlation values. Biasing refers to subtracting a constant value from the correlation values over the entire velocity spectrum. Various combinations of averaging and biasing of correlation values also are used in practice. Finally, for computational efficiency, correlation values may be computed within a specified velocity corridor. The corridor must be chosen so that it spans the velocity variations vertically and laterally in the survey area.
Experience in a survey area helps when picking appropriate stacking velocities for primary reflections from velocity spectra. Acceptable velocity errors vary depending on use of the estimated velocities (Tablo 37).

Interactive Velocity Analysis

With the availability of powerful workstations, efficiency in seismic data analysis at large has increased enormously. Applications that involve numerically intensive computations and large input-output operations are performed using multiprocessor servers, and results are viewed and evaluated using highperformance graphics workstations. Interactive date analysis enables efficient parameter testing that is needed for many of the steps in a processing sequence, such as filtering, deconvolution, and gain. Additionally, interactive analysis provides efficiency in picking events - first breaks on shot records for refraction statics, reflection times on migrated sections, and velocity functions from velocity spectra.
Figure 3.2-26 shows a CMP gather and its velocity spectrum displayed in color. Note the distinct velocity trend with changes in vertical gradient at 600 , 1400 , and 2000 m s 2000 m s 2000ms2000 \mathrm{~ms}2000 ms. Color display of velocity spectra is used for interactive picking of semblance peaks, whereas the contour and gated row plots are used for the traditional paper display of velocity spectra. Figure 3.227 shows the sanne velocity spectrum as in Figure 3.226 with the velocity picks associated with primary reflections. The hyperbolic traveltime trajectories that correspond to the velocity picks are superimposed on the CMP gather to observe any discrepancy between the modeled and the actual traveltimes, and thus verify the accuracy of the velocity picks. Further verification of the picks can be made by applying moveout correction and cxamining the flatness of events on the
CMP gather as shown in Figure 3.2-27. The undercorrected event at about 800 m s 800 m s 800ms800 \mathrm{~ms}800 ms is the water-bottom multiple; this event is represented in the velocity spectrum by the isolated peak to the left of the velocity trend.
Figure 3.2-28 shows the same gather and velocity spectrum as in Figure 3.2-27 but with a velocity function erroneousiy picked along a bigh-velocity trend to cause undercorrection of the refections. Note the discrepancy between the modeled and actual traveltimes on the CMP gather before moveout correction, and the misalignment of the reflections after moveout correction. The case of overcorrection caused by erroneously low velocities is demonstrated in Figure 3.2-29.
A localized mispick along a velocity trend yields a physically implausable interval velocity value as illstrated in Figures 3.2-30 and 3.2-31. The strategy for picking velocities from velocity spectra is based on tracking the velocity trend that coincides with semblance peaks associated with the primary reflections. Whether these reflections are associated with key geological markers or not is irrelevant - as many picks as necessary should be picked so as to honor changes in vertical velocity gradients and thus obtain the best stack. However, picks at too close time intervals can yield anomalous interval velocities from Dix conversion (Section J.4); therefore, they should not be used for deriving interval velocities. (Chapter 9, in addition to Dix conversion, is devoted to several techniques for estimating interval velocities.)
To derive plausable interval velocities from the picked rms velocity functions, first intersect the time horizons picked from the time-migrated volume of data. with the velocity functions at analysis locations and extract horzon-consistent rms velocity functions. Then, perform spatial interpolation to derive horizon-consistent rms velocity profiles along line traverses or maps over the survey area. Next, perform Dix conversion of the horizon-consistent rms velocities to interval velocities v ent v ent  v_("ent ")v_{\text {ent }}vent  (Dix, 1955):
v n t = v n 2 t n v n 1 2 t n 1 ¯ t n t n 1 v n t = v n 2 t n v n 1 2 t n 1 ¯ t n t n 1 v_(nt)=sqrt((v_(n)^(2)t_(n)- bar(v_(n-1)^(2)t_(n-1)))/(t_(n)-t_(n-1)))v_{n t}=\sqrt{\frac{v_{n}^{2} t_{n}-\overline{v_{n-1}^{2} t_{n-1}}}{t_{n}-t_{n-1}}}vnt=vn2tnvn12tn1¯tntn1
where v n v n v_(n)v_{n}vn and v n 1 v n 1 v_(n-1)v_{n-1}vn1 are the rms velocities at the layer boundaries n n nnn and n 1 n 1 n-1n-1n1, respectively; and t n t n t_(n)t_{n}tn and t n 1 t n 1 t_(n-1)t_{n-1}tn1 are the horizon times at these layer boundaries. An alternative mothod for deriving horizon-consistent rms velocities is presented next.

Horizon Velocity Analysis

One way to estimate velocitios with the accuracy required for detailed structural or stratigraphic studies is to analyze the particular horizon of interest, continuously. Such a detailed velocity estimation is called horizon velocity analysis (HVA). Horizon velocity analysis is an efficient way to get velocity information at every CMP location along selected key horizons, as opposed to the conventional velocity analysis that provides veIocity information at every time gate at selected CMP locations. The underlying principle is the same as that of the velocity spectrum. The output coherency values derived from hyperbolic time gates are displayed as a function of velocity and CMP position. Correlation values are computed from a gate that includes the horizon of interest. Horizon times are digitized and input to the horizon velocity analysis. Figures 3.2-32 shows a stacked section and Figure 3.2-33 shows HVA semblance spectra over five horizons. Note the short-wavelength variations of stacking velocities along the line traverse such variations ordinarily are not captured by velocify analyses conducted at sparse CMP intervals. These semblance spectra can be picked to obtain horizonconsistent rms velocities which are then used to derive interval velocities (equation 3-24). Similar types of computational details, such as smoothing and biasing, are considered applicable to velocity spectrum.
Whenever there are structural discontinuities on a stacked section, HVA is carried out on segments of the horizon that are separated by faults. Horizon velocity analysis can improve a stacked section in areas with complex overburden structure that may cause nonhyperbolic moveout. This is somewhat surprising, since HVA still is based on hyperbolic moveout. Nevertheless, in practice, HVA provides the detailed lateral velocity variations along a marker horizon, which may be missed by conventional velocity analysis locations that are sparsely spaced along the line. Consider horizon A A A\boldsymbol{A}A in Figure 3.2-34, which is below the salt dome S S SSS. The salt dome behaves as a complex overburden, causing the raypaths that are associated with the underlying reflectors to bend. Note the rapid lateral changes in velocity and the improvement in the CMP stack after using the HVA picks. The rapid change in stacking velocity associated with the base of the salt is typical. Starting on the left, the reflector is deep in time and flat. Then it dips; hence, the higher stacking velocity. Then it gets shallower; hence, the lower stacking velocity. Then it dips again, yielding a higher stacking velocity. Finally, it becomes flat; hence, a decrease in velocity.
A velocity section derived from HVA is structureconsistent, whereas a velocity section derived from vertical velocity functions picked at selected analysis locations along a line traverse is, in general, structureindependent. Consider the stacked section in Figure 3.2-35 with interpreted time-horizon segments associated with subsurface geological markers. The semblance
FIG. 3.2-26. A CMP gather and its velocity spectrum.
FIG. 3.2-27. The same CMP gather and its velocity spectrum (left and center penels) as in Figure 3.2-26 with the picked velocities denoted by + marks coincident with the semblance peaks. The curve to the right of the semblance penks is the interval velocity function derived from the picked rms velocity function. The far right panel shows the CMP gather after moveout correction using the picked rms velocity function.
FIG. 3.2-28. The same CMP gather and its velocity spectrum (left and center panels) as in Figure 3.2 26 3.2 26 3.2-263.2-263.226 with the erroneously piched velocities denoted by + marks. The curve to the right of the semblance peaks is the interval velocity function derived from the picked rms velocity function. The right-hand panel shows the CMP gather after moveout correction using the picked rms velocity function. Note the undercorrection of events caused by the erroneously too high moveout velocities.
FIG. 3.2-29. The same CMP gather and its velocity spectrum (left and center penels) as in Figure 3.2-26 with the erroneously picked velocities denoted by + marks. The curve to the right of the semblance peaks is the interval velocity function derived from the picked rms velocity function. The right-hand panel shows the CMP gather after moveout correction using the pickud rms velocity function. Note the overcorrection of events caused by the erroneousiy too low moveout velocities.
FIG. 3.2-30. The same CMP gather and its velocity spectrum as in Figure 3.2 26 3.2 26 3.2-263.2-263.226 with an erroneously picked velocity at 1875 m s 1875 m s 1875ms1875 \mathrm{~ms}1875 ms. The curve to the right of the semblance peaks is the interval velocity function derived from the picked rms velocity function. Note the anomalous interval velocity derived from the erroneously picked interval velocity.
FIG. 3.2-31. The same CMP gather and its velocity spectrum as in Figure 3.2-26 with an erroneously picked velocity at 1875 m s 1875 m s 1875ms1875 \mathrm{~ms}1875 ms. The curve to the right of the semblance peaks is the interval velocity function derived from the picked rms velocity function. Note the anomalous interval velocity derived from the erroneously picked interval velocity.
FIG. 3.2-32. A stacked section with five marker horizons as indicated.
FIG. 3.2-33. Horizon velocity analyses along five marker horizons indicated in Figure 3.2-32. The vertical and horizontal axes in each panel are stacking velocity and CMP axis, respectively.
FIG. 3.2-34. A CMP-stacked section obtained by sparsely spaced conventional velocity anslysis (top) and the stacked section (bottom) obtained by using velocities derived from horizon velocity analyds (HVA) (middle). The HVA for horizon A A AAA below the salt dome S S SSS is shown in the center.
spectra associated with the eight horizons picked from the stacked section computed by HVA are shown in Figure 3.2-36. The top spectrum corresponds to the shallowest time horizon (dark blue) after the waterbottom horizon. These spectra were picked to obtain the horizon-consistent rms velocity profiles, which were then used to derive the rms velocity section shown in Figure 3.2-37 (top). The time horizons picked from the stacked section (Figure 3.2-35) are superimposed on the velocity section. Compare the velocity sections in Figure 3.2-37 derived from HVA (top) and vertical functions (bottom), and note that the HVA-based velocity section is more consistent with the subsurface structure. Hence, the HVA results are more appropriate to use in Dix conversion to derive structure-consistent in- terval velocities with meaningful magnitudes (equation 3-24),
What about the quality of stacks (Figure 3.2-38) obtained from the velocity sections (Figure 3.2-37) derived from HVA and vertical functions? Two sets of details from the stacked sections shown in Figures 3.2-39 and 3.2-40 reveal that, indeed, there can be more than marginal differences. While the HVA-based stack shows better continuity of reflections, it is inferior to the conventional stack with regard to diffractions. This should be expected since the HVA analysis is done along reflection events and not diffractions (Figure 3.2-35).
In conclusion, if the objective is to obtain an optimum CMP stack with the highest stack power possible, conventional velocity analysis at selected CMP
FIG. 3.2-35. A CMP-stacked section with interpreted time horizon segments associated with goological markers.
locations along the line traverse or over the 3-D survey area yields a robust velocity section. If, on the other hand, the objective is to derive interval velocities from Dix conversion, then horizon-consistent velocity analysis yiclds structure-consistent results that are geologically plausable.

Coherency Attribute Stacks

The various measures of coherency discussed in this section to compute velocity spectrum can also be used to generate coherency attribute stacks. These stacks are obtained as follows:
(a) Choose a specific measure of coherency stacked amplitude (equation 3-16), normalized stacked amplitude (equation 3-18), unnormalized crosscorrelation sum (equation 3-19), normalived crosscorrelation sum (equation 3-20), energy-normalized crosscorrelation sum (equation 3-21), or semblance (equation 3-22).
(b) Compute velcoity spectra at selected CMP locations along the line and pick rms velocity functions. (c) By interpolating between the vertical functions, derive an rms velocity section.
(d) Extract vertical r m s r m s rms\mathrm{rms}rms velocity functions from the velocity section at each CMP locution along the line traverse.
(e) Apply moveout correction to CMP gathers using the extracted vertical functions.
(f) Now, compute not just the stacked amplitudes (equation 3-16), but also the coherency attributes using equations (3-18) through (3-22) and thus obtain the coherency attribute sections.
Figure 3-2.41 shows portions of coherency attribute sections associated with a field data set. These sections, in conjunction with conventional stack, may be useful in enhancing fault patterns associated with structural plays and identifying amplitude anomalies associated with stratigraphic plays. Note the discriminating power of semblance for the most coherent reflection events in the section. Conventional CMP stacking seems to yicld the most robust section that preserves reflections and diffrations. The coherency attribute sections based on croscorrelation show an apparent higher frequency content compared to the stacked and normalized starkerl sections.
FIG. 3.2-36. Semblance spectra computed along the time horizons in Figure 3.2-35. The top spectrum corresponds to the shallowest time horizon in dark blue.
FIG. 3.2-37. Top: the velocity section derived from the HVA-based semblance spectra shown in Figure 3.2-36; bottom: the velocity section derived from the interpolation of the vertical rms velocity functions picked at selected CMP locations along the line travense. Superimposed on these sections are the time horizon segments interpreted from the stacked section in Figure 3.2 35 3.2 35 3.2-353.2-353.235.
FIG. 3.2-38. Top: the CMP-stacked section derived from the HVA-based velocity section shown in Figure 3.2-37 (top); bottom: the CMP-stacked section derived from the velocity section shown in Figure 3.2-37 (bottom) derived from the interpolation of the vertical rms velocity functions picked at selected CMP locations along the line traverse.
FIG. 3.2-39. A detaled portion of the sections in Figure 3.2-38.
FIG. 3.2-40. A detailed portion of the sections in Figure 3 2-38.
FIG. 3.2-41. Coherency attribute sections: (a) stack (equation 3-16), (b) normalized stack (equation 3-18), (c) unnormalized crosscorrelation (equation 3-19), (d) normalized crosscorrelation (equation 3-20), (e) energy-normalized crosscorrelation (equation 3-21), and (f) semblance (equation 3-22).

3.3 RESIDUAL STATICS CORRECTIONS

Reflection times often are affected by irregularities in the near-surface. This is best demonstrated by the real data example in Figure 3.3-1. While the shot gathers on the left contain reflections that exhibit nearly hyperbolic moveout, those on the right have reflections that significantly depart from hyperbolic moveout. Although such distortions can be caused by a structural complexity deeper in the subsurface, more often they result from near-surface irregularities.
For land data, reflection traveltimes are reduced to a common datum level, which may be flat or vary (floating datum) along the line. Reduction of traveltimes to a datum usually requires correction for the near-surface weathering layer in addition to differences in elevation of source and receiver stations. Estimation and correction for the near-surface effects usually are performed using refracted arrivals associated with the base of the weathering layer (Section 3.4).
Traveltime corrections to account for the irregular topography and near-surface weathering layer are commonly known as field statics or refraction statics corrections (Section 3.4). These corrections remove a significant part of the traveltime distortions from the data - specifically, long-wavelength anomalies. Nevertheless, these corrections usually do not account for rapid changes in elevation, the base of weathering, and weathering velocity.
Removal of near-surface distortions on reflection times associated with deeper reflectors is routinely done by lowering the shots and receivers along vertical ray-
FIG. 3.3-1. Common-shot gathers from a land profile. Note the departures from hyperbolic traveltimes on the gathers at the right.
paths from the surface to a datum below the weathering layer. The positioning of shots and receivers to a datum along vertical raypaths amounts to static time corrections in a surface-consistent manner (Taner et al., 1974). The term static implies that it is a constant time shift for an entire trace, and the term surface-consistent implies that the time correction depends only on the surface location of the shot and receiver associated with the trace.
Figures 3.3-2a and 3.3-3a are selected CMP gathers (with field statics corrections) which were NMO corrected using a set of preliminary velocity picks derived from the velocity analyses in Figure 3.3-4. Deviations from the hyperbolic trends on the CMP gathers significantly degrade the quality of some of the velocity spectra. For instance, velocity analysis at CMP location 188 yields relatively poner quality picks than those from other velocity analyses. The CMP gathers in the neighborhood of CMP location 188 have more traveltime distortions compared to some other CMP gathers (Figure 3.3-2a). The resulting stacked section could be misleading in that residual statics may cause dim spots along the reflection horizons as well is false structures (Figure 3.3-5a), particularly between midpoints 101 to 245. False structures also are apparent on the rms AGC gained stack (Figure 3.3-6a) in which dim spots may not be apparent.
Obviously a more correct picture of the subsurface should be attained from data corrected for rapidly varying near-surface effects. After making these ressdualstatics corrections, the CMP gathers with traveltime deviations show better alignment of reflections (Figwe 3.3-2b), while those that did not require such corrections are essentially unchanged (Figure 3,3-3b). After the residual statics corrections, the ungained (Figure 3.3-5b) and gained stacked sections (Figure 3.3-6b) show improvement in the entinuity of reflections as well as significant elimination of false structures (refer to the segment between midpoints 101 to 245 ).
Following the residual statics corrections, velocity analyses almost always are repeated to update the velocity picks (Figure 3.3-7). Comparison of Figures 3.3-4 and 3.3-7 shows that residual statics corrections have improved the velocity analysis. The same CMP gathers after NMO corrections using the updated velocity picks are shown in Figures 3.3 8 a 3.3 8 a 3.3-8a3.3-8 a3.38a and 3.3 9 a 3.3 9 a 3.3-9a3.3-9 a3.39a, while the same gathers after residual statics corrections are shown in Figures 3.3-8b and 3.3-9b. Comparison of the CMP gathers before and after residual statics corrections shows significant elimination of time deviations. The resulting stacked sections using the revised velocity estimates are shown in Figure 3.3-10, while the gained stacks are shown in Figure 3.3-11.
Compare the stacked sections in Figures 3.3-6a,b and 3.3-11a,b, and observe the gradual improvement in the following order:
(a) CMP stack based on preliminary velocity picks (Figure 3.3-4) but with no residual statics corrections applied (Figure 3.3-6a),
(text contznues on p. 936 )
(a)
(b)
FIG. 3.3-2. CMP gathers from a land profile: (a) before residual statics corrections, (b) after residual statics corrections. (Shot gathers are shown in Figure 33 -1.) NMO correction was applied using preliminary velocity picks derived from the spectra in Figure 3.3-4. The CMP stacks are shown in Figure 3 3-5.
(a)
(b)
FIG. 3.3-3. CMP gathers from the same land line as in Figure 3.3-2 (a) before and (b) after residual statics corrections. This part of the line does not have as severe a statics problem as that shown in Figure 3.3-2. The NMO correction was appled using proliminary velocity picks derived from the spectra in Figure 3.3-4.
FIG. 3.3-4. Velocity analyges before residual statics corrections along the land line shown in Figure 3.3-5. Figures 3.3-2 and 3.3-3 show selected CMP gathers-
(a)
(b)
FIG. 3.3-5. CMP stacks derived from gathers in Figures 3.3-2 and 3.3-3. Stack (a) before and (b) after residual statics corrections, NMO correction was applied using preliminary velocity picks derived from the spectra in Figure 3.3.4.
(a)
(b)
FIG. 3.3-6. The same CMP stacks as in Figure 3.3-5 with rms gain applied. Gained stacks (a) before and (b) after residual statics corrections.
FIG. 3.3-7. Velocity analyses after residual statics corrections along the line shown in Figure 3.3-5. Figures 3.3-8 and 3.3-9 show selected CMP gathers.
(a)
(b)
FIG. 3.3-8. CMP gathers from the land line shown in Figure 3.3-10. CMP gathers (a) without and (b) with residual statics corrections. (Figure 3.3-1 shows the shot gathers from the same line.) NMO correction was applied using final velocity picks derived from the spectra in Figure 3.3-7.
(a)
(b)
FIG. 3.3-9. CMP gathers from the same land line as in Figure 3.3-8. CMP gathers (a) without and (b) with residual statics corrections. This part of the line does not have as severe a statics problem as the part in Figure 3.3-8, NMO corrention was applied using final velocity picks derived from the spectra in Figure 3.3-7.
(a)
(b)
FIG. 3.3-10. CMP stacks derived from the gathers in Figures 3.3-8 and 3.3-9. Stack (8) before and (b) after residual statics corrections and using revised velocity estimates from Figure 3.3.7.
(a)
(b)
FIG. 3.3-11. The same CMP stacks as in Figure 3.3-10 with rms gain applied. Gained stacks (s) before and (b) after residual statics corrections and using revised velocity estimntes from Figure 3.3-7.

1. CMP Gathers with Field Statics Applied

2. Velocity Analysis

3. NMO Correction using Preliminary Picks

4. Compute and Apply Residual Statics

5. Inverse NMO Correction

6. Velocity Analysis
7. NMO Correction using Final Picks

8. Stack

FIG. 3.3-12. Processing flowchart with residual statics corrections.
(b) stack based on preliminary velocity picks (Figure 3.3-4) and with residual statics corrections applied (Figure 3.3-6b),
(c) stack based on final velocity picks (Figure 3.3-7) but with no residual statics corrections applied (Figure 3.3-11a), and
(d) stack based on final velocity picks (Figure 3.3-7) and with residual statics corrections applied (Figure 3.3-11b).
Here, the velocity picks made from CMP gathers with no residual statics corrections applied are referred to as prehminary and those made from CMP gathers with residual statics corrections applied are referred to as final.
Residual statics corrections usually are discussed in terms of applications to land data. However, in certain cases, residual statics corrections have produced dramatic improvement in marine data. Areas with irregular water-bottom topography in shallow water (less than 25 m 25 m 25m25 \mathrm{~m}25 m ), and areas with rapidly varying velocity in the sediments near the water bottom are places where statics corrections have been successfinl.
Figure 3.3-12 shows a commonly used flowchart for residual statics corrections and velocity analysis aimed at producing an optimum stacked section. Start with CMP gathers with field statics or refraction statics corrections applied (Section 3.4), and perform velocity analysis, usually no more than a few locations along the line. Then, apply NMO correction with the preliminary velocity picks and compute residual static shifts. Apply these corrections to the original gathers, and repeat the velocity analysis this time at all necessary locations along the line. Finally, apply NMO correction and stack the data. In some cases, there may be more than one iteration of estimating and applying the residual statics corrections.
In practice, the flowchart in Figure 3.3-12 usually is augmented with additional quality control steps. It often is necessary to examine CMP gathers and velocity analyses after residual statics corrections. Diagnostic tools allow determination of the magnitude of these corrections. For example, common-shot and common-receiver gathers indicate relative static shifts from one receiver location to another and from one shot location to another (Figures 3.3-13 and 3.3-14, respectively). Also, common-shot-point and common-receiverpoint stacks can be used in combination with commonreceiver and common-shot gathers, respectively. A common-shot-point stack (Figure 3.3-15) should indicate the range of magnitude of shot static shifts; a common-receiver-point stack (Figure 3.3-16) should indicate the range of magnitude of receiver static shifts along the line. These displays enable the determination of an optimum maximum allowable shift to consider for picking traveltime deviations from the moveoutcorrected CMP data for input to residual statics estiamtion algorithms. From the example in Figures 3.3-15 and 3.3 16 3.3 16 3.3-163.3-163.316, the receiver component of static shifts is greater than the shot component.

Residual Statics Estimation by Traveltime Decomposition

Static deviations from a hyperbolic traveltime trajectory are illustrated in Figure 3.3-17. After NMO correction, the misalignment of the wavelet associated with a reflection time horizon h h hhh along the offset axis in the CMP gather will yield a poor stack trace. We want to estimate the time shifts from the time of perfect alignment and correct for these time shifts. To do this, a
(a)
(b)
FIG. 3.3-13. Moveout-corrected common-shot gathers from the same land line as in Figure 3.3-1. Common-shot gathers (B) before and (b) after residual statics corrections.
(a)
(b)
FIG. 3.3-14. Moveout-corrected common-receiver gathers from the same land line as in Figure 3.3-13. Common-receiver gathers (a) before and (b) after residual statics corrections.
(a)
(b)
FIG. 3.3-15. A diagnostic display for residual statics corrections. Common-shot-point (CSP) stack (a) before and (b) after residual statics corrections. Note the missing shots between CMP 151 and 243. The CSP stack can be used to estimate the magnitude and spatial variation of shot statics along a line.
(a)
(b)
FIG. 3.3-16. A diagnoetic display for residual statics corrections. Common-receiver-point (CRP) stack (a) before and (b) after residual statics corrections. The CRP stack can be used to estimate the magnitude and spatial variation of receiver statics along a line.
FIG. 3.3-17. Plcking traveltime deviations from NMOcorrected gathers.
model is needed for the moveout-corrected traveltime from a source location to a depth point on a reflecting horizon, then back to a receiver location. Figure 3.3-18 shows the geometry and notation that will be used in defining this model. The key assumption in the comnonly used traveltime model discussed here is that residual statics are surface-consistent (Hileman et al., 1968; Taner et al., 1974). This means that static shifts are time delays that depend solely on source or receiver locations at the surface, not on raypaths in the subsurface. Such an assumption is valid if all raypaths, regardless of source-receiver offset, are vertical within the near surface layer. The surface-consistent assumption usually is a good one, because the weathering layer often has very low velocity and a strong refraction at its base tends to make travel paths vertical. The assumption may not be good for a high-velocity permafrost layer that causes rays to bend away from vertical.
The picked traveltime t y t y t_(y)t_{y}ty that corresponds to the j j jjj th source station, the i i iii th receiver station, and the k k kkk th midpoint [ k = ( i + j ) / 2 ] [ k = ( i + j ) / 2 ] [k=(i+j)//2][k=(i+j) / 2][k=(i+j)/2] along a specific reflection time horizon h h hhh (Figure 3.3-17) can be approximately modeled by the following equation (Taner et al., 1974; Wiggins et al., 1976):
t i j = s j + r i + G k + M k x i j 2 , t i j = s j + r i + G k + M k x i j 2 , t_(ij)^(')=s_(j)+r_(i)+G_(k)+M_(k)x_(ij)^(2),t_{i j}^{\prime}=s_{j}+r_{i}+G_{k}+M_{k} x_{i j}^{2},tij=sj+ri+Gk+Mkxij2,
where s s sss, is the residual static time shift associated with the j j jjj th source station, r 2 r 2 r_(2)r_{2}r2 is the residual static time shift associated with the i i iii th receiver station, and G k G k G_(k)G_{k}Gk is the difference in two-way time at a reference CMP location and the traveltime at the k k kkk th CMP location along the h h hhh th horizon. This term refers to structural variations along the horizon and is called the structure term. The term M k x i j 2 M k x i j 2 M_(k)x_(ij)^(2)M_{k} x_{i j}^{2}Mkxij2 is the residual moveout which is assumed to he parabolic. It accounts for the imperfect moveout correction within the specific tine gate that includes
FIG. 3.3-18. Surface-consistent statics model to establish the traveltime model equation (3-25). Here, T = T = T=T=T= topographic layer, B = B = B=B=B= base of weathering layer, D = D = D=D=D= datum to which static corrections are made, R = R = R=R=R= deep reflector, j = j = j=j=j= shot st u u uuu tion index, t = t = t=t=t= receiver station index, k = k = k=k=k= midpoint location index, x 2 j = x 2 j = x_(2j)=x_{2 j}=x2j= offiset between the shot and receiver stations.
the reflection time horizon h h hhh. The coefficient M k M k M_(k)M_{k}Mk has the dinensions of (time / distance 2 2 ^(2){ }^{2}2 ).
To be specific in an analysis of the system of equetions implied by equation (3-25), assume n θ n θ n_(theta)n_{\theta}nθ shot locations, n r n r n_(r)n_{r}nr receiver locations, and n G n G n_(G)n_{G}nG CMP locations. Then define the fold as n f n f n_(f)n_{f}nf. The purpose is to decompose the observed traveltimes estimated (picked) from the data t 12 t 12 t_(12)t_{12}t12 to their individual components as defined on the right side of equation (3-25). The number of time picks (or individual equations) is equal to n G × n f n G × n f n_(G)xxn_(f)n_{G} \times n_{f}nG×nf. The number of unknowns is n s + n F + n G + n G n s + n F + n G + n G n_(s)+n_(F)+n_(G)+n_(G)n_{s}+n_{F}+n_{G}+n_{G}ns+nF+nG+nG. Typically, ( n G × n f ) > ( n g + n + + n G + n G ) n G × n f > n g + n + + n G + n G (n_(G)xxn_(f)) > (n_(g)+n_(+)+n_(G)+n_(G))\left(n_{G} \times n_{f}\right)>\left(n_{g}+n_{+}+n_{G}+n_{G}\right)(nG×nf)>(ng+n++nG+nG); hence, there are more equations than unknowns.
We can formulate a least-squares problem in which we must minimize the sum of the least-squares error energy between the observed traveltime picks t 3 , t 3 , t_(3,)t_{3,}t3, and the modeled traveltimes t t t t t_(t)t_{t}tt :
E = i j ( t i j t i j ) 2 E = i j t i j t i j 2 E=sum_(ij)(t_(ij)-t_(ij)^('))^(2)E=\sum_{i j}\left(t_{i j}-t_{i j}^{\prime}\right)^{2}E=ij(tijtij)2
Residual statics corrections involve three phases:
(1) Picking traveltime deviations t 1 t 1 t_(1)t_{1}t1, based on crosscorrelation of traces in a CMP gather with a reference or pilot trace that needs to be defined in some fashion,
(2) Modeling t 2 j t 2 j t_(2j)t_{2 j}t2j by way of equation (3-25) and decomposing it into its components: source and receiver statics, structural and residual moveout terms, and
(3) Applying the derived source and receiver terms s 3 s 3 s_(3)s_{3}s3 and r 2 r 2 r_(2)r_{2}r2, respectively, to traveltimes on the preNMO-corrected CMP gathers.
The picking phase relates to estimating traveltimes t i t i t_(i)t_{i}ti from the data. Several picking schemes are in use in the industry. The one described here often is known as a pilot trace scheme. Starting with the CMP gathers that are NMO-corrected using a preliminary velocity function(s), trace amplitudes are scaled to a common rms amplitude in the time gate(s) to be used for picking. For ciarity, consider a time gate over the k k kkk th midpoint gather as illustrated in Figure 3.3-17. (It is preferable to start with a gather that has a good signal-to-noise ratio.) A stack trace then is constructed within the time gate h h hhh. Each individual trace in the gather is crosscorrelated with the stack trace. Time shifts t 13 t 13 t_(13)t_{13}t13, which correspond to maximum crosscorrelations, are picked. A preliminary pilot trace is constructed by stacking the time-shifted traces in the gather. This preliminary pilot trace is, in turn, crosscorrelated with the original traces in the gather and new values for t 1 j t 1 j t_(1j)t_{1 j}t1j are computed. A final pilot trace is constructed again by stacking the original traces shifted by the new values for t i v t i v t_(iv)t_{i v}tiv. This final pilot trace is crosscorrelated with the traces of the next gather to construct the preliminary pilot trace for that gather. The process is performed this way on all CMP gathers moving to the left and right from the starting point. The picked time deviations t y , t y , t_(y,)t_{y,}ty, are passed on to the next phase, which involves decomposing these time picks into components as defined by equation (3-25).
Several practical issues are involved in the picking phase. Band-pass filtering often helps to estimate a reliable time shift that corresponds to the peak crosscorrelation value. Selection of the time window used for crosscorrelation is another important factor. If needed, the window should be allowed to change laterally so that it follows the marker horizon(s). A maximum threshold for the correlation shift can be imposed to prevent unrealistically large time deviations from being passed on to the decomposition phase. Any time deviations greater than a specified maximum allowable shift can be set to that shift, or rejected altogether. Alternatively, the rejected shift can be replaced by a secondary correlation peak value. Finally, the input CMP gathers must be NMO-corrected by using a regional velocity function or velocities derived from a preliminary velocity analysis. These parameters are discussed in detail later in the section.
The next step in residual statics corrections involves least-squares decomposition of the time picks t 43 t 43 t_(43)t_{43}t43. For a basic understanding of this step, consider the following special problem. Suppose there are four observations t i t i t_(i)t_{i}ti, measured at receiver locations x 2 x 2 x_(2)x_{2}x2, where ı = 1 , 2 , 3 , 4 ı = 1 , 2 , 3 , 4 ı=1,2,3,4\imath=1,2,3,4ı=1,2,3,4. We want to fit the observed data into a straight line t = a + b x t = a + b x t=a+bxt=a+b xt=a+bx, which is best in a least-squares error sense. Start with the following set of equations:
t 1 a + b τ 1 t 2 a + b x 2 t 3 a + b x 3 t 4 a + b x 4 t 1 a + b τ 1 t 2 a + b x 2 t 3 a + b x 3 t 4 a + b x 4 {:[t_(1)~~a+btau_(1)],[t_(2)~~a+bx_(2)],[t_(3)~~a+bx_(3)],[t_(4)~~a+bx_(4)]:}\begin{aligned} & t_{1} \approx a+b \tau_{1} \\ & t_{2} \approx a+b x_{2} \\ & t_{3} \approx a+b x_{3} \\ & t_{4} \approx a+b x_{4} \end{aligned}t1a+bτ1t2a+bx2t3a+bx3t4a+bx4
There are two unknowns, a a aaa and b b bbb, and four equations. This problem is similar to decomposing the time picks into various components as described by equation (325). We define the error series e n e n e_(n)e_{n}en, such that
t 1 + a + b x 1 = e 1 t 2 + a + b x 1 = e 2 t 3 + a + b x 1 = e 3 t 4 + a + b x 1 = e 4 . t 1 + a + b x 1 = e 1 t 2 + a + b x 1 = e 2 t 3 + a + b x 1 = e 3 t 4 + a + b x 1 = e 4 . {:[-t_(1)+a+bx_(1)=e_(1)],[-t_(2)+a+bx_(1)=e_(2)],[-t_(3)+a+bx_(1)=e_(3)],[-t_(4)+a+bx_(1)=e_(4).]:}\begin{aligned} & -t_{1}+a+b x_{1}=e_{1} \\ & -t_{2}+a+b x_{1}=e_{2} \\ & -t_{3}+a+b x_{1}=e_{3} \\ & -t_{4}+a+b x_{1}=e_{4} . \end{aligned}t1+a+bx1=e1t2+a+bx1=e2t3+a+bx1=e3t4+a+bx1=e4.
We want to minimize the energy of the cumulative errors as defined by
E = 1 e 1 2 E = 1 e 1 2 E=sum_(1)e_(1)^(2)E=\sum_{1} e_{1}^{2}E=1e12
The energy for the i i iii th error is computed by squaring both sides of equation (3-28)
e i 2 = ( t 4 + a + b x 7 ) 2 e i 2 = t 4 + a + b x 7 2 e_(i)^(2)=(-t_(4)+a+bx_(7))^(2)e_{i}^{2}=\left(-t_{4}+a+b x_{7}\right)^{2}ei2=(t4+a+bx7)2
By substituting into equation (3-29a) and summing over i = 1 , 2 , 3 , 4 i = 1 , 2 , 3 , 4 i=1,2,3,4i=1,2,3,4i=1,2,3,4, we obtain
E = i t i 2 + 4 a 2 + b 2 i x s 2 2 a i t i 2 b i x i t i + 2 a b i x i . E = i t i 2 + 4 a 2 + b 2 i x s 2 2 a i t i 2 b i x i t i + 2 a b i x i . {:[E=sum_(i)t_(i)^(2)+4a^(2)+b^(2)sum_(i)x_(s)^(2)-2asum_(i)t_(i)],[-2bsum_(i)x_(i)t_(i)+2absum_(i)x_(i).]:}\begin{aligned} E= & \sum_{i} t_{i}^{2}+4 a^{2}+b^{2} \sum_{i} x_{s}^{2}-2 a \sum_{i} t_{i} \\ & -2 b \sum_{i} x_{i} t_{i}+2 a b \sum_{i} x_{i} . \end{aligned}E=iti2+4a2+b2ixs22aiti2bixiti+2abixi.
To find the best line, we want to determine un knowns a a aaa and b b bbb so that error energy E E EEE is minimal. The sum E E EEE of the squared errors will attain a minimum if a a aaa and b b bbb are chosen so that
E a = 8 a 2 2 t 2 + 2 b 3 x 2 = 0 , ( 3 31 a ) E a = 8 a 2 2 t 2 + 2 b 3 x 2 = 0 , ( 3 31 a ) (del E)/(del a)=8a-2sum_(2)t_(2)+2bsum_(3)x_(2)=0,quad(3-31 a)\frac{\partial E}{\partial a}=8 a-2 \sum_{2} t_{2}+2 b \sum_{3} x_{2}=0, \quad(3-31 a)Ea=8a22t2+2b3x2=0,(331a)
and
E b = 2 b i x τ 2 2 1 x 1 t 2 + 2 a i x 1 = 0 . E b = 2 b i x τ 2 2 1 x 1 t 2 + 2 a i x 1 = 0 . (del E)/(del b)=2bsum_(i)x_(tau)^(2)-2sum_(1)x_(1)t_(2)+2asum_(i)x_(1)=0.\frac{\partial E}{\partial b}=2 b \sum_{i} x_{\tau}^{2}-2 \sum_{1} x_{1} t_{2}+2 a \sum_{i} x_{1}=0 .Eb=2bixτ221x1t2+2aix1=0.
We now have two equations with two unknowns that can be put into a matrix form
( 4 1 x 2 t x 2 1 x 2 2 ) ( a b ) = ( i t 2 2 x 2 t 2 ) . 4 1 x 2 t x 2 1 x 2 2 a b = i t 2 2 x 2 t 2 . ([4,sum_(1)x_(2)],[sum_(t)x_(2),sum_(1)x_(2)^(2)])([a],[b])=([sum_(i)t_(2)],[sum_(2)x_(2)t_(2)]).\left(\begin{array}{cc} 4 & \sum_{1} x_{2} \\ \sum_{t} x_{2} & \sum_{1} x_{2}^{2} \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{c} \sum_{i} t_{2} \\ \sum_{2} x_{2} t_{2} \end{array}\right) .(41x2tx21x22)(ab)=(it22x2t2).
Equation (3-32) can be solved for the unknowns a a aaa and b b bbb. The minimum energy between the estimated model and the actual data values then can be computed by solving for a a aaa and b b bbb and substituting into equation (3-30).
Table 3-8. Time picks t q t q t_(q)t_{q}tq at various x t x t x_(t)x_{t}xt locations.
i i iii x i x i x_(i)x_{i}xi t i t i t_(i)^(')t_{i}^{\prime}ti
1 1 2.4
2 2 2.9
3 3 3.6
4 4 4.1
i x_(i) t_(i)^(') 1 1 2.4 2 2 2.9 3 3 3.6 4 4 4.1| $i$ | $x_{i}$ | $t_{i}^{\prime}$ | | :--- | :--- | :--- | | 1 | 1 | 2.4 | | 2 | 2 | 2.9 | | 3 | 3 | 3.6 | | 4 | 4 | 4.1 |
Consider the time values at various x x xxx locations specified in Table 3-8. Using these time picks, the elements of the coefficient matrix on the left side and the column matrix on the right side of equation (3-32) are
( 4 10 10 30 ) ( a b ) = ( 13 35.4 ) 4 10 10 30 a b = 13 35.4 ([4,10],[10,30])([a],[b])=([13],[35.4])\left(\begin{array}{cc} 4 & 10 \\ 10 & 30 \end{array}\right)\left(\begin{array}{l} a \\ b \end{array}\right)=\left(\begin{array}{c} 13 \\ 35.4 \end{array}\right)(4101030)(ab)=(1335.4)
The solution for equation (3-33) is a = 1.8 a = 1.8 a=1.8a=1.8a=1.8 and b = 0.58 b = 0.58 b=0.58b=0.58b=0.58. Note that we are not constrained by the number of observations when setting up the least-squares problem. This problem involves more equations (3-27) than unknowns, a a aaa and b b bbb.
The least-squares approach has a wide range of applications in applied geophysics. We also formulate the inverse filtering used in deconvolution based on a least-squares procedure (Section B.5). The Wiener filter itself is based on a least-squares estimation of a future sample point in a given time series. Here, we discussed another application of the least-squares method - residual statics estimation by traveltime decomposition, which involves more equations than unknowns. In Chapter 9, when discussing 2-D surface data processing, we encounter the problem of fitting irregularly spaced observations into a uniform grid. This involves least-squares fitting to a local plane (Section J.5).
We now return to the problem of residual statics estimation and refer to equation (3-26). We have the observed traveltime deviations t i j t i j t_(ij)t_{i j}tij picked from moveoutcorrected CMP gathers within a specified time gate that includes a strong reflection. We want to estimate the parameters - the surface-consistent source and receiver static shifts, s 3 s 3 s_(3)s_{3}s3 and r 1 r 1 r_(1)r_{1}r1, respectively. These parameters are related to the modeled traveltime deviations t v t v t_(v)^(')t_{v}^{\prime}tv, by way of the model equation (3-25). If there are 50000 picks, then you have 5 0 0 0 0 5 0 0 0 0 50000\mathbf{5 0} \mathbf{0 0 0}50000 model equations.
Substitute for t i t i t_(i)t_{i}ti from equation (3-25) and minimize the error energy E E EEE in equation (3-26) by requiring
E s j = E r ı = E G k = E M k = 0 , E s j = E r ı = E G k = E M k = 0 , (del E)/(dels_(j))=(del E)/(delr_(ı))=(del E)/(delG_(k))=(del E)/(delM_(k))=0,\frac{\partial E}{\partial s_{j}}=\frac{\partial E}{\partial r_{\imath}}=\frac{\partial E}{\partial G_{k}}=\frac{\partial E}{\partial M_{k}}=0,Esj=Erı=EGk=EMk=0,
which yields n θ + n r + n G + n G n θ + n r + n G + n G n_(theta)+n_(r)+n_(G)+n_(G)n_{\theta}+n_{r}+n_{G}+n_{G}nθ+nr+nG+nG equations and that many unknowns.
These equations can be solved for the residual statics associated with n , n n_(", ")n_{\text {, }}n source locations, n r n r n_(r)n_{r}nr receiver locations, n G n G n_(G)n_{G}nG structural terms, and n G n G n_(G)n_{G}nG residual moveout terms. For a real data set, the number of these terms can be large. It is easy to solve the problem with the two parameters given by equation (3-34). However, when dealing with a large number of linear equations, the solution must be done accurately and efficiently. Wiggins et al. (1978) used the Gauss-Seidel iterative procedure to solve for equations (3-34) (Section C.4).
The Gauss-Seidel method is best described by roturning to the earlier line fitting example and solving for a a aaa and b b bbb in equation (3-33). When written as normal equations, we have
4 a + 10 b = 13 4 a + 10 b = 13 4a+10 b=134 a+10 b=134a+10b=13
and
10 a + 30 b = 35.4 10 a + 30 b = 35.4 10 a+30 b=35.410 a+30 b=35.410a+30b=35.4
These equations are rearranged as
a = 3.25 2.5 b a = 3.25 2.5 b a=3.25-2.5 ba=3.25-2.5 ba=3.252.5b
and
b = 1.18 0.333 a . b = 1.18 0.333 a . b=1.18-0.333 a.b=1.18-0.333 a .b=1.180.333a.
Since the Gauss-Seidel technique is iterative, starting values are needed. To start the iteration, set a = b = 0 a = b = 0 a=b=0a=b=0a=b=0. Substituting b = 0 b = 0 b=0b=0b=0 in equation (3-36a), we obtain a = a = a=a=a= 3.25. Putting this updated solution into equation (336b) gives b = 0.0977 b = 0.0977 b=0.0977b=0.0977b=0.0977. At the end of the first iteration, a = 3.25 a = 3.25 a=3.25a=3.25a=3.25 and b = 0.0977 b = 0.0977 b=0.0977b=0.0977b=0.0977. For the second iteration, put b = 0.0977 b = 0.0977 b=0.0977b=0.0977b=0.0977 into equation (3-36a) to get a = 3.0075 a = 3.0075 a=3.0075a=3.0075a=3.0075. Put a = 3.0075 a = 3.0075 a=3.0075a=3.0075a=3.0075 into equation (3-36b) to get b = 0.1785 b = 0.1785 b=0.1785b=0.1785b=0.1785. This iterative procedure is continued in Table 3-9.
The solution from the iterative procedure slowly converges toward the actual values, a = 1.8 , b = 0.58 a = 1.8 , b = 0.58 a=1.8,b=0.58a=1.8, b=0.58a=1.8,b=0.58. Convergence is not always guaranteed. Nevertheless, convergence can be attained with the Gauss-Seidel method, provided the unknowns are ordered properly; that is, iteration starts with the correct unknown. This
Table 3-9. Gauss-Seidel iteration for solving equation (3-33) for a a aaa and b b bbb. (Values were rounded off for tabulation.)
Actual values: a = 1.8 , b = 0.58 a = 1.8 , b = 0.58 a=1.8,b=0.58a=1.8, b=0.58a=1.8,b=0.58.
Iteration
a a aaa
b b bbb
1
3.25
0.0977
5 2.4918 0.3502 5 2.4918 0.3502 {:[5,2.4918,0.3502]:}\begin{array}{lll}5 & 2.4918 & 0.3502\end{array}52.49180.3502
10 2.0712 0.4902 10 2.0712 0.4902 {:[10,2.0712,0.4902]:}\begin{array}{lll}10 & 2.0712 & 0.4902\end{array}102.07120.4902
15 1.9031 0.5462 15 1.9031 0.5462 {:[15,1.9031,0.5462]:}\begin{array}{lll}15 & 1.9031 & 0.5462\end{array}151.90310.5462
20 1.8358 0.5686 20 1.8358 0.5686 {:[20,1.8358,0.5686]:}\begin{array}{lll}20 & 1.8358 & 0.5686\end{array}201.83580.5686
25 1.8090 0.5779 25 1.8090 0.5779 {:[25,1.8090,0.5779]:}\begin{array}{lll}25 & 1.8090 & 0.5779\end{array}251.80900.5779
29 1.7997 0.5807 29 1.7997 0.5807 {:[29,1.7997,0.5807]:}\begin{array}{lll}29 & 1.7997 & 0.5807\end{array}291.79970.5807
problem is addressed in Exercises 3-11 and 3-12. The advantage of the Gauss-Seidel method is its ability to solve the large number of simultaneous equations rapidly.
The question of when to terminate the iterations remains. The rate at which the solution changes can be examined after each iteration. The computation is stopped when this rate falls below a specified threshold value.
The starting values for solving the normal equations (3-34), can be chosen as s j = r 1 = G k = M k = 0 s j = r 1 = G k = M k = 0 s_(j)=r_(1)=G_(k)=M_(k)=0s_{j}=r_{1}=G_{k}=M_{k}=\mathbf{0}sj=r1=Gk=Mk=0, as in the simple numerical example. To some extent, the best order of iteration depends on the exact nature of the statics problem at hand. One order of iteration that is commonly in use follows: Compute the structure term G 1 G 1 G_(1)G_{1}G1 the residual moveout term M , the M , the  M_(", the ")M_{\text {, the }}M, the  the static shift associated with source location s s sss, then the static shift associated with receiver location r r rrr. The procedure cycles back to G G GGG in the next iteration and continues until convergence is satisfactory. The order in which the individual terms are computed theoretically can be interchanged. However, the above order forces long-wavelength variations of the time picks to be concentrated mainly in the structure term. This leads to a lesser number of iterations (typically 2 or 3 ) for wavelength components of the statics that are less than half the largest data offset. A large number of iterations are required to handle static variations that are greater than the maximum offset,
After computing the individual static shifts associated with each source and receiver location, these shifts are passed on to the application phase, whereby the shifts are applied to the pre-NMO-corrected gather traces (Figure 3.3-13). In areas with extremely poor signal-to-noise ratio or complicated near-surface variations, multiple passes of residual statics corrections may be necessary. In other words, output from the first pass may be NMO-corrected, new picks estimated, decomposed, and applied, and so on.
The question remains as to whether equations (325) are independent of each other. This is important, for it tells whether the solution is unique or not. For simplicity, consider the case of zero structure and zero residual moveout. In that cese, equations (3-25) take the form
t z j = s j + r z . t z j = s j + r z . t_(zj)=s_(j)+r_(z).t_{z j}=s_{j}+r_{z} .tzj=sj+rz.
Consider only four unknowns: s s sss, where j = 1 , 2 j = 1 , 2 j=1,2j=1,2j=1,2, and r 4 r 4 r_(4)r_{4}r4, where i = 1 , 2 i = 1 , 2 i=1,2i=1,2i=1,2, which yicld four equations:
t 11 = s 1 + r 1 t 12 = s 2 + r 1 t 21 = s 1 + r 2 t 22 = s 2 + r 2 t 11 = s 1 + r 1 t 12 = s 2 + r 1 t 21 = s 1 + r 2 t 22 = s 2 + r 2 {:[t_(11)=s_(1)+r_(1)],[t_(12)=s_(2)+r_(1)],[t_(21)=s_(1)+r_(2)],[t_(22)=s_(2)+r_(2)]:}\begin{aligned} & t_{11}=s_{1}+r_{1} \\ & t_{12}=s_{2}+r_{1} \\ & t_{21}=s_{1}+r_{2} \\ & t_{22}=s_{2}+r_{2} \end{aligned}t11=s1+r1t12=s2+r1t21=s1+r2t22=s2+r2
However, from a close examination of equations (3-37b), we note that
t 11 + t 22 = t 12 + t 21 t 11 + t 22 = t 12 + t 21 t_(11)+t_(22)=t_(12)+t_(21)t_{11}+t_{22}=t_{12}+t_{21}t11+t22=t12+t21
Therefore, one of the four equations (3-37b) is redundant, leaving three independent equations for four unknowns.
This simple exercise shows that the statics solution obtained by solving equations (3-34) suffers from an uncertainty. In particular, the solution obtained by, say, the Gauss-Seidel iteration, is nonunique. It is but one of many possible solutions. In fact, the solution may not even be physically reasonable. Because of the problem of fewer independent equations than unknowns, it may be necessary to impose a constraint on the solution from the traveltime decomposition (equation 3-25):
(a) A plausable constraint is that the difference between shot and receiver statics be minimal (Gulunay, 1985). It can be argued that this may not be valid, as is the case with dynamite data in which shots and receivers do not occupy the same physical locations.
(b) Other possible constraints can be in the form of restrictions on the spatial variation of structure, moveout, or statics terms themselves; all are used in various practical implementations. For instance, one may postulate a model equation for the residual statics problem, where the structure term has been omitted. Then, you have to design your picking strategy accordingly, such that you do not accumulate the traveltimes as you go from one CMP location to another. This may be preferable in areas with very low-relief structures.
(c) We may want to impose the surface-consistency rule in a strict sense, and assign the same static shift to a shot and receiver if they occupy nearly the same physical location.
(d) We may also opt to set the residual cnoveout coefficient M M MMM to a constant across the line if we are fairly confident of the velocity control. This then gives us fewer parameters to estimate, thus making the residual statics solution more likely to be stable and physically plausable.

Residual Statics Estimation

by Stack-Power Maximization
Estimation of traveltime deviations from NMOcorrected CMP gathers may fail with land data which have low fold and poor signal-to-noise ratio. As a result, residual statics solution by traveltime decomposition can be erratic and unstable. A more robust alternative for surface-consistent estimates of shot and residual
static shifts is based on minimizing the difference between modeled and actual traveltime deviations (equation 3-26) associated with a reflection event on moveoutcorrected gathers. Specifically, surface-consistent static shifts also can be determined by maximizing the power of stacked traces (Ronen and Claerbout, 1985).
The conceptual basis of the method of stack power maximization is intuitively simple. Consider determining the residual static at a shot station. As in the case of residual statics estimation by traveltime decomposition, this method also is applied to moveout-corrected data.
(a) Apply a static shift to all the traces in the commonshot gather associated with the station under consideration.
(b) Stack over a time gate the CMP gathers that inciude traces from that shot gather.
(c) Compute the cumulative energy of the stacked traces from step (b) by summing the squared amplitudes.
(d) Repeat steps (a), (b), and (c) for a range of static shifts.
(e) Choose the static shift that yields the highest stack power and assign it to the shot location under consideration.
(f) Apply the shot residual static shift associated with the highest stack power to all the traces in the shot gather.
(g) Stack the CMP gathers that include traces from this shot gather.
(h) Move to the next shot station and repeat steps (a) through (g).
The process is then repeated for the receiver stations using common-receiver gathers.
This formal recipe for stack-power maximization is intensive both computationally and in terms of data movement. A practical alternative involves creating two supertraces - one from the traces of the common-shot or common-receiver gather under consideration, and a second one from the traces of the stacked traces associated with the common-shot or common-receiver gather (Ronen and Claerbout, 1985). A supertrace is created by augmenting the individual segments of traces within the specified time gate in a gather, one followed by the other with a zone of zero-amplitude samples between them. The subtlcty of the method to kcep in mind is that the stack supertrace does not include the contribution of the traces from the common-shot or commonreceiver gather.
Define the shot and stack supertraces by the time series F ( t ) F ( t ) F(t)F(t)F(t) and G ( t ) G ( t ) G(t)G(t)G(t), respectively. The stack power defined as the power of the sum of these two traces over the time gate t t ttt is
P ( Δ t ) = t [ F ( t Δ t ) + G ( t ) ] 2 P ( Δ t ) = t [ F ( t Δ t ) + G ( t ) ] 2 P(Delta t)=sum_(t)[F(t-Delta t)+G(t)]^(2)P(\Delta t)=\sum_{t}[F(t-\Delta t)+G(t)]^{2}P(Δt)=t[F(tΔt)+G(t)]2
where Δ t Δ t Delta t\Delta tΔt is the trial static shift applied to the shot supertrace F ( t ) F ( t ) F(t)F(t)F(t). By expanding the squared term, we obtain
P ( Δ t ) = t F 2 ( t Δ t ) + t G 2 ( t ) + 2 t F ( t Δ t ) G ( t ) P ( Δ t ) = t F 2 ( t Δ t ) + t G 2 ( t ) + 2 t F ( t Δ t ) G ( t ) P(Delta t)=sum_(t)F^(2)(t-Delta t)+sum_(t)G^(2)(t)+2sum_(t)F(t-Delta t)G(t)P(\Delta t)=\sum_{t} F^{2}(t-\Delta t)+\sum_{t} G^{2}(t)+2 \sum_{t} F(t-\Delta t) G(t)P(Δt)=tF2(tΔt)+tG2(t)+2tF(tΔt)G(t).
The first two terms are the powers of the two supertraces that can be defined by a constant, and the third term is the crasscorelation of the two supertraces. Therefore, maximizing the stack power is equivalent to maximizing the crosscorrelation (Ronen and Claerbout, 1985).
Now, consider, again, determining the residual static at a shot station.
(a) Create the shot supertrace. To circumvent end effects in step (c), place zero-amplitude samples between the trace segments when creating the supertraces.
(b) Create the stack supertrace.
(c) Crosscorrelate the two supertraces.
(d) Determine the correlation lag associated with the peak crosscorrelation value - this is the shot residual static shift.
(f) Apply the shot residual static shift associated with the highest correlation value to all the traces in the shot gather.
(g) Stack the CMP gathers that include traces from this shot gather.
(h) Move to the next shot station and repeat steps (a) through (g).
(i) Repeat steps (a) through (h) for all receiver stations.
Steps (a) through (i) usually are applied iteratively to converge to a solution of shot and residual static shifts.

Traveltime Decomposition in Practice

As stated early in this section, residual statics estimation by traveltime decomposition consists of three stages: picking, decomposing, and applying residual static shifts. The picking phase, in which traveltime deviations are derived from trace erosscorrelations, determines the effectiveness of residual statics corrections. We now examine various parameters involved in the picking phase.
FIG. 3.3-19. CMP-stacked section associated with a synthetic data set. Shot and receiver statics were applied on moveout-corrected gathers in a surface-consistent manner, while the structure term was applied in a subsurfaceconsistent manner. These terms are plotted above the stacked section. Random noise whs added to prestack data with a spatially varying signal-to-noise ratio.

Maximum Allowable Shift

Consider the CMP-stacked section in Figure 3.3-19 associated with a synthetic data set. This data set was created by using the field geometry of a real seismic line. The CMP traces were derived from the first trace of the first CMP location from that real line. This trace first was zeroed out within selected time gates, then treated with the shot and receiver static shifts in Figure 3.3-19 in a surface-consistent manner and with a structure term that only depended on midpoint location (subsurface-consistent). The shot and receiver static shifts were varied from +32 to 32 m s 32 m s -32ms-32 \mathrm{~ms}32 ms. Finally, the synthetic traces were blended with a band-limited random noise, whcse strength varied spatially. (The noise level was set to zero at both ends of the profile and to maximum at the center.) The stacked section constructed from data before treatment with synthetic shot and receiver static shifts is shown in Figure 3.3-20. Once residual statics corrections are made, the stacked section in Figure 3.3-19 should resemble that in Figure 3.3-20.
FIG. 3.3-20. CMP-stacked section associated with the synthetic data set as in Figure 3.3-19, but without synthetic shot or receiver statics applied. Once residual statics correotions are applied to the data set associated with the stacked section in Figure 3.3-19, the resulting stacked section should resemble the section shown here.
Note how degrading the effect of the synthetic shot and receiver static shifts is on the continuity of reflections in Figure 3.3-19. The sole effect of random noise is seen in Figure 3.3-20.
Consider three different tests of residual statics corrections: one with a small maximum allowable shift (24 m s m s ms\mathrm{ms}ms in Figure 3.3-21), one with a moderately sized shift (80 m s m s ms\mathrm{ms}ms in Figure 3.3-22), and one with a fairly large shift (192 ms in Figure 3.3-23). All three tests had the same input CMP gathers. All three were run using the same set of parameters except for the maximum allow. able shift.
The maximum value of combined shot and receiver static shifts for any given trace implied by the model in Figure 3.3-19 is 64 m s 64 m s ∓64ms\mp 64 \mathrm{~ms}64 ms. When the maximum allowable shift is insufficient (a value of less than 64 m s 64 m s 64ms64 \mathrm{~ms}64 ms ), then the derived static shifts (Figure 3.3-21) are significantly smaller than the actual shifts (Figure 3.3-19). Thus, stack quality, although significantly improved when compared to that in Figure 3.3-19, is far from the quality of the section shown in Figure 3.3-20.
When the maximum allowable shift is sufficient, then the derived static shifts (Figure 3.3-22) are like the actual shifts imposed on the input model shown on the graph in Figure 3.3-19. Also, stacking quality (Figure 3.3-22) improved so that it now is comparable to the no-static model (Figure 3.3-20).
Reasonable results (Figure 3.3-23) also were obtained for the case allowing excessively large maximum allowable shift, up to 192 m s 192 m s 192ms192 \mathrm{~ms}192 ms. However, this result does not imply that we can be liberal on the upper bound
FIG. 3.3-21. CMP-stacked section associated with the synthetic data set as in Figure 3.3-19 with residual statics corrections. The derived shot, reociver, and structure terms are plotted at the top. Compare these estimates with the actual values in Figure 3.3-19. The maximum allowable shift is 24 ms. Also compare the resulting stacked section with that shown in Figure 3.3-20.
of maximum shift in real data situations. In the presence of short-period multiple or reverberation energy, or data with a narrow bandwidth or high noise level, crosscorrelation can yield a multiple number of peaks and cause uncertainty in the estimated time shifts (cycle skipping). In this case, a large maximum allowable shift could cause anomalously large time shifts to be picked.
Based on the tests shown in Figures 3.3-21 through 3.3-23, the maximum allowable shift used in the picking phase should be greater than all possible combined shot and receiver static shifts at any given location along the profile. On the other hand, jumping a leg in correlating events from trace to trace in a CMP gather, commonly known as cycle skip, especially in poor signal-to-noise ratio conditions, also is more likely to occur if the maximum allowable shift is greater than the dominant period of the data.
We may argue that the result of cascading a number of small-shift residual statics solutions is as good as a single-step large-shift solution. This approach might
FIG. 3.3-22. CMP-stacked section associated with the synthetic data set as in Figure 3.3-19 with residual statics corrections. The derived shot, reociver, and structure terms are plotted at the top. Compare these estimates with the actual values in Figure 3.3-19. The maximum allowable shift is 80 ms. Also compare the resulting stacked section with that shown in Figure 3.3-20.
have the same effectiveness as the large-shift solution, while avoiding the possibility of cycle skipping. Unfortunately, cascading small-shift solutions does not work. Starting with the CMP gathers associated with the stack in Figure 3.3-19, we get the CMP gathers corrected for shot and receiver statics based on a 24 -ms shift (first pass). The stack is shown in Figure 3.3-21. Using these gathers, a new statics solution was derived and applied to the data (second pass). This process was repeated for the third and fourth times. The result of this last iteration (Figure 3.3-24) does not have the quality of the solution derived with the 80 m s 80 m s 80-ms80-\mathrm{ms}80ms shift (Figure 3.3-22).
Now consider maximum allowable shift tests on the field data as in Figure 3.3-2. Figure 3.3-25 shows CMP gathers from the problem zone of the profile in Figure 3.3-5. Refer to the panels for 24 - and 40 m s 40 m s 40-ms40-\mathrm{ms}40ms shifts in Figure 3.3-25, and note that an insufficient maximum allowable shift does not completely correct for all static
FIG. 3.3-23. CMP-stacked section associated with the synthetic data set as in Figure 3.3-19 with residual statics corrections. The derived shot, receiver, and structure terms are plotted at the top. Compare these estimates with the actual values in Figure 3.3-19. The maximum allowable shift is 192 ms. Also compare the resulting stacked section with that shown in Figure 3.3-20.
FIG. 3.3-24. CMP-stacked section associated with the synthetic data set as in Figure 3.3-19 with residual statics corrections. The derived shot, receiver, and structure terms are plotted at the top. This is the output from the four iterstive passes of the statics estimation and application. Compare these estimates with the actual values in Figure 3.3-19. First-pass results are shown in Figure 3.3-21. The maximum allowable shift is 24 m s 24 m s 24ms24 \mathrm{~ms}24 ms on each pass. Also compare the resulting stacked section with that shown in Figure 3.3-20.
FIG. 3.3-25. Test of maximum allowable shift. CMP gathers after residual statics corrections using five different maximum allowable shifts. Figure 3.3-28 shows the CMP stacks.
FIG. 3.3-26. Diagnostics for maximum allowable shift tests (Figure 3.3-25) showing common-shot-point-stacked data.
FIG. 3.3-27. Diagnostics for maximum allowable shift tests (Figure 3.3-25) showing corrmon-receiver-point-stacked data.

245 197 149 101 53 245 197 149 101 53 {:[245,197,149,101,53]:}\begin{array}{lllll}245 & 197 & 149 & 101 & 53\end{array}24519714910153 CMP

1 ind Stack with No Corrections

= 0 = 0 =0=0=0

Maximum Shift = 24 m s = 24 m s =24ms=24 \mathrm{~ms}=24 ms tieterite 24
m = 1 m = 1 m=1m=1m=1
120 m s m 120 m s m 120msm120 \mathrm{~ms} m120 msm
FIG. 3.3-28. Test of maximum allowable shift: CMP stacks after residual statics corrections using five different maximum allowable shifts. Figure 3.3-25 shows selected CMP gathers.
FIG. 3.3-29. Test of correlation window: CMP gathers after residual statice corrections using five different correlation windows. Figure 3.3-32 shows the CMP stacks.

CSP Stack with No Corrections,

Optimum Window = 800 2300 m s = 800 2300 m s =800-2300ms=800-2300 \mathrm{~ms}=8002300 ms

FIG. 3.3-30. Dragnostics for correlation window tests (Figure 3.3-29) showing common-shot-point-stacked data.
FIG. 3.3-31. Diagnostics for correlation window tests (Figure 3 3-29) showing common-receiver-point-stacked data.

245 197 149 101 53 245 197 149 101 53 245quad197quad149quad101quad53 larr245 \quad 197 \quad 149 \quad 101 \quad 53 \leftarrow24519714910153 CMP

Stack with No Corrections Etities Optlmum Window = 800 2300 m s = 800 2300 m s =800-2300ms=800-2300 \mathrm{~ms}=8002300 ms
FIG. 3.3-32. Test of correlation window: CMP stacks after residual statics corrections using five different correlation windows. CMP gathers are shown in Figure 3.3-29.
FIG. 3.3-33. Test of correlation window: CMP gathers after residual statics corrections using five different correlation windows. CMP stacks are shown in Figure 3.3-36.
FIG. 3.3-34. Dlagnostics for correlation window tests (Figure 3.3-33) showing common-shot-point-stacked data.
Window = 400 1200 m s = 400 1200 m s =400-1200ms=400-1200 \mathrm{~ms}=4001200 ms
FIG. 3.3-35. Diagnostics for correlation window tests (Figure 3.3-33) showing common-receiver-point-stacked data.
FIG. 3.3-36. Test of correlation window: CMP stacks after residual statics corrections using five different correlation windows. CMP gathers are shown in Figure 3.3-33.
FIG. 3.3-37. Pilot traces (bottom) and shot and receiver statics solutions (top) for the 80-ms shift and the 400- to 1200-ms window. CMP stack is shown in Figure 3.3-36.
shifts. Excessively large shifts, however, such as 120 - or 160 -ms, do not seem to harm this particular data set. While common-shot-point (CSP) stacks (Figure 3.3-26) indicate small shot-static shifts, common-receiver-point (CRP) stacks (Figure 3.3-27) indicate a zone of significant reotiver-static shifts. Again, small maximum allowable shifts have not corrected completely for these statics anomalies.
The ultimate judgment is made by examining the stack response and plots of the estimated statics themselves. From Figure 3.3-28 (ungained stack responses), it is clear that the maximum allowable shift must be adequate to accommodate the combined shot and receiver statics present in the data at any location along the profile.

Correlation Window

From the same field data example (Figure 3.3-5), the results of residual statics corrections (for the right half of the stacked section) are examined by using different correlation windows while keeping all other parameters constant. The maximum allowable shift was 80 m s 80 m s 80ms80 \mathrm{~ms}80 ms in these tests. From Figure 3.3-29, note that a correlation window confined to the mute zone ( 400 to 1200 m s 1200 m s 1200ms1200 \mathrm{~ms}1200 ms ) is not desirable. It does not provide sufficient statistics because of the low fold of coverage and the shortness of the data window available for crosscorrelation with the pilot traces.
With high-fold data, the mute zone problem is handled to a degree by limiting the correlation to small
FIG. 3.3-38. CMP-stacked section associated with the synthetic data set as in Figure 3.3-19. In addition to the surfaceconsistent shot and receiver statics and the subsurfaceconsistent structure term, residual moveout shifts were introduced to the CMP gathers used in Figure 3.3-19.
offsets. In this particular part of the profile, a large window including both the mute zone and deep data ( 800 to 2300 m s 2300 m s 2300ms2300 \mathrm{~ms}2300 ms ), a deep window ( 1700 to 2300 m s 2300 m s 2300ms2300 \mathrm{~ms}2300 ms ), a deep large window ( 1400 to 2800 m s 2800 m s 2800ms2800 \mathrm{~ms}2800 ms ), or a deep narrow window (1500 to 1700 m s 1700 m s 1700ms1700 \mathrm{~ms}1700 ms ) made no difference. This is probably because of the good signal-to-noise ratio in this part of the profile.
These observations are verified by the diagnostics based on the CSP and CRP stacks in Figures 3.3-30 and 3.3-31. Ungained stack responses are shown in Figure 3.3-32. In particular, note the relatively poor stack response using a window confined to the mute zone (4nn) to 1200 m s 1200 m s 1200ms1200 \mathrm{~ms}1200 ms ).
The choice of the correlation window is more critical in conditions of poor signal-to-noise ratio. Refer to the same diagnostics for the left half of the stacked section in Figure 3.3-5. These diagnostics are shown in Figures 3.3-33 through 3.3-36. Again, a correlation window confined to the mute zone not only provides an inadequate solution, as in the previous case (Figure 3.3-29), but also can be devastating, as shown in Figure 3.3-33. In this case, the CMP gathers with no corrections have better signal quality. It now is apparent that a narrow window, even if it is outside the mute zone (such as
FIG. 3.3-39. CMP-stacked section associated with the synthetic data set as in Figure 3.3-38 after the application of residual statics corrections. Compare the results with those in Figure 3.3-22.
the 1500 to 1700 m s 1700 m s 1700ms1700 \mathrm{~ms}1700 ms window), may not provide suffcient statistics. The CSP stacks (Figure 3.3-34) and the CRP stacks (Figure 3.3-35) show the undesirable aspects of choosing a window within the mute zone or choosing a window that is too narrow. The ungained stacked sections (Figure 3.3-36) clearly demonstrate the adverse effects of an improper choice of correlation window. Moreover, note the poor quality pilot traces for each CMP gather in Figure 3.3-37 (to the left of midpoint 377). The shot and receiver static solutions shown in the graphs above the pilot traces are totally unreliable.
These test results suggest choosing a correlation window that (a) contains as much signal as possible to improve correlation values, and (b) is large enough and is outside the mute zone whenever possible.

Other Considerations

The synthetic data set in Figure 3.3-38 is the same as that in Figure 3.3-19, with the addition of residual
(a)
(b)
FIG. 3.3-40. First portion of a land line illustrating the improvement in CMP stacking as a result of residual statics corrections. Stack A A AAA (a) before residual statios corrections and using preliminary velocity picks and (b) after two passes of residual statics corrections and using final velocity picks.
(a)
(b)
FIG. 3.3-41. Second portion of the land line shown in Figure 3.3-40 illustrating the improvement in CMP stacking as a result of residual statics corrections. Stack B B BBB (a) before residual statics corrections and using preliminary velocity picks and (b) after two passes of residual statics corrections and using final velocity picks.
FIG. 3.3-42. Diagnostics for segment A A AAA from the residual statics corrections applied on the first portion of the land line in Figure 3 3-40.
moveout shifts. Residual moveout was introduced into the data by inverse NMO correcting the CMP gathers associated with the stack in Figure 3.3-19 using a velocity function v 1 ( t ) v 1 ( t ) v_(1)(t)v_{1}(t)v1(t), then by NMO correcting using a velocity function v 2 ( t ) v 1 ( t ) v 2 ( t ) v 1 ( t ) v_(2)(t)!=v_(1)(t)v_{2}(t) \neq v_{1}(t)v2(t)v1(t). The solution (Figure 3.3-39) implies some traveltime distortion at the edges of the stacked section caused by low fold of coverage. (Compare this with the solution in Figure 3.3-22). Otherwise, stack response seems to be satisfactory. As long as the residual moveout variations are not large within the correlation window, the computed residual statics solution should be adequate. Use of more than one small correlation window during the picking phase may help minimize the time-dependent effect of residual moveout.
In some areas, the signal-to-noise ratio is so poor that a second pass of residual statics corrections must be done. The idea is that the first pass of residual statics corrections improves the signal to such a degree that a second pass should remove the residuals remaining from the first pass. For the second pass, the steps in Figure 3.3-12 must be repeated, such that the input are CMP gathers that already were corrected for residual statics. Velocity estimates must be revised between passes. Figures 3.3-40 and 3.3-41 show two different segments of a section before and after residual statics corrections that were done in two passes. Diagnostic plots of the shot and receiver statics shown in Figures 3.3-42 and 3.3-43 indicate that the first pass has taken out a significant part of the static shifts in the first segment. On
Recaiver Statica (FIrst Pasa)
Shot Statics (Second Pater)
Recalver Statles (Second Pasa)
FIG. 3.3-43. Diagnostics for segment B B BBB from the residual statics corrections applied on the second portion of the land profile in Figure 3.3-41.
the other hand, the second pass was most effective in the second segment, where the signal-to-noise ratio is relatively poorer. Repeated estimation and application of the residual statics and velocity estimation is common in some processing systems. Use of a large number of trace correlations and multiple correlation peaks in a statics program tends to minimize the number of passes required.

Stack-Power Maximization in Practice

The method of stack-power maximization can yield better stack compared to the method of traveltime decomposition in areas with poor signal-to-noise ratio. Figure 3.3-44 shows a CMP-stacked section along a land profile with field statics corrections applied (Figure 3.3-45). While the left-half of the section has a good signal-tonoise ratio, the right-half has a poor signal-to-noise ratio resulting from irregular topography and near-surface complexity (Figure 3.3-45). Note, for instance, the loss of continuity along the reflection events at 0.8 and 1.3 s s sss at the right-half of the section.
Selected CMP gathers shown in Figure 3.3-46 verify the presence of short-wavelength statics. Following residual statics corrections by stack-power maximization and the subsequent velocity analysis, the same
FIG. 3.3-45. The elevation profile (top), and the shot (middle) and receiver (bottom) field statics profiles for the stacked section shown in Figure 3.3-44.

FIG. 3.3-48. Shot (top) and receiver (bottom) residue] static shifts computed by stack-power maxmization. The resuiting CMP-stacked section is shown in Figure 3 3-47.
gathers indicate that short-wavelength statics have been targely resolved (Figure 3.3 46 3.3 46 3.3-463.3-463.346 ), and thus, the resulting CMP stack shows significant improvement in the continuity of reflections in the right-hand side (Figure 3.3-47). The shot and receiver residual static shifts derived by using the supertrace scheme described above are shown in Figure 3.3-48. Note that mainly large residuals are in the right-half of the profile with irregular topography.

3.4 REFRACTION STATICS CORRECTIONS

An important question in estimating shot and receiver statics is accuracy of the results as a function of wavelengths of static anomalies. Figure 3.4 1 3.4 1 3.4-13.4-13.41 is a synthetic data set that is identical to that in Figure 3.3-19, except for additional long-wavelength shot and receiver static components. (Compare the graphic displays in
Figures 3.3-19 and 3.4-1.) From the solution in Figure 3.4-2, note that the long-wavelength components of the statics were severely underestimated. A significant difference between the stacked sections, in terms of horizon times, is apparent in Figures 3.3-22 and 3.4-2.
The surface-consistent solution discussed in Section 3.3 resolves the short-wavelength static shifts (less than a spread length), which cause traveltime distortions in CMP gathers, and thus yield an improved stack response. However, merely improving the stack response by correcting for short-wavelength statics may not always be sufficient. The unresolved long-wavelength components are assigned to the structure term in equation (3-25). If the long-wavelength components are large, refector geometries inferred by the CMP stack can be distorted significantly. Field statics and refraction statics methods are used to correct for the longwavelength components.
The statics corrections require knowledge of the near-surface model. The near-surface often consists of
FIG. 3.4-1. CMP-stached section associated with the synthetic data set as in Figure 3.3-19 contaminated with longperiod statics.
a low-velocity weathering layer. However, there are exceptions to this simplified model for the near-surface. Areas covered with glacial tills, volcanic stringers, and sand dunes often have a near-surface that may consist of more than one leyer with different velocities. Layer boundaries can vary significantly from a flat interface to an arbitrarily irregular shape. The single-layer assumption for the near-surface also is violated when there is a lateral change in rock composition associated with outcrops, pinchouts or a flood plain along a seismic profile. In areas covered with a permafrost layer, which has a significantly higher velocity than the underlying layer, the surface-consistency assumption for the near-surface corrections is not valid. Moreover, the base of the permafrost layer does not form a head wave and therefore is not detectable.
In practice, a single-layer near-surface model often is sufficient for resolving long-wavelength statics anomalies. Complexities in a single-layer near-surface model can be due to one or more of the following:
(a) Rapid variations in shot and receiver station elevations,
(b) Lateral variations in weathering velocity, and
FIG. 3.4-2. CMP-stacked section associated with the synthetic data set as in Figure 3.4-1 after the application of residual statics corrections. Compare the results with those in Figure 3.3-22.
(c) Lateral variations in the geometry of the refractor, which, for refraction statics, is defined as the interface between the weathering layer above and the bedrock below.
Near-surface velocity-depth models often are estimated using refracted arrivals. The refracted energy is associated with the head wave that travels along the interface between the near-surface weathering layer and the underlying bedrock. If refracted arrivals are observable on common-shot gathers, it almost certainly implies that the near-surface has a simple geometry. Nevertheless, no ray-theoretical method can claim to estimate short-wavelength variations in the base of weathering that are much smaller than a cable length. These variations are left to be handled by subsequent residual statics corrections using traveltime distortions associated with reflections on moveout-corrected commonmidpoint (CMP) gathers (Taner et al., 1974).
The head wave is distorted in the presence of irregularities along the base of the weathering layer, and it turns into a diving wave when there is no sharp velocity contrast between the weathering layer and the
FIG. 3.4-3. A shot record with distinct first breaks.
FIG. 3.4-4. A shot record with a distinct refraction event.
FIG. 3,4-5. A shot record with a shallow and deep refractíon event.
FIG. 3.4-6. A shot record with noise-contaminated first breaks.
FIG. 3.4-7. A shot record with a distinct refraction event along the right-hand spread.
FIG. 3.4-8. A vibrosels shot record with not-so-distunct first breaks.
FIG. 3,4-9. A shot record in which the onset of the first arrivals is not clear.
substratum (Hill and Wuenschel, 1985). Such cases, if at all possible, may be handled by wave-theoretical modeling and inversion (Hill, 1987) or turning-wave tomography (Section 9.5 ).

First Breaks

The refracted energy associated with the base of the weathering layer often constitutes the first arrivals on a shot gather. The onset of these first arrivals is referred to as the first break.
First breaks occur in varying degrees of quality depending on the source type and the near-surface conditions. The common-shot gather shown in Figure 3.43 has first breaks with clear onset. Deviations from the linear trend of the first-break times may largely be attributed to elevation differences along the shot profile.
FIG. 3.4-10. A near-surface model for statics corrections when shots are situated below the weathering layer. Here, S S SSS = = === shot, E S = E S = E_(S)=E_{S}=ES= elevation at the shot station on the ground, R = R = R=R=R= receiver, E R = E R = E_(R)=E_{R}=ER= elevation at the receiver station on the ground, T = T = T=T=T= surface topography, B = B = B=B=B= base of weathering, D D DDD = = === datum, E D = E D = E_(D)=E_{D}=ED= datum elevation, v w = v w = v_(w)=v_{w}=vw= weathering velocity, and v b = v b = v_(b)=v_{b}=vb= bedrock velocity.
Figure 3.4-4 shows a record with first breaks associated with a prominent refractor. In Figure 3.4-5, note a shallow and a deep refractor. Figure 3.4-6 shows a shot record in which automated procedures would largely fail to pick the first breaks. Figure 3.4-7 shows a shot record with first breaks that can be detected easily by automated procedures. From the first breaks on the left, one can infer near-surface irregularity either in the form of a variable refractor shape or velocity variations in the near-surface layer. The right-hand side shows the presence of a distinct refractor. Figure 3.4-8 shows a shot gather recorded with a vibroseis source, which often produces poor first breaks compared to a dynamite source. A similar situation exists in the record shown in Figure 3.4-9 it is not simple to detect the first breaks. The remainder of the sidelobes from sweep correlation masks the onset of the first arrivals.
First-break picking can be done automatically, interactively, manually, or as a combination thereof. To make reliable picks, first apply linear moveout (LMO) to the data. Once picking is done, the LMO correction is reversed. Note that effectiveness of both reflection- and refraction-based methods of statics corrections depends on the reliability of the picking process. Apart from the signal-to-noise ratio, indistinct first breaks (such as in vibroseis) sometimes can make picking consistent first breaks difficult.
The first-break picks associated with the refracted arrival times are then used in an inversion scheme to estimate the near-surface model parameters. In this section, we discuss ray-theoretical methods such as plusminus and its generalized form, the reciprocal method, and the least-squares inversion methods. The basic assumption made is that the refractor is flat or nearly
flat, with a smoothly varying shape along the seismic profile. As demonstrated by the field data examples, these methods appear to remove medium- to long-wavelength statics anomalies associated with various types of near-surface models. Combined with the reflection-based residual statics corrections to resolve any remaining short-wavelength statics variations that affect the stack quality, we get a final stacked section ready for poststack processing.

Field Statics Corrections

It is appropriate now to review various methods of field statics corrections. Consider the near-surface model depicted in Figure 3.4-10. If shots (denoted by S S SSS ) are located below the weathering layer, then the total static correction to apply to the trace associated with midpoint M M MMM is t D = t S + t R t D = t S + t R t_(D)=t_(S)+t_(R)t_{D}=t_{S}+t_{R}tD=tS+tR, where t S t S t_(S)t_{S}tS and t R t R t_(R)t_{R}tR are the shot and receiver static corrections, respectively, down to a specified datum D D DDD. From the geometry of Figure 3.4-10, the field statics correction Δ τ D Δ τ D Deltatau_(D)\Delta \tau_{D}ΔτD can be computed by
Δ T D = E S E D D S v b E R E D D R v b t U H Δ T D = E S E D D S v b E R E D D R v b t U H Delta_(TD)=-(E_(S)-E_(D)-D_(S))/(v_(b))-(E_(R)-E_(D)-D_(R))/(v_(b))-t_(UH)\Delta_{T D}=-\frac{E_{S}-E_{D}-D_{S}}{v_{b}}-\frac{E_{R}-E_{D}-D_{R}}{v_{b}}-t_{U H}ΔTD=ESEDDSvbEREDDRvbtUH
where E D E D E_(D)E_{D}ED is the datum elevation and E S E S E_(S)E_{S}ES and E R E R E_(R)E_{R}ER are the surface elevations at the shot and receiver stations, respectively, D S D S D_(S)D_{S}DS is the depth of the shot hole beneath the shot station, and D R D R D_(R)D_{R}DR is the depth of the shot hole near the receiver station, t U H t U H t_(UH)t_{U H}tUH is the uphole time measured at the receiver location (the time associated with the distance D R D R D_(R)D_{R}DR in Figure 3.4-3). Finally, v b v b v_(b)v_{b}vb is the bedrock (subweathering) velocity that may be derived from a deep uphole survey (to a point well below the weathering layer) conducted in the area.
An uphole survey involves placing shots down the hole at various depth levels, then recording the arrivals at the surface near the hole. Alternatively, shots and receivers can be reciprocated if there is a caving problem down the hole. The hole must be deep enough to reach below the weathering layer. This provides a plot of time versus depth from which the bedrock velocity is obtained.
In land surveys, shots are not always placed in the bedrock for economic reasons, especially in areas with a thick weathering layer. Also, impulsive sources are not always used. Instead, surface sources such as vibroseis often are used. When surface sources or sources in shallow holes are used, the refracted arrivals can, at least in theory, be used to compute the static correction Δ τ D Δ τ D Deltatau_(D)\Delta \tau_{D}ΔτD down to a specified datum.

Flat Refractor

Consider the refraction wavefront and raypath geometry in Figure 3.4-11a associated with a single-layer nearsurface model. On top, we see a plot of first-breaks. For simplicity, consider a flat surface and tat refractor. For the head wave to form, and thus the refraction to occur, the requirement is that the overburden velocity ν w ν w nu_(w)\nu_{w}νw be smaller than the substratum velocity w b w b w_(b)w_{b}wb.
The traveltime profile depicts the first breaks seen on the shot record in Figure 3.4-11b. Note that to the left of the crossover offset x c x c x_(c)x_{c}xc (glso known as critical distance) are the first breaks associated with the the direct arrivals. Also note that to the right of offset x c x c x_(c)x_{c}xc are the first breaks associated with the refracted arrivals. From the refraction theory (Dobrin, 1960; Grant and West, 1965), the inverse of the slope of the line associated with the refracted wave arrivals is equal to the bedrock velocity v b v b v_(b)v_{b}vb. Also note that the inverse of the slope of the line associated with the direct wave arrivals is equal to the velocity of the weathering layer v w v w v_(w)v_{w}vw.
By picking the first breaks, the weathering and bedrock velocities, v w v w v_(w)v_{w}vw and v b v b v_(b)v_{b}vb are estimated. By extending the line associated with the refracted arrivals to zero-offset, intercept time t 3 t 3 t_(3)t_{3}t3, the time at x = 0 x = 0 x=0x=0x=0, is estimated. From these three parameters, it is easy to show that depth to the bedrock z w z w z_(w)z_{w}zw is given by
z w = v b v w t 2 2 v b 2 v w 2 z w = v b v w t 2 2 v b 2 v w 2 z_(w)=(v_(b)v_(w)t_(2))/(2sqrt(v_(b)^(2)-v_(w)^(2)))z_{w}=\frac{v_{b} v_{w} t_{2}}{2 \sqrt{v_{b}^{2}-v_{w}^{2}}}zw=vbvwt22vb2vw2
We assume that v b > v w v b > v w v_(b) > v_(w)v_{b}>v_{w}vb>vw. Derivation of this formula is left to Section C.5.
Alternatively, we can measure the critical distance corresponding to the change from the direct arrival to the refracted arrival on the traveltime plot and use it in computing the depth to the bedrock. Equation (3-41a), in terms of the critical distance x c x c x_(c)x_{c}xc, takes the form
z w = 1 2 v b v w v b + v w x c z w = 1 2 v b v w v b + v w x c z_(w)=(1)/(2)sqrt((v_(b)-v_(w))/(v_(b)+v_(w)))x_(c)z_{w}=\frac{1}{2} \sqrt{\frac{v_{b}-v_{w}}{v_{b}+v_{w}}} x_{c}zw=12vbvwvb+vwxc
It may not be easy to measure the critical distance when depth to bedrock is small. In such cases, it is better to use the intercept time to compute the depth to the bedrock by way of equation (3-41a).
After computing z w z w z_(w)z_{w}zw, the total static correction Δ τ D Δ τ D Deltatau_(D)\Delta \tau_{D}ΔτD to the specified datum level can be applied by
Δ τ D = 2 z w v w + 2 ( E D E S + z w ) v b Δ τ D = 2 z w v w + 2 E D E S + z w v b Deltatau_(D)=-(2z_(w))/(v_(w))+(2(E_(D)-E_(S)+z_(w)))/(v_(b))\Delta \tau_{D}=-\frac{2 z_{w}}{v_{w}}+\frac{2\left(E_{D}-E_{S}+z_{w}\right)}{v_{b}}ΔτD=2zwvw+2(EDES+zw)vb
where E S E S E_(S)E_{S}ES is the surface elevation. If there is a difference between the elevations of shot and receiver stations,
b
d
FIG. 3.4-11. (a) Geometry for refracted arrivals. Here, v w = v w = v_(w)=v_{w}=vw= weathering velocity, v b = v b = v_(b)=v_{b}=vb= bedrock velocity, z w = z w = z_(w)=z_{w}=zw= depth to the refractor equivalent to the base of the weathering layer, θ c = θ c = theta_(c)=\theta_{c}=θc= critical angle, and x c = x c = x_(c)=x_{c}=xc= crossover distance. The direct wave arrival has a slope equal to 1 / v w 1 / v w 1//v_(w)1 / v_{w}1/vw and the refracted wave arrival has a slope equal to 1 / v b 1 / v b 1//v_(b)1 / v_{b}1/vb. (b) A shot record that exhibits the direct wave and the refracted wave depicted in (a). (c) Geometry for a dipping refractor with forward traveltime profile associated with the direct wave and refracted wave arrivals, and (d) with both forward and reverse traveltime profiles. See text for details.
then an additional elevation correction using the bedrock velocity is required. Moreover, if the shots are located in boreholes, then the measured uphole time also rust be incorporated into equation (3-42). The estimated statics correction given by equation (3-42) is an average value over a distance that can range from the critical distance to the spread length, depending on the number of traces used in estimating the bedrock velocity. Nevertheless, more than one shot-point is within a sprear length. Therefore, an adequate definition of the near-surface model can be achieved and datum corrections can be computed for the entire profile.

Dipping Refractor

When the refractot is dipping, it turns out that the inverse slope of the refracted arrival is no longer equal to the bedrock velocity (Figure 3.4-11c). An extra parameter - the dip of the refractor, needs to be estimated (Section C.6). This requires reverse profiling as illustrated in Figure 3.4-11d. We have the refracted arrival in the forward direction and the refracted arrival in the reverse direction obtained by interchanging the shots with receivers. The traveltimes for the refracted arrivals of the forward and reverse profiles are expressed as
t = t t + x v b t = t t + x v b t^(-)=t_(t)^(-)+(x)/(v_(b)^(-))t^{-}=t_{t}^{-}+\frac{x}{v_{b}^{-}}t=tt+xvb
and
t + = t a + + x v b + t + = t a + + x v b + t^(+)=t_(a)^(+)+(x)/(v_(b)^(+))t^{+}=t_{a}^{+}+\frac{x}{v_{b}^{+}}t+=ta++xvb+
The inverse slopes are given by
v b = v w sin ( θ c + φ ) v b = v w sin θ c + φ v_(b)^(-)=(v_(w))/(sin(theta_(c)+varphi))v_{b}^{-}=\frac{v_{w}}{\sin \left(\theta_{c}+\varphi\right)}vb=vwsin(θc+φ)
and
v b + = v w sin ( θ c φ ) v b + = v w sin θ c φ v_(b)^(+)=(v_(w))/(sin(theta_(c)-varphi))v_{b}^{+}=\frac{v_{w}}{\sin \left(\theta_{c}-\varphi\right)}vb+=vwsin(θcφ)
where φ φ varphi\varphiφ is the refractor dip and θ c θ c theta_(c)\theta_{c}θc is the critical angle of refraction given by
sin θ c = v u v b sin θ c = v u v b sin theta_(c)=(v_(u))/(v_(b))\sin \theta_{c}=\frac{v_{u}}{v_{b}}sinθc=vuvb
Finally, the intercept times are given by the following relations:
t i = 2 z w S cos θ c cos φ v w t i = 2 z w S cos θ c cos φ v w t_(i)^(-)=(2z_(wS)cos theta_(c)cos varphi)/(v_(w))t_{i}^{-}=\frac{2 z_{w S} \cos \theta_{c} \cos \varphi}{v_{w}}ti=2zwScosθccosφvw
and
t ı + = 2 z w R cos θ c cos φ v w t ı + = 2 z w R cos θ c cos φ v w t_(ı)^(+)=(2z_(wR)cos theta_(c)cos varphi)/(v_(w))t_{\imath}^{+}=\frac{2 z_{w R} \cos \theta_{\mathrm{c}} \cos \varphi}{v_{w}}tı+=2zwRcosθccosφvw
Derivation of the relations ( 3 44 a , b ) ( 3 44 a , b ) (3-44a,b)(3-44 \mathrm{a}, \mathrm{b})(344a,b) and ( 3 45 a , b ) ( 3 45 a , b ) (3-45a,b)(3-45 \mathrm{a}, \mathrm{b})(345a,b) are left to Section C.6.
To estimate the thickness of the near-surface layer, first we compute the refractor dip φ φ varphi\varphiφ from the slope measurements v w , v b v w , v b -v_(w),v_(b)^(-)-v_{w}, v_{b}^{-}vw,vb, and v b + v b + v_(b)^(+)v_{b}^{+}vb+. These measurconts are then inserted into the expression
φ = 1 2 [ sin 1 v w v b sin 1 v w v b + ] φ = 1 2 sin 1 v w v b sin 1 v w v b + varphi=(1)/(2)[sin^(-1)(v_(w))/(v_(b)^(-))-sin^(-1)(v_(w))/(v_(b)^(+))]\varphi=\frac{1}{2}\left[\sin ^{-1} \frac{v_{w}}{v_{b}^{-}}-\sin ^{-1} \frac{v_{w}}{v_{b}^{+}}\right]φ=12[sin1vwvbsin1vwvb+]
Then, we compute the bedrock velocity v b v b v_(b)v_{b}vb using the expression
v b = 2 cos φ ( 1 v b + 1 v b + ) v b = 2 cos φ 1 v b + 1 v b + v_(b)=(2cos varphi)/(((1)/(v_(b)^(-))+(1)/(v_(b)^(+))))v_{b}=\frac{2 \cos \varphi}{\left(\frac{1}{v_{b}^{-}}+\frac{1}{v_{b}^{+}}\right)}vb=2cosφ(1vb+1vb+)
Finally, we compute the depth to the bedrock at shot/receiver stations
z w = v b v u t t 2 cos φ v b 2 v w 2 z w = v b v u t t 2 cos φ v b 2 v w 2 z_(w)=(v_(b)v_(u)t_(t)^(-))/(2cos varphisqrt(v_(b)^(2)-v_(w)^(2)))z_{w}=\frac{v_{b} v_{u} t_{t}^{-}}{2 \cos \varphi \sqrt{v_{b}^{2}-v_{w}^{2}}}zw=vbvutt2cosφvb2vw2
Again, equations ( 346 a , b , c 346 a , b , c 346 a,b,c346 a, b, c346a,b,c ) are derived in Section C.6. By setting the refractor dip φ = 0 φ = 0 varphi=0\varphi=0φ=0, equation (3-46c) reduces to equation (3-41a).
Keep in mind that, whether it is the flat refractor (equation 3-41a) or dipping refractor case (equation 346c), the depth to bedrock estimation at a shot-receiver station requires the knowledge of weathering velocity, bedrock velocity and intercept time. In the case of a flat refractor, these can be measured directly from shot profiles; whereas, in the case of a dipping refractor, they can be computed by way of equations (3-46a.b,c).

The Plus-Minus Method

It often is difficult to usc first breaks to estimate the intercept time and velocitics for the weathering layer and bedrock. This is prinarily because the base of weathering typically is an undulating surface, which makes traveltime plots difficult to interpret. Traveltime plots also are affected by severe elevation changes. Additionally, a typical field cable layout does not provide a sufficient number of channeis inside the crossover distance x c x c x_(c)x_{c}xc (Figure 3.4-11a) for a reliable estimate of the weathering velocity or thickness. In most cases, v w v w v_(w)v_{w}vw cannot be measured and a reasonable value is assumed for it.
Hagedoorn (1959) formulated a method to indirectly estimate intercept time and bedrock velocity. The method still requires picking the first breaks. However, it does not require interpreting the traveltime profile (Figure 3.4-11a). (Interpretation means drawing the linear segments for the direct and refracted waves.) Fig12re 3.4-12a shows three raypaths associated with shotreceiver pairs A D , D G A D , D G AD,DGA D, D GAD,DG, and A G A G AGA GAG. The basis of Hagedoorn's method involves computing two time values, the
FIG. 3.4-12. (a) Geometry for the plus-minus mothod, (b) Geometry for the generalized reciprocal method. Here, z w z w z_(w)z_{w}zw is the depth to the refractor at the surface station where the plus-minus times as for (a) and intercept times as for (b) are to be estimated, v w v w v_(w)v_{w}vw is the weathering velocity, and θ c θ c theta_(c)\theta_{c}θc is the critical angle of refraction.
plus and minus times given by
t + = t A B C D + t D E F G t A B F G ( 3 47 a ) t + = t A B C D + t D E F G t A B F G ( 3 47 a ) t_(+)=t_(ABCD)+t_(DEFG)-t_(ABFG)quad(3-47 a)t_{+}=t_{A B C D}+t_{D E F G}-t_{A B F G} \quad(3-47 a)t+=tABCD+tDEFGtABFG(347a)
and
t = t A B C D t D E F G + t A B F G . ( 3 47 b ) t = t A B C D t D E F G + t A B F G . ( 3 47 b ) t_(-)=t_(ABCD)-t_(DEFG)+t_(ABFG).quad(3-47 b)t_{-}=t_{A B C D}-t_{D E F G}+t_{A B F G} . \quad(3-47 b)t=tABCDtDEFG+tABFG.(347b)
The times given on the right side of these equations are the measured (picked) values from the first breaks for the three raypaths shown in Figure 3.4-12a. From the raypath configuration, we find that (Section C.7)
t + = 2 z w v b 2 v w 2 v b v w t + = 2 z w v b 2 v w 2 v b v w t_(+)=(2z_(w)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(b)v_(w))t_{+}=\frac{2 z_{w} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{b} v_{w}}t+=2zwvb2vw2vbvw
Rewrite equation (3-41a)
t 1 = 2 z w v b 2 v w 2 v b v w t 1 = 2 z w v b 2 v w 2 v b v w t_(1)=(2z_(w)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(b)v_(w))t_{1}=\frac{2 z_{w} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{b} v_{w}}t1=2zwvb2vw2vbvw
and note that the plus time t + t + t_(+)t_{+}t+in equation (3-48a) is identical to the intercept time t 1 t 1 t_(1)t_{1}t1 in equation (3-48b). Hence, instead of measuring t 1 t 1 t_(1)t_{1}t1 directly from the shot record, Hagedoorn's method suggests estimating t 2 t 2 t_(2)t_{2}t2 from the first break picks given by the right-hand terms in equation ( 3 47 a ) ( 3 47 a ) (3-47a)(3-47 \mathrm{a})(347a).
By applying algebra (Scetion C.7), we find that minus time t t t_(-)t_{-}tis rolated to bedrock velocity v b v b v_(b)v_{b}vb by
t = t + + 2 x v b t = t + + 2 x v b t_(-)=t_(+)+(2x)/(v_(b))t_{-}=t_{+}+\frac{2 x}{v_{b}}t=t++2xvb
where x x xxx is the source-receiver separation A D A D ADA DAD.
Thus, Hagedoorn's plus-menus method involves:
(a) Picking the first breaks,
(b) Computing the plus-minus times, t t t_(-)t_{-}tand t + t + t_(+)t_{+}t+(equations 3 47 a 3 47 a 3-47a3-47 \mathrm{a}347a and 3 47 b 3 47 b 3-47b3-47 \mathrm{~b}347 b ),
(c) Deriving from the plus-minus times the intercept time t 3 t 3 t_(3)t_{3}t3 (equations 3-48a and 3-48b) and bedrock velocity v b v b v_(b)v_{b}vb (equation 3 48 c 3 48 c 3-48c3-48 \mathrm{c}348c ),
(d) Assuming a value for weathering velocity v w v w v_(w)v_{\boldsymbol{w}}vw,
(e) Computing the depth z D z D z_(D)z_{D}zD to bedrock below station D D DDD (Figure 3.4-12a) from equation (3-41a), and
(f) Computing the shot-receiver static shift Δ τ D Δ τ D Deltatau_(D)\Delta \tau_{D}ΔτD at that station by
Δ D = z D v w + E D E S + z D v b Δ D = z D v w + E D E S + z D v b Delta_(D)=-(z_(D))/(v_(w))+(E_(D)-E_(S)+z_(D))/(v_(b))\Delta_{D}=-\frac{z_{D}}{v_{w}}+\frac{E_{D}-E_{S}+z_{D}}{v_{b}}ΔD=zDvw+EDES+zDvb
where E S E S E_(S)E_{S}ES and E D E D E_(D)E_{D}ED are the surface and datum elevations at station D D DDD (Figure 3.4-12a). If there is a shot at station D , Δ τ D D , Δ τ D D,Deltatau_(D)D, \Delta \tau_{D}D,ΔτD represents the shot static, and if there is a receiver at station D D DDD, it represents the receiver static. Again, uphole and elevation corrections are needed before making the plus-minus statics corrections.

The Generalized Reciprocal Method

In practice, raypaths that are suitable for first-break picking and are coincident at station D D DDD are not always found. Palmer (1981) generalized Hagedoorn's method of using raypaths (Figure 3.4-12b). Palmer's technique, the generalized reciprocal method (GRM), takes into account offset separation D 1 D 2 D 1 D 2 D_(1)D_(2)D_{1} D_{2}D1D2 when computing the plus time
t + = t A B C D 2 + t D 1 E F G t A B F G D 1 D 2 v b ( 3 50 a ) t + = t A B C D 2 + t D 1 E F G t A B F G D 1 D 2 v b ( 3 50 a ) t_(+)=t_(ABCD_(2))+t_(D_(1)EFG)-t_(ABFG)-(D_(1)D_(2))/(v_(b))*(3-50 a)t_{+}=t_{A B C D_{2}}+t_{D_{1} E F G}-t_{A B F G}-\frac{D_{1} D_{2}}{v_{b}} \cdot(3-50 a)t+=tABCD2+tD1EFGtABFGD1D2vb(350a)
The definition of the minus time remains the same as in equation (3-47b), except for accounting for the raypath geometry in Figure (3.4-12b):
t = t A B C D 2 t D 1 E F G + t A B F G t = t A B C D 2 t D 1 E F G + t A B F G t_(-)=t_(ABCD_(2))-t_(D_(1)EFG)+t_(ABFG)t_{-}=t_{A B C D_{2}}-t_{D_{1} E F G}+t_{A B F G}t=tABCD2tD1EFG+tABFG
Note that more than one combination of raypaths associated with different separations of D 1 D 2 D 1 D 2 D_(1)D_(2)D_{1} D_{2}D1D2 can be used to measure (pick) the traveltimes on the right sides of equations ( 3 50 a , b ) 3 50 a , b ) 3-50 a,b)3-50 a, b)350a,b). Consequently, there is more than one estimate of the plus-minus times at a given (shotreceiver) station D D DDD. By carefully editing the first breaks, these estimates can be refined and reduced to a single estimate for each station.
To derive the near-surface model, the generalized reciprocal method uses the observed traveltimes from refracted arrivals that are assumed to be associated with the base of weathering. A problem arises when a nearsurface model with more than one layer needs to be defined. This is the case in areas covered with glacial tills and sand dunes. Several specialized techniques based on generalized linear inversion (GLI) have been devised for these problems (Hampson and Russell, 1984; Schneider and K u o , 1985 K u o , 1985 Kuo,1985\mathrm{Kuo}, 1985Kuo,1985 ). The GLI technique is an iterative, model-based approach that provides flexibility in defining a near-surface moded consisting of arbitrarily parameterized multilayers. The process begins by computing the refracted arrival times from an assumed initial near-surface model. These computed traveltimes then are compared with the actual first-break picks (observed traveltimes). The procedure tries to minimize the difference between the computed and observed traveltimes by iteratively modifying model parameters for the near surface (such as velocities and thicknesses). A GLI method applicable to a single-layer near-surface model is presented next.

The Least-Squares Method

We want to estimate the near-surface parameters weathering and bedrock velocities and thickness of the weathering layer at shot-receiver locations by leastsquares inversion of the observed (picked) refracted arrivals. Formulation of this problem using the leastsquares inversion leads to an estimate of the nearsurface parameters such that the difference between the observed arrivals and the modeled refracted arrivals is minimum in the least-squares sense. This method is not only applicable to 2 -D line shooting but also to 3-D swath shooting geometries.
There are several ways to paranteterize the nearsurface layer. The most general formulation would include varying weathering and bedrock velocities and the thickness of the weathering layer at all shot-receiver stations. This, however, would require lincarizing the problem and iterating over the estimated parameters. The problem also would have to be constrained to stabilize the inversion. In a simplified version of this general formulation, weathering velocity may be fixed and assumed to be known. This leaves the weathering thickness and bedrock velocity as spatially varying parameters.
As for any inversion problem, we shall need a model equation that relates the model parameters we want to estimate to the modeled refracted arrival times. Refer to the sketch of a near-surface model in Figure 3.4-13. If we let the weathering thickness vary as might be the case
in many field data applications, then we have a problem of not being able to write down an analytic expression for the refracted raypath. We would not even begin to anticipate how the head wave would behave or develop in case of a laterally varying refractor geometry.
Instead, to be able to make use of the first-break picks, we shall take a simpler approach. We want to describe the near-surface with minimal parameterization and consider the model with a flat refractor. Now, we can express the modeled traveltime t 2 j t 2 j t_(2j)^(')t_{2 j}^{\prime}t2j for the critically refracted raypath from the source location S 3 S 3 S_(3)S_{3}S3 to the receiver location R τ R τ R_(tau)R_{\tau}Rτ (Figure 3.4-13) as
t i j = S 3 B v 1 v + D E D B C E v b + C R 2 v w t i j = S 3 B v 1 v + D E D B C E v b + C R 2 v w t_(ij)^(')=(S_(3)B)/(v_(1v))+(DE-DB-CE)/(v_(b))+(CR_(2))/(v_(w))t_{i j}^{\prime}=\frac{S_{3} B}{v_{1 v}}+\frac{D E-D B-C E}{v_{b}}+\frac{C R_{2}}{v_{w}}tij=S3Bv1v+DEDBCEvb+CR2vw
Keep in mind that we had to make the same assumption - that the refractor is flat or nearly-flat within the spread length, as in the generalized reciprocal method. The first and the third terms in equation (3-51a) are associated with the raypaths within the weathering layer, and the second term is associated with the raypath within the bedrock along the refractor. When the refractor dip is taken into account, the problem cannot be readily linearized.
By regrouping the terms in equation (351a), we get the expression
t v 2 = ( S , B v w D B v b ) + ( C R t v u 1 C E v b ) + D E v b . t v 2 = S , B v w D B v b + C R t v u 1 C E v b + D E v b . t_(v_(2))^(')=((S,B)/(v_(w))-(DB)/(v_(b)))+((CR_(t))/(v_(u1))-(CE)/(v_(b)))+(DE)/(v_(b)).t_{v_{2}}^{\prime}=\left(\frac{S, B}{v_{\mathrm{w}}}-\frac{D B}{v_{\mathrm{b}}}\right)+\left(\frac{C R_{\mathrm{t}}}{v_{\mathrm{u} 1}}-\frac{C E}{v_{b}}\right)+\frac{D E}{v_{b}} .tv2=(S,BvwDBvb)+(CRtvu1CEvb)+DEvb.
Finally, rewriting in terms of the model parameters that we want to estimate v w , v b v w , v b -v_(w),v_(b)-v_{w}, v_{b}vw,vb, and z w z w z_(w)z_{w}zw, we obtain the expression for the model equation for the refracted a r a r ar-a r-ar rivals:
t t j = z j v b 2 v w 2 v b v w + z i 1 j b 2 v w 2 v b v w + x z j v b , ( 3 51 c ) t t j = z j v b 2 v w 2 v b v w + z i 1 j b 2 v w 2 v b v w + x z j v b , ( 3 51 c ) t_(tj)^(')=(z_(j)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(b)v_(w))+(z_(i)sqrt(1j_(b)^(2))-v_(w)^(2))/(v_(b)v_(w))+(x_(zj))/(v_(b)),quad(3-51 c)t_{t j}^{\prime}=\frac{z_{j} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{b} v_{w}}+\frac{z_{i} \sqrt{1 j_{b}^{2}}-v_{w}^{2}}{v_{b} v_{w}}+\frac{x_{z j}}{v_{b}}, \quad(3-51 c)ttj=zjvb2vw2vbvw+zi1jb2vw2vbvw+xzjvb,(351c)
In addition to assuming a flat refractor, we fix the bedrock velocity v b v b v_(b)v_{b}vb but retain it as a parameter to be estimated. We also assume that v s v s v_(s)v_{s}vs is known. Under these assumptions, the model cquation (3-51c) for the refracted arrivals can be written in the form (Farrell and Euwema, 1984)
t i j = T 3 + T 2 + s b x i j , t i j = T 3 + T 2 + s b x i j , t_(ij)^(')=T_(3)+T_(2)+s_(b)x_(ij),t_{i j}^{\prime}=T_{3}+T_{2}+s_{b} x_{i j},tij=T3+T2+sbxij,
where s b = 1 / v b s b = 1 / v b s_(b)=1//v_(b)s_{b}=1 / v_{b}sb=1/vb is the bedrock slowness, and
T 3 = z 3 v b 2 v w 2 v b v w , T 2 = z 2 v b 2 v w 2 v b v w T 3 = z 3 v b 2 v w 2 v b v w , T 2 = z 2 v b 2 v w 2 v b v w {:[T_(3)=(z_(3)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(b)v_(w))","],[T_(2)=(z_(2)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(b)v_(w))]:}\begin{aligned} & T_{3}= \frac{z_{3} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{b} v_{w}}, \\ & T_{2}=\frac{z_{2} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{b} v_{w}} \end{aligned}T3=z3vb2vw2vbvw,T2=z2vb2vw2vbvw
By comparing equations (3-53a,b) with equation (3-48b), note that T T TTT, and T 2 T 2 T_(2)T_{2}T2 actually are (half) intercept
FIG, 3.4-13. Geometry of refracted arrival used in deriving the least-squares solution for intercept times. Here, S 3 S 3 S_(3)S_{3}S3 and R 2 R 2 R_(2)R_{2}R2 are source end receiver stations, respectively; θ c θ c theta_(c)\theta_{c}θc is the critical angle of refraction, z j z j z_(j)z_{j}zj and z 2 z 2 z_(2)z_{2}z2 are depths to the bedrock at source and receiver locations, and v t v t v_(t)v_{t}vt and v b v b v_(b)v_{b}vb are weathering and bedrock velocities, respectively.
time values at the shot and receiver locations. Hence, for n n nnn shot-receiver stations, the parameter vector contains ( T 1 , T 2 , , T n : s b ) T 1 , T 2 , , T n : s b (T_(1),T_(2),dots,T_(n):s_(b))\left(T_{1}, T_{2}, \ldots, T_{n}: s_{b}\right)(T1,T2,,Tn:sb).
Equation (3-52), which models refracted arrivals, is solved for the parameter vector in the same manner using the generalized linear inversion (GLI) theory (Section C.8) as for equation (3-25), which models traveltime deviations associated with residual statics (Section C.4). The generalized linear inversion solution is based on the objective of minimizing the least-squares difference between the observed refracted arrival times t 2 j t 2 j t_(2j)t_{2 j}t2j and the modeled times t i j t i j t_(ij)^(')t_{i j}^{\prime}tij defined by equation (3-52). Alternatively, the refraction statics solution can be obtained by using the minimization criterion that is based on the L 1 L 1 L_(1)L_{1}L1 norm (Section C.10).
An extension of equation (3-52) to represent the refraction statics associated with each shot and receiver location in two parts - long- and short-wavelength components, is proposed by Taner et al. (1998). This is done by including two more terms in equation (352) to represent the shot and receiver short-wavelength variations in refraction statics caused by rapid changes in elevation and near-surface layer geometry. The conjecture for such an extension is to stabilize the longwavelength solution derived from equation (3-52). Albeit the extension includes short-wavelength terms for shots and receivers, you still would need to estimate residual staties and apply them to your data (equation 3-25).
Equation (3-52) describes a variable-thickness scheme since the weathering velocity is assumed to be
constant. Note that the traveltime model equation (352) suffers from uncertainty in the value for the weathering layer velocity, as was the case for the generalized reciprocal method. The estinated refractor shape using the variable-thickness scheme (whether it is based on the the generalized reciprocal or least-squares method) does not yield the true refractor shape. Instead, the uncertainty in weathering velocity significantly influences the implied refractor shape. Perhaps, uphole information can be used to calibrate the estimated thicknesses and thus an acceptable weathering velocity can be chosen accordingly.
Once the parameter vector is estimated, then the thickness of the weathering layer below shot and receiver locations can be computed using the expressions for the intercept time values (equations 3-53a,b).
Because equation (3-52) does not contain a structure term, any long-wavelength static anomaly is partitioned between the other terms. This is not the case for the reflection-based residual statics model that is based on equation (3-25). Thus, following the field statics corrections (to account for elevation changes), statics corrections are estimated and applied in two stages:
(a) Refraction-based statics corrections to remove long-wavelength anomalies, and
(b) Reflection-based residual statics corrections to remove any remaining short-wavelength static shifts.
Both the generalized reciprocal and least-squares methods are based on computing intercept time anomalies at shot-receiver stations. The generalized recipro c a l c a l cal\mathrm{cal}cal method yjelds multi-valued intercept times for each shot-receiver station, which need to be reduced to a single-valued intercept time profile along the line before computing the shot-receiver statics. On the other hand, the least-squares method yields a unique intercept time value for each shot-receiver station based on the least-squares minimization.
The generalized reciprocal method requires a special combination of raypaths essociated with the traveltime picks that correspond to the terms in equations ( 3 50 a , b ) ( 3 50 a , b ) (3-50 a,b)(3-50 a, b)(350a,b) in estimating intercept times. These raypaths are not always attainable by 3 D 3 D 3-D3-D3D swath shooting, and therefore, the generalized reciprocal method is most suitable for 2-D seismic profiles. On the other hand, the least-squares method yjelds intercept times for arbitrary shot-recelver locations associated with 2 -D or 3-D recording geometries. The important point to kecp in mind, however, is that neither method yields the true physical parameters for the near-surface - the variablethickness solution depends on the assumed value for the weathering velocity. However, with extra information such as from upholes, these solutions may be calibrated.

Processing Sequence for Statics Corrections

It is important that we revisit the processing sequence in Figure 3.3-12 and the near-surface model depicted in Figure 3.4-10 for a rigorous description of moveout and statics corrections. Starting with unprocessed field records, a dctailed version of the processing sequence in Figure 3.3-12 is described below:
(a) Pick and edit first breaks from unprocessed field records.
(b) Assume or derive from uphole information a value for weathering velocity.
(c) For a downhole source, apply the uphole correction.
(d) Compute the bedrock velocity and intercept times at all shot and receiver stations using a refraction statics method, such as the generalized reciprocal or the least-squares technique.
(e) By using the weathering velocity, bedrock velocity and intercept times, compute the depth to bedrock at shot-receiver stations (equations 3-53a,b).
(f) Apply the shot and receiver statics to replace the weathering layer with the bedrock while placing the shot and receivers on a floating datum that corresponds to a smoothed form of the topographic surface. The static time shift Δ τ 2 j Δ τ 2 j Deltatau_(2j)\Delta \tau_{2 j}Δτ2j to apply for a given source-receiver pair is (Figure 3.4-10)
Δ τ 3 = ( z 3 + z i ) ( 1 v b 1 v w ) 1 v b ( E T , E F D j + E T 3 E F D i ) , Δ τ 3 = z 3 + z i 1 v b 1 v w 1 v b E T , E F D j + E T 3 E F D i , {:[Deltatau_(3)=(z_(3)+z_(i))((1)/(v_(b))-(1)/(v_(w)))],[-(1)/(v_(b))(E_(T,)-E_(FD_(j))+E_(T_(3))-E_(FD_(i)))","]:}\begin{aligned} \Delta \tau_{3} & =\left(z_{3}+z_{i}\right)\left(\frac{1}{v_{b}}-\frac{1}{v_{w}}\right) \\ & -\frac{1}{v_{b}}\left(E_{T,}-E_{F D_{j}}+E_{T_{3}}-E_{F D_{i}}\right), \end{aligned}Δτ3=(z3+zi)(1vb1vw)1vb(ET,EFDj+ET3EFDi),
where z 3 z 3 z_(3)z_{3}z3 and z 2 z 2 z_(2)z_{2}z2 are the thickncss of the weathering layer at shot and receiver stations, E T E T E_(T)E_{T}ET, and E T 3 E T 3 E_(T3)E_{T 3}ET3 are the true shot and receiver elevations referenced to the topography, and E F D 3 E F D 3 E_(FD_(3))E_{F D_{3}}EFD3 and E F D i E F D i E_(FD_(i))E_{F D_{i}}EFDi are the shot and receiver elevations referenced to the floating datum, respectivcly. The reason for moving the shots and receivers to a floating daturn close to the surface topography, rather than to a flat datum, is to be able to preserve the hyperbolicity of reflection times while placing the shot and receiver pairs associated with a CMP gather over the local datum level that is nearly flat within the spread length.
(g) Apply geometric spreading correction and deconvolution to shot records and sort to CMP gathers.
(h) Perform preliminary velocity analysis and apply moveout corrections.
(i) Apply datum corrections to move the shots and receivers from the floating datum as specified in step (f) to a flat datum E D E D E_(D)E_{D}ED to which the CMP stack
is referenced. Refer to Figure 3.4-10 and note that the datum correction Δ τ ı , Δ τ ı , Deltatau_(ı,)\Delta \tau_{\imath,}Δτı, for a source-receiver pair is given by
Δ τ ı j = 2 E D ( E F D 3 + E F D 2 ) v b Δ τ ı j = 2 E D E F D 3 + E F D 2 v b Deltatau_(ıj)=(2E_(D)-(E_(FD_(3))+E_(FD_(2))))/(v_(b))\Delta \tau_{\imath j}=\frac{2 E_{D}-\left(E_{F D_{3}}+E_{F D_{2}}\right)}{v_{b}}Δτıj=2ED(EFD3+EFD2)vb
where E F D E F D E_(FD)E_{F D}EFD, and E F D t E F D t E_(FDt)E_{F D t}EFDt are the shot and receiver elevations with respect to the floating datum specified in step (f)
(j) Estimate surface-consistent shot and residual static shifts using methods described in Section 3.3.
(k) Apply residual statics corrections to CMP gathers from step (i).
(1) Apply the inverse of step (i) to move the shots and receivers from the flat reference datum back to the floating datum.
(m) Apply inverse moveout correction using velocities from step (h).
(n) Perform velocity analysis and apply moveout correction.
(0) Apply datum corrections to move the shots and recejvers from the foating datum to the reference flat datum as in step (i).
(p) Apply mute and stack the data. The stacked section is referenced to the flat datum level E D E D E_(D)E_{D}ED specified in step (i).

Model Experiments

We shall analyze the problem of near-surface model estimation using two sets of synthetic data. The near-surface model for the first data set comprises a single layer with an undulating refractor and a flat topography. The near-surface model for the second data set comprises multiple layers below an irregular topography. We shall examine the extent of resolving the long- and short-wavelength anonalies by way of the refraction and residual statics correction methods described in Sections 3.3 and 3.4.
Figure 3.4-14a shows an earth model that comprises a simple subsurface velocity-depth model and a near-surface model that comprises a single layer with an undulating refractor but flat surface topography. The refractor geometry has wavelength variations that range from short wavelengths that are less than a cable length to long wavelengths greater than a cable length. The weathering velocity is 1200 m / s 1200 m / s 1200m//s1200 \mathrm{~m} / \mathrm{s}1200 m/s and the refractor velocity is 2000 m / s 2000 m / s 2000m//s2000 \mathrm{~m} / \mathrm{s}2000 m/s.
Figure 3.4-14b shows the zero-ofset section derived from the earth model in Figure 3.4-14a. Note the traveltime distortions associated with the flat refectors. Also, in this section we see the multiples from the refractor and the peglegs from reflector 1 . The zero-offset section is appropriately aligned with respect to the velocity-dept hodel in the lateral direction. The objective in this model experiment is, following the application of refaction and residual statics corrections, to obtain a stack response similar to this zero-offset section.
A two-way acoustic wave equation was used to model a total of 154 shot records along the line. Both shot and receiver group intervals are 50 m 50 m 50m50 \mathrm{~m}50 m, and the number of channels is 97 , including the zero-offsct trace. The split-spread recording geometry has a maximum offset of 2350 m 2350 m 2350m2350 \mathrm{~m}2350 m. Selected shot records shown in Figure 3.4-15 from the synthetic data set associated with the earth model exhibit traveltime distortions on the reflection events caused by the undulating refractor. Note also the distinct refracted arrivals and the ground-roll energy.
Figure 3.4-16a shows the CMP-stacked section with no statics corrections. Compare with the zero-offset section (Figure 3.4-14b) and note some differences. As a result of velocity discrimination, multiples have been attenuated to some extent by CMP stacking. Both the CMP-stacked and zero-offset sections have the imprint of the near-surface effects on reflection times, Note that CMP stacking has given rise to the spurious structural discontinuities on reflections below 1 s 1 s 1s1 \mathrm{~s}1 s between CMP 100-200. Following residual statics corrections (Figure 3.4-16b), these short-wavelength anomalies appear to have been resolved. The moderate-to-long wavelength anomalies expressed by the reflection traveltime undulations, however, have remained in the section. These anomalies have been resolved by refraction statics corrections as shown in Figure 3.4-17a using, in this case, the generalized linear inverse (GLI) method to solve equation (3-52). Nevertheless, some residual anonalies still remain. After residual statics corrections based on the solution to equation (3-25), the remaining longwavelength anomalies are untouched, while the residual short-wavelength anomalies have been further resolved. Unfortunately, not all of the traveltime distortions due to the near-surface layer (the undulating refractor R R RRR in Figure 3.4-14a) have been eliminated. Note, for instance, the slight undulations in Figure 3.4-17b on events at 0.5 and 1 s 1 s 1s1 \mathrm{~s}1 s which correspond to horizons 1 and 2 in Figure 3.4-14a. Note also in Figure 3.4-17b the distorted structural high represented by the reflection between 1-1.5 s, which corresponds to horizon 3 in Figure 3.4-14a, and the sagging refection below 1.5 s, which corresponds to horizon 4 in Figure 3.4-14a.
The results of the GLI statics estimates are summarized in Figure 3.4-18. For the variable-thickness estimate (cquation 3-52), the weathering velocity was
FIG. 3.4-14. (a) A velocity-depth model with a near-surface refractor ( R R RRR ) and smple subsurface structure; (b) the corresponding zero-offset section with trace spacing of 50 m 50 m 50m50 \mathrm{~m}50 m.
FIG. 3.4-15. Selected shot records from the synthetic data set associated with the earth model in Figc on top of each record indicate the CMP location in the vicinity of the shot.
FIG. 3.4-16. CMP stack essociated with the model dats in Figure 3.4-14: (a) with no statics corrections, (b) section as in (a) after residual statics corrections. Datum level is 0 m 0 m 0m0 \mathrm{~m}0 m in both sections.
FIG. 3.4-17. CMP stack associated with the model data in Figure 3.4-14 (a) with refraction statios corrections using the GLI solution, (b) section as in (a) after residual statics corrections. Datum level is 0 m 0 m 0m0 \mathrm{~m}0 m in both sections, and the weathering velocity is assumed to be 1200 m / s 1200 m / s 1200m//s1200 \mathrm{~m} / \mathrm{s}1200 m/s.
FIG. 3.4-18. Surnmary of the variable-thickness GLI solution for refraction statics associated with the CMP stacked section in Figure 3.4-17a. See text for details. Plot direction is the same as that in Figure 3.4-17. Except in frame 1, shot attributes are denoted with × × xx\times× and receiver attributes are denoted with vertical bars. Estimated parameters from equation (C-54) are plotted in frame 1 with no distinction made between shot and receiver locations.
set to 1200 m / s 1200 m / s 1200m//s1200 \mathrm{~m} / \mathrm{s}1200 m/s the correct velocity for the nearsurface layer. Frame 1 shows the estimated GLI parameters the intercept time anomalies (equations 3 53 a , b 53 a , b 53a,b53 \mathrm{a}, \mathrm{b}53a,b ), as a function of the shot-receiver station number. Frame 2 shows the pick fold, namely the number of picks in each shot (dennted by x x xxx ) and receiver (denoted by the vertical bars) gather. Note the tapering of the pick fold at both ends of the line.
A quantitative measure of the accuracy of the GLI solution to refraction statics is the sum of the differences between the observed picks t i j t i j t_(ij)t_{i j}tij and the modeled traveltimes t i j t i j t_(ij)^(')t_{i j}^{\prime}tij (equation 3-52) over each shot and receiver gather. These rexidual time differences are plotted in frame 3 of Figure 3.4-18. Large residuals often are related to bad picks. Nevertheless, even with good picks, there may be large residuals attributable to inappropriateness of the model assumed for the near-surface.
Figure 3.4-18 also shows the estimated weathering thicknesses at all shot-receiver stations (frame 4). Fj- nally, the computed statics and the near-surface model are shown in frames 5 and 6 , respectively.
Uncertainty in the assumed value for weathering velocity is an important practical consideration in refraction statics. Figure 3.4-19 shows results of GLI statics solution using two different weathering velocities. Compare with the result using the correct weathering velocity (Figure 3.4-17a) and note that the GLI solution tolerates reasonable departures from the correct weathering velocity,
The ability of statics solutions to resolve the effect of the near-surface layer with the undulating refractor shown in Figure 3.4-14s is further tested by applying the generalized reciprocal method (GRM) described by equations ( 3 50 a , b ) ( 3 50 a , b ) (3-50a,b)(3-50 \mathrm{a}, \mathrm{b})(350a,b). Compare the results of refraction statics corrections using the GLI method (Figure 3.417) and the GRM method (Figure 3.4-20), and note that, in this case, the differences are marginal. Nevertheless, it appears that neither of the statics solutions appear to have resolved the time anomalies caused by
FIG. 3.4-19. CMP stack associated with the model dats in Figure 34-14 with refraction statics corrections using weathering velocity (a) 1000 m / s 1000 m / s 1000m//s1000 \mathrm{~m} / \mathrm{s}1000 m/s and (b) 1400 m / s 1400 m / s 1400m//s1400 \mathrm{~m} / \mathrm{s}1400 m/s. Datum level is 0 m 0 m 0m0 \mathrm{~m}0 m in both sections. Compare with the section in Figure 3.4-17a.
FIG. 3.4-20. CMP stack associated with the model data in Figure 3.4-14 generalized reciprocal method (GRM), (b) section ss in (s) after residual statics corrections. Compare with the GLI results in Figure 3.4-17.
the undulating near-surface layer, completely. Assumptions made about the near-surface model always limit the resolving power of all the statics corrections methods.
Although in most cases the near-surface often consists of a low-velocity weathering layer, in some exploration basins, a single-layer near-surface model may not be adequate. We shall examine the response of statics solutions to a multilayer near-surface model shown in Figure 3.4-21a. The zero-offset section at z = 0 z = 0 z=0z=0z=0 is free of the near-surface effects (Figure 3.4-21b) since the nearsurface anomalies are above z = 0 z = 0 z=0z=0z=0 in the model (Figure 3.4-21a). Following the application of refraction and residual statics corrections, ideally, we should like to obtain a stack response similar to this zero-offset section.
The near-surface consists of layers with irregular geometry and an irregular topography. A two-way acoustic wave equation was used to model a total of 154 shot records along the line. Both shot and receiver group intervals are 50 m 50 m 50m50 \mathrm{~m}50 m, and the number of channels is 97 , including that associated with the zero-offset trace. The split spread recording geometry has a maximum offset of 2350 m 2350 m 2350m2350 \mathrm{~m}2350 m. Selected shot records from the synthetic data set associated with the earth model (Figure 3.4-22) exhibit traveltime distortions on reflection events resulting from the complex near-surface model. Note also the distinct refracted arrivals and the ground-roll energy.
Figure 3.4-23a shows the CMP-stacked section with no statics corrections. Compare with the zero-offset section (Figure 3.4-21b) and note the significant differences. Note the severe time anomalies caused by the complexity of the near-surface layer. Some shortwavelength anomalies have been resolved by residual statics corrections (Figure 3.4-23b). Nevertheless, this stacked section is far from implying the simple subsurface structure (Figure 3.4-21a).
By using the near-surface model (Figure 3.4-21a), statics at all shot-receiver stations were calculated by hand and corrections were applied to the data. The resulting stacked section is shown in Figure 3.4-24a. Note that most of the long-wavelength anomalies have been removed. Remaining disortions on reflection times, particularly betwen CMP 300 400 300 400 300-400300-400300400, imply that correcting for the near-surface effects by statics shifts applied to CMP traces is a simplistic approach given the complexity of the near-surface model. Residual statics corrections do not help in removing the time anomalies that are beyond the limit of staties corrections (Figure 3.424b).
Now assume a near-surface model that comprises a single layer with constant velocity ( 1400 m / s ) ( 1400 m / s ) (1400m//s)(1400 \mathrm{~m} / \mathrm{s})(1400 m/s). The top and base of this layer are defined by the elevation curve and the flat datum at z = 0 z = 0 z=0z=0z=0, respectively. Then, compute the elevation statics at each shot-receiver station using the thickness of the constant-velocity layer, and apply them to the CMP traces. Figure 3.4-25 shows the CMP stack with elevation statics and the subsequent residual statics corrections. Compare with Figure 3.4-23 and note that much of the time anomalies are due to elevation differences along the line. Elevation statics corrections are basically a simple alternative to statics corrections based on an estimate of a near-surface model. Using the GLI solution based on equation (3-52), inversion of the refracted arrivals yields the stacked section in Figure 3.4-26a. Here, the near-surface model was assumed to consist of a single layer, as in the case of elevation statics corrections, but with varying refractor geometry. Note the improvement on reflection times on the stack associated with the GLI solution. Clearly, a more complicated, multi-layered near-surface model can, in principle, be estimated from inversion of refracted arrivals. However, the more complicated the model, the more parameters need to be specified. This in turn will require a more complicated inversion scheme. Generally, in practice, one should model the near-surface simply. If traveltime distortions are not resolved adequately by a simple near-surface model, it often means that the problem is not solvable by statics methods. Specifically, the near-surface corrections should not be done using vertical time shifts applied to CMP traces. Under those circumstances, very little can be achieved by residual statics corrections (Figure 3.4-26b). Instead, the problem should be characterized as dynamic and be solved by earth modeling in depth (Chapter 9).
The results of the GLI statics estimates are summarized in Figure 3.4-27. For the variable-thickness single-layer near-surface, the weathering velocity was assumed to be 1400 m / s 1400 m / s 1400m//s1400 \mathrm{~m} / \mathrm{s}1400 m/s. Frame 1 shows the estimated GLI parameters the intercept time anomalies (equation 3-53a,b), as a function of the shot-receiver station number. Frame 2 shows the pick fold, namely the number of picks in each shot (denoted by x x xxx ) and receiver (denoted by the vertical bars) gather. Note the tapering of the pick fold at both ends of the line. The sum of the differences between the observed picks t 2 t 2 t_(2)t_{2}t2, and the modeled traveltimes t i j t i j t_(ij)^(')t_{i j}^{\prime}tij (equation 3-52) over each shot and receiver gather is shown in frame 3. Large residuals, in this case, are attributable to the inappropriateness of the model assumed for the nearsurface. Figure 3.4-27 also shows the estimated weathering thicknesses at all shot-receiver stations (frame 4). Finally, the computed statics and the near-surface model are shown in frames 5 and 6 , respectively.
For comparison, the GRM statics solution for the multilayered near-surface model of Figure 3.4-21a is shown in Figure 3.4-28. While both the GLI (Figure 3.4-26a) and GRM (Figure 3.4-28a) solutions are comparable, it appears that neither of the statics solutions
FIG. 3.4-21. (a) A velocity-depth model that comprises a multilayer near-surface with a strong refractor (R) and simple subsurface structure; (b) the corresponding zero-offset section with trace spacing of 50 m 50 m 50m50 \mathrm{~m}50 m.
FIG. 3.4-22. Selected shot records from the synthetic data set associated with the earth model in on top of each record indicate the CMP location in the vicinity of the shot.
(a)
(b)
FIG. 3.4-23. CMP stack associated with the model data in Figure 3.4-21 (a) with no statics corrections, (b) section as in (a) after residual statics corrections. Datum level is 0 m 0 m 0m0 \mathrm{~m}0 m in both sections. Elevation curve is plotted on top of each section.
(a)
(b)
FIG. 3.4-24. CMP stack associated with the model data in Figure 3.4-21 (a) with statics corrections using hand calculated statics, (b) section as in (a) after residual statics corrections. Datum level is 0 m 0 m 0m0 \mathrm{~m}0 m in both sections. Elevation curve is plotted on top of each section.
(a)
FIG. 3.4-25. CMP stack associated with the model dats in Figure 3.4-21 (a) with elevation statics corrections, (b) section as in (a) after residual staties corrections. Datum level is 0 m 0 m 0m0 \mathrm{~m}0 m in both sections. Elevation curve is plotted on top of each section.
(a)
(b)
FIG. 3.4-26. CMP stack associated with the model data in Figure 3.4-21 (a) with refraction statics corrections using the GLI solution, (b) section as in (a) after residual statics corrections. Datum level is 0 m 0 m 0m0 \mathrm{~m}0 m in both sections, and the weathering velocity is assumed to be 1400 m / s 1400 m / s 1400m//s1400 \mathrm{~m} / \mathrm{s}1400 m/s.
F1G. 3.4-27. Summary of the variable-thickness GLI solution for refraction statics associated with the CMP stacked section in Figure 3.4-26a. Plot direction is the same as that in Figure 3.4-26. Except in frame 1, shot attributes are denoted with x x xxx and receiver attributes are denoted with vertical bars. Estimsted parameters from equation (C-54) are plotted in frame 1 with no distinction made between shot and receiver locations.
(a)
(b)
FIG. 3.4-28. CMP stack associated with the model data in Figure 3.4-21 - (a) with refraction statics corrections using the generalized reciprocal method (GRM), (b) section as in (a) after residual statics corrections. Compare with the GLI results in Figure 3.4-26,
appears to have resolved the time anomalies caused by the complex near-surface layer, completely. Again, assumptions made about the near-surface model always limit the resolving power of all the statics methods.

Field Data Examples

We shall analyze field data with three different nearsurface characteristics. Specifically, near-surface models with combinations of irregular topography and refractor geometry are examined. Refraction statics solutions are based on the variable-thickness scheme based on equation (3-52) and residual statics solutions are based on equation (3-25), both solved by the generalized linear inversion schemes (Sections C. 4 and C.8).
The first field data example is from an area with nearly flat topography and presumably irregular base of weathering. Shown in Figure 3.429a is a CMP-stacked section based on elevation statics corrections that involved a flat datum and constant weathering velocity. Note the presence of traveltime distortions along the major reflections down to 2 s 2 s 2s2 \mathrm{~s}2 s caused by the unresolved long-wavelength statics anomalies. We also note very short-wavelength traveltime distortions, much less than a cable length. This latter component of the statics can be resolved by surface-consistent residual statics corrections as shown in Figure 3.4-29b. Although the CMP stacking quality has been improved after the residual statics corrections, the long-wavelength statics anomalies remain unresolved.
Figure 3.4-30 shows plots of the first-break picks from the far-offset arrivels associated with the refracted energy. While most of the first-break picks consistently follow a linear moveout from shot to shot, note that there are some local deviations that indicate a moderate degree of complexity in the near surface. Figure 3.4-31 shows the CMP-stacked section after the application of refraction statics using the generalized reciprocal method. Compare with Figure 3.4-29a and note the significant elimination of long-wavelength statics. Also plotted are the intercept time anomalies at all shotreceiver stations. Recall that equations ( 3 50 a , b ) 3 50 a , b ) 3-50 a,b)3-50 a, b)350a,b) yield multiple values of intercept time estimates at each station. These multiple values need to be reduced to unique intercept time values at each station so as to be able to estimate the thickness of the weathering layer at each station, uniquely. The statics solution at all shot and receiver stations shows that the generalized reciprocal method can correct for all wavelengths of statics caused by undulations along the base of the weathering layer. Any remaining (residual) very short-wavelength statics should be corrected for by using a reflection-based method (Section 3.3).
Figure 3.4-32a shows the CMP-stacked section after the application of refraction statics corrections based on the variable-thickness, least-squares scheme (equation 3-52a). Compare this result with Figure 3.4-29a and note that the long-wavelength statics anomalies have been removed. Also, note that both the generalized reciprocal method (Figure 3.4-31a) and the leastsquares method (Figure 3.4-32a) yield comparable results. The section in Figure 3.4-32a can further be improved by applying residual statics corrections to remove the short-wavelength staties components (Figure 3-4-32b).
The results of the least-squares statics estimates are summarized in Figure 3.4-33. The weathering velocity was assumed to be 450 m / s 450 m / s 450m//s450 \mathrm{~m} / \mathrm{s}450 m/s. Frame 1 shows the estimated intercept times as a function of the shot/receiver station number. Frame 2 shows the pick fold, namely the number of picks in each shot and receiver gather. Note the tapering of the pick fold at both ends of the line.
A quantitative measure of the accuracy of the leastsquares solution is the sum of the differences between the observed picks t 2 j t 2 j t_(2j)t_{2 j}t2j and the modeled traveltimes t i j t i j t_(ij)^(')t_{i j}^{\prime}tij (equation 3-52a) over each shot and receiver gather. These cumulative residual time differences over each shot and receiver are plotted in frame 3 of Figure 3.4-33. Large residuals often are related to bad picks. Nevertheless, even with good picks, there may be large residuals attributable to the inappropriateness of the model assumed for the near-surface.
Figure 3.4-33 also shows the estimated thickness of the weathering layer at all shot-receiver stations (frame 4). Finally, the computed statics and the near-surface model are shown in frames 5 and 6 , respectively.
The next field data example is from an area with irregular topography associated with a sand dune and presumably a near-flat base of weathering. Figure 3.434a shows the CMP-stacked section with elevation statics corrections. Note the severe distortions of the geometry of shallow reflections and a very poor signal-to-noise ratio in the central part of the section. Residual statics corrections (Figure 3.4-34b) cannot improve the interpretation, especially in the center of the line where the first breaks show significant departures from a consistent linear moveout (Figure 3.4-35).
Figure 3.4-36 shows the CMP-stacked section with the application of refraction statics corrections using the generalized reciprocal method. Again, note the multiple-valued intercept time values at shot/receiver stations. The statics solution based on the reduced intercept times shows a significant medium- to longwavelength variations. After the application of these
S S S\mathbf{S}S
FIG. 3.4-29. (a) A CMP stack with elevation statics corrections, (b) same as in (a) with residual statics corrections. (Data courtesy Nederlandse Aardolie Maatschappij B.V.)
โพม11}%s
FIG. 3.4-30 First-break picks associated with the data shown in Figure 3.4-29. The top and the bottom plots correspond to the left- and right-hand of the split-spread geometry. The results of the reiraction statics solution based on these picks are shown in Figures 34 41 to 3.4-33.
FIG.3.4-31. (a) A CMP stack with refraction statics applied using the generalized reciprocal method (compare with Figures 3.4-29a and Figure 3.4-32a), (b) estimated multiple intercept times at each shot-receiver station and the computed shot (open squares) and receiver (solid dots) statics.
FIG. 3.4-32. (a) A CMP stack with refraction statics applied using the least-squares method (compare with Figures 3.4-29a and Figure 3.4-31a), (b) same as in (a) with residual statics corrections.
FIG. 3.4-33. Results of the least-squares refraction statics estimated from and applied to the data in Figure 3 4-32. In each frame, shot attrubute is denoted by x x xxx and receiver attribute is denoted by the vertical bars. R R RRR is the refractor that represents the base of the weathering layer. See text for details.
FIG. 3,4-34. (a) A CMP stack with elevation statjes corrections, (b) same as in (a) with residual statics corrections.
STATIONS

STATIONS

FIG. 3.4-35. First-break picks associated with the data shown in Figure 3.4-34. The top and the bottom plots correspond to the left- and right-hand of the split-spread geometry. The results of the refraction statics solution based on these picks are shown in Figures 3.4-36 to 3.4-38.
FIG. 3.4-36. (a) A CMP stack with refraction statics applied using the generalized reciprocal method (compare with Figures 34-348 and Figure 3.4-37a), (b) estimated multiple intercept times at each shot-receiver station and the computed shot (open squares) and receiver (solid dots) statics.
statics corrections, the near-surface effects on the reflector geometries have been largely removed (compare with Figure 3.4-34a).
Figure 3.4-37a shows the CMP-stacked section after the application of refraction statics corrections based on the least-squares method. Compare with Figure 3.4 34 a 34 a 34a34 \mathrm{a}34a and note the significant improvement in the center of the line. This section can be improved further by applying residual statics corrections and thus removing the short-wavelength statics components (Figure 3.437b).
The results of the least-squares statics estimates are summarized in Figure 3.4-38. The weathering velocity was assumed to be 800 m / s 800 m / s 800m//s800 \mathrm{~m} / \mathrm{s}800 m/s. (The description of the frames in Figure 3.4 38 3.4 38 3.4-383.4-383.438 is the same as that of Figure 3.4-33.)
The third field data example is from an area with an abrupt change in topography and presumably surface-following the base of weathering. The CMPstacked section with elevation statics corrections is shown in Figure 3.4-39a. Residual statics corrections significantly imptove the stacking quality (Figure 3.439b); but the long-wavelength statics anomalies remain on the section and appear as spurious structural anomalies.
Figure 3.4-40 shows the first-break picks from the far-offset arrivals associated with the refracted energy. Figure 3.4-41 shows the CMP-stacked section with the refraction statics applied using the generalized reciprocal method and the first-break picks in Figure 3.4-40. Compare with Figure 3.4-39b and note the removal of the spurious structural discontinuity along the strong reflection just above 2 s 2 s 2s2 \mathrm{~s}2 s on the left half of the section.
By using the first-break picks shown in Figure 3.440 , the variable-thickness least-squares parameters for the near-surface were computed (equation 3-52a). The corresponding CMP-stacked section is shown in Figure 3-4.27a. Note the elimination of the spurious structural discontinuities seen in Figure 3.4-39b between 1 and 2 s. The CMP stacked section can be improved further by applying residual statics corrections (Figure 3.4-42b).
The results of the least-squares statics estimates are summarized in Figure 3.4-43. For the variablethickness estimate, the weathering yelocity was assumed to be 900 m / s 900 m / s 900m//s900 \mathrm{~m} / \mathrm{s}900 m/s. (The description of the frames in Figure 3.4-43 is the same as that of Figure 3.4-33.)
Figure 3.4-44 is a stacked section with only the field statics applied. The pull-up at midpoint location A A AAA probably is caused by a long-wavelength statics anomaly, Start with CMP gathers (Figure 3.4-45a) and apply linear-moveout (LMO) correction (Figure 3.4-45b). Assuming that the first breaks correspond to a near-surface refractor, we use the estimated velocity from the first breaks (usually from a portion of the cable) to apply the LMO correction. The CMP-refraction stack of the shallow part of the data after the LMO correction is shown in Figure 3.4-45c. This section is the equivalent of the pilot trace section that is associated with the reflection-based statics corrections. (An example of this is shown in Figure 3.3-37.)
Traveltime deviations are estimated from the LMO-corrected gathers (Figure 3.4-45b) and are docomposed into shot and receiver intercept time components based on equation (3-52a). These intercept times are used to compute shot and receiver static shifts, which are then applied to the CMP gathers shown in Figure 3.4-45a. A comparison of the CMP-refraction stack section with (Figure 3.4-45d) and without (Figure 3.4-45c) reftaction statics corrections clearly indicates removal of the significant long-wavelength statics anomaly centered at midpoint location A A AAA (Figure 3.444). The CMP-stacked section after the refraction statics corrections shown in Figure 3.4-46 no longer contains the false structure (compare with Figure 3.4-44). This long-wavelength anomaly cannot be removed by reflection statics corrections alone (Figure 3.4-47). Nevertheless, the residual statics corrections resolved the shortwavelength statics components that were present in the data. By cascading the two corrections refraction and residual statics, we get the improved section in Figure 3.4-48.
The last field data example for refraction and residual statics corrections is from an overthurst belt with irregular topography and large elevation differences along the line traverse. Figures 3.4-49 and 3.4-50 show selected shot records. Note that the first breaks are very distinct, and the first arrivals do not manifest significant departures from linear moveout. Nevertheless, there are significant distortions along the reflection traveltime trajectories; these are largely attributed to the subsurface complexity associated with the overthrust tectonism in the area.
Figure 3.4-51 shows selected CMP gathers with elevation corrections applied and the data referenced to a flat datum of 1800 m 1800 m 1800m1800 \mathrm{~m}1800 m above the topographic profile of the line. Following the normal-moveout correction (Figure 3.4-52), note that the CMP gathers exhibit shortwavelength deviations Iess than a cable length along the reflection traveltime trajectories. Velocity analysis and moveout correction were performed from a floating datun - a srnoothed version of the topographic profile. The CMP stack with elevation corrections is shown in Figure 3.4-53.
The same CMP gathers as in Figures 3.4-51 and 3.4-52 with refraction statics applied are shown in Figures 3.4-54 and 3.4-55. A comparison of these sets of
FIG. 3.4-37. (a) A CMP stack with refraction statics applied using the least-squares method (compare with Figures 3.4-34a and Figure 3.4-36a), (b) same as in (a) with residual statics corrections.


STATIDN NUMBER
FIG. 3.4-38. Results of the least-squares refraction statics estimated from and applied to the data in Figure 3.4-37. In each frame, shot attribute is denoted by x x x\mathrm{x}x and receiver attribute is denoted by vertical bar. R R RRR is the refractor that represents the base of the weathering layer. See text for details.
FIG. 3.4-39. (a) A CMP stack with elevation statics corrections, (b) same as in (a) with residual staties corrections.
STATIONS
STATIONS
FIG. 3.4-40. First-break picks associated with the data shown in Figure 3.4-39. The top and the bottom plots correspond to the left- and right-hend of the split-spread geometry. The results of the refraction statics solution besed on these picks are shown in Figures 34-41 to 3.4-43.
FIG. 3.4-41. (a) A CMP stack with refraction statics applied using the generalized reciprocal method (compare with Figures 3.4-39a and Figure 3.4-42a), (b) estimated intercept times and the computed shot (open squares) and receiver (solid dots) statics.
FIG. 3.4-42. (a) A CMP stack with refraction statics applied using the least-squares method (compare with Figures 3.4-39a and Figure 3.441a), (b) same as in (a) with residual statics corrections

FIG. 3.4-43. Results of the least-squares refraction statics estimated from and applied to the data in Figure 3.4-42. In each frame, shot attribute is denoted by x x x\mathrm{x}x and receiver attribute is denoted by vertical bar. R R RRR is the refractor that represents the base of the weathering layer. See text for details.
FIG, 3.4-44, A CMP stack with field statics applied. Note the unresolved long-wavelength statics manifested by the spurios structural high below midpoint A.
FIG. 3.4-45. (a) Selected CMP gathers from the section in Figure 3.4-44, (b) CMP gathers after linear-moveout (LMO) correction, (c) stack of the LMO-corrected gathers as shown in (b), and (d) stack of the LMO-corrected gathers after longperiod statics were semoved; compare with (c).
FIG. 3.4-46. The CMP stack associated with the data in Figure 3.4-45 after refraction statics corrections. Compare with Figure 3.4-44.
gathers indicates that the statics problem is primarily of residual nature differences between refraction and elevation statics are not significant. In other words, long-wavelength statics, in this case, are associated for the most part with irregular topography. Differences between the CMP stack with refraction statics (Figure 3.456) and the CMP stack with elevation statics (Figure 3.4-53) are marginal.
Short-wavelength traveltime deviations observed on the CMP gathers in Figures 3.4-54 and 3.4-55 have been resolved by residual statics corrections as shown in Figures 3.4-57 and 3.4-58. Reflection traveltimes in Figure 3.4-57 are much like hyperbolic and those in Figure 3.4-58 are reasonably flat after moveout correction. The corresponding CMP stack shown in Figure 3.4-59, when compared with Figure 3.4-56, clearly demonstrates the improvement attained by residual static corrections.
FIG. 3.4-47. The CMP stack associated with the data in Figure 3.4-45 after field statics and residual statics corrections. Compare with Figure 3,4-44 and 3.4-46.
In areas with severely irregular topography and large elevation changes along line traverses, one may consider extrapolating the recorded data from the topographic surface to a flat datum above the topography by using the wave-equation datuming technique (Section 4.6). Beve (1997) applied this technique to the data as in Figures 3.4-49 and 3.4-50. You still will need to apply residual statics corrections to account for short- wavelength statics not associated with topography, but related to the near-surface layer geometry.
Finally, in the presence of a permafrost layer or a series of lava flows at the near-surface, the problem inherently is dynamic in nature. Specifically, under such circumstances, rays through the near-surface do not follow near-vertical paths, and thus the near-surface problem cannot be posed as a statics problem. Instead,
FIG. 3.4-48. The CMP stack associated with the data in Figure 3,4-45 after refraction and residual statics corrections. Compare with Figure 3.4 44 3.4 44 3.4-443.4-443.444 and 3.4 46 3.4 46 3.4-463.4-463.446.
one needs to estimate accurately a velocity-depth model that accounts for the near-surface complexity so as to honor ray bending through the near-surface layer.
Figure 3.4-60 shows a CMP-stacked section from an area with a permafrost layer at the near-surface. Note that refraction statics followed by residual statics corrections (Figure 3.4-61) yield a section with improved event continuity. Nevertheless, there still exist a number of spurious structural features that have to be accounted for. Figure 3.4-62 shows a CMP-stacked section from an area with lava flows at the near-surface. Al- though residual statics corrections have improved event continuity, spurious faults are troublesome (Figure 3.463). The traveltime distortions on the stacked sections in Figures 3.4-61 and 3.4-63 strongly suggest that they cannot be resolved by statics corrections alone. Additional work, such as velocity-depth modeling (Chapter 9) and imaging in depth (Chapter 8), is required to account for lateral velocity variations associated with near-surface complexities that result from lava flows and a permafrost layer.

EXERCISES

Exercise 3-1. Why does salt have anomalously high velocity ( 4.5 ( 4.5 (4.5(4.5(4.5 to 5.5 k m / s ) 5.5 k m / s ) 5.5km//s)5.5 \mathrm{~km} / \mathrm{s})5.5 km/s) ?
Exercise 3-2. Measure the traveltimes corresponding to offset values of 1 and 3 k m 3 k m 3km3 \mathrm{~km}3 km in Figure 3.1-2. Then compute the velocity above the reflector and verify that it is 2264 m / s 2264 m / s 2264m//s2264 \mathrm{~m} / \mathrm{s}2264 m/s. Note that the zero-offset trace is not recorded; therefore, t 0 t 0 t_(0)t_{0}t0 normally is not a known quantity.
Exercise 3-3. The CMP gather in Figure 3.1-5a contains a hyperbola. Following NMO corrections and using 2000 (Figure 3.1-5c) and 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s (Figure 3.1-5d) velocities, are the traveltime trajectories hyperbolic?
Exercise 3-4. Make velocity picks from the velocity panels in Figures 3.2-4, 3.2-5, 3.2-6, and 3.2-7.
Exercise 3-5. Make velocity picks from the CVS panel in Figure 3.E-1.
Exercise 3-6. Consider two intersecting lines. Would you expect that velocity analyses at the intersection point yield the same velocity function?
Exercise 3-7. Which is correct: velocity analysis from datum or velocity analysis from surface?
Exercise 3-8. Fill the missing elements in the following table. Average velocity v n v g v n v g v_(nvg)v_{n v g}vnvg, which relates vertical traveltime to depth in a horizontally layered medium, is defined as
v a v g = 2 = 1 N v 1 Δ t 2 t = 1 N Δ t 1 v a v g = 2 = 1 N v 1 Δ t 2 t = 1 N Δ t 1 v_(avg)=(sum_(2=1)^(N)v_(1)Deltat_(2))/(sum_(t=1)^(N)Deltat_(1))v_{a v g}=\frac{\sum_{2=1}^{N} v_{1} \Delta t_{2}}{\sum_{t=1}^{N} \Delta t_{1}}vavg=2=1Nv1Δt2t=1NΔt1
where Δ t i = Δ z 2 / v t , Δ z i = Δ t i = Δ z 2 / v t , Δ z i = Deltat_(i)=Deltaz_(2)//v_(t),Deltaz_(i)=\Delta t_{i}=\Delta z_{2} / v_{t}, \Delta z_{i}=Δti=Δz2/vt,Δzi= layer thickness and v t = v t = v_(t)=v_{t}=vt= interval velocity, The rms velocity is given by equation (3-4).
Layer
Thickness,
m
Layer Thickness, m| Layer | | :---: | | Thickness, | | m |
Interval
Velocity,
m / s m / s m//s\mathrm{m} / \mathrm{s}m/s
Interval Velocity, m//s| Interval | | :---: | | Velocity, | | $\mathrm{m} / \mathrm{s}$ |
RMS
Velocity,
m / s m / s m//s\mathrm{m} / \mathrm{s}m/s
RMS Velocity, m//s| RMS | | :---: | | Velocity, | | $\mathrm{m} / \mathrm{s}$ |
Average
Velocity,
m / s m / s m//s\mathrm{m} / \mathrm{s}m/s
Average Velocity, m//s| Average | | :---: | | Velocity, | | $\mathrm{m} / \mathrm{s}$ |
200 2,000
300 3,000
400 4,000
350 3,500
500 5,000
"Layer Thickness, m" "Interval Velocity, m//s" "RMS Velocity, m//s" "Average Velocity, m//s" 200 2,000 300 3,000 400 4,000 350 3,500 500 5,000 | Layer <br> Thickness, <br> m | Interval <br> Velocity, <br> $\mathrm{m} / \mathrm{s}$ | RMS <br> Velocity, <br> $\mathrm{m} / \mathrm{s}$ | Average <br> Velocity, <br> $\mathrm{m} / \mathrm{s}$ | | :---: | :---: | :---: | :---: | | 200 | 2,000 | | | | 300 | 3,000 | | | | 400 | 4,000 | | | | 350 | 3,500 | | | | 500 | 5,000 | | |
Exercise 3-9. Explain why the velocity for horizon A A AAA in Figure 3.2-34 behaves as shown in the HVA display below the salt dome S S SSS.
Exercise 3-10. Suppose you want to fit a set of observed traveltimes to a parabola of the form t = a + t = a + t=a+t=a+t=a+ b x + c x 2 b x + c x 2 bx+cx^(2)b x+c x^{2}bx+cx2. The tabulated input values are given below.
Observed
i i iii x i x i x_(i)x_{i}xi t 7 t 7 t_(7)^(')t_{7}^{\prime}t7
1 0 0.4
2 1 1.1
3 2 3.5
4 3 7.9
5 4 14.4
Observed i x_(i) t_(7)^(') 1 0 0.4 2 1 1.1 3 2 3.5 4 3 7.9 5 4 14.4| | | Observed | | :---: | :---: | :---: | | $i$ | $x_{i}$ | $t_{7}^{\prime}$ | | 1 | 0 | 0.4 | | 2 | 1 | 1.1 | | 3 | 2 | 3.5 | | 4 | 3 | 7.9 | | 5 | 4 | 14.4 |
Set up the least-squares problem and solve for a , b a , b a,ba, ba,b, and c c ccc. You will have five equations and three unknowns.
Exercise 3-11. Solve the system
x 1 2 x 2 = 1 x 1 + 4 x 2 = 4 x 1 2 x 2 = 1 x 1 + 4 x 2 = 4 {:[x_(1)-2x_(2)=1],[x_(1)+4x_(2)=4]:}\begin{aligned} & x_{1}-2 x_{2}=1 \\ & x_{1}+4 x_{2}=4 \end{aligned}x12x2=1x1+4x2=4
by the Gauss-Seidel iterative method. Verify the results by solving these equations by the method of substitution to obtain the correct solution: x 1 = 2 x 1 = 2 x_(1)=2x_{1}=2x1=2 and x 2 = 0.5 x 2 = 0.5 x_(2)=0.5x_{2}=0.5x2=0.5.
Exercise 3-12. Solve the system
x 1 + 4 x 2 = 4 x 1 2 x 2 = 1 x 1 + 4 x 2 = 4 x 1 2 x 2 = 1 {:[x_(1)+4x_(2)=4],[x_(1)-2x_(2)=1]:}\begin{aligned} & x_{1}+4 x_{2}=4 \\ & x_{1}-2 x_{2}=1 \end{aligned}x1+4x2=4x12x2=1
by the Gauss-Seidel iterative method. Note that this is the same problem as in Exercise 3-11, except that the order of the equations is reversed. The solution should be the same. You will find that the solution cannot be obtained because the process of iteration will not converge. This demonstrates the importance of ordering the equations when solving by the Gauss-Seidel method.
Exercise 3-13. Write equation (3-37a) for ı = ı = ı=\imath=ı= 1 , 2 , 3 1 , 2 , 3 1,2,31,2,31,2,3, and j = 1 , 2 , 3 j = 1 , 2 , 3 j=1,2,3j=1,2,3j=1,2,3. You will find that there are six unknowns, but five independent equations.
Exercise 3-14. Can you use refraction-based statics techniques in permafrost areas?
Exercise 3-15. Which of the following adversely affects the quality of velocity spectrum longwavelength or short-wavelength (less than a cable length) statics anomalies?
Exercise 3-16. In what way does inside muting of a CMP gather affect the velocity spectrum?
5
1
2
3
4

2400 m / s 2400 m / s 2400m//s2400 \mathrm{~m} / \mathrm{s}2400 m/s

FIG. 3.E-1. Part 1: CVS panels for a line from an area with couplex structure sasociated with overthrust tectonics.
FIG. 3.E-1. Part 2: CVS panels for a line from an area with complex structure associated with overthrust tectonics.
FIG. 3.E-1. Part 3: CVS panels for a line from an area with complex structure associnted with overthrust tectonics.
FIG. 3.E-1. Part 4: CVS panels for a line from an area with complex structure associated with overthrust tectonics.

Appendix C C C\mathrm{C}C
TOPICS IN MOVEOUT AND STATICS CORRECTIONS

C. 1 The Shifted Hyperbola

The objective in this section is to review the higher-orler accuracy in normal movent for a horizontally layered earth model. Refer to the traveltime equation (3-3) by Taner and Koebler (1969):
t 2 = C 0 + C 1 x 2 + C 2 x 4 + C 3 x 6 + , ( C 1 ) t 2 = C 0 + C 1 x 2 + C 2 x 4 + C 3 x 6 + , ( C 1 ) t^(2)=C_(0)+C_(1)x^(2)+C_(2)x^(4)+C_(3)x^(6)+cdots,quad(C-1)t^{2}=C_{0}+C_{1} x^{2}+C_{2} x^{4}+C_{3} x^{6}+\cdots, \quad(C-1)t2=C0+C1x2+C2x4+C3x6+,(C1)
where x x xxx is the offset, and
C 0 = t 0 2 C 0 = t 0 2 C_(0)=t_(0)^(2)C_{0}=t_{0}^{2}C0=t02
where t 0 t 0 t_(0)t_{0}t0 is the two-way zero-offsct traveltime
C 1 = 1 μ 2 C 2 = 1 4 μ 2 2 μ 4 t 0 2 μ 2 4 C 1 = 1 μ 2 C 2 = 1 4 μ 2 2 μ 4 t 0 2 μ 2 4 {:[C_(1)=(1)/(mu_(2))],[C_(2)=(1)/(4)(mu_(2)^(2)-mu_(4))/(t_(0)^(2)mu_(2)^(4))]:}\begin{gathered} C_{1}=\frac{1}{\mu_{2}} \\ C_{2}=\frac{1}{4} \frac{\mu_{2}^{2}-\mu_{4}}{t_{0}^{2} \mu_{2}^{4}} \end{gathered}C1=1μ2C2=14μ22μ4t02μ24
and
C 3 = 2 μ 4 2 μ 2 μ 6 μ 2 2 μ 4 t 0 4 μ 2 7 C 3 = 2 μ 4 2 μ 2 μ 6 μ 2 2 μ 4 t 0 4 μ 2 7 C_(3)=(2mu_(4)^(2)-mu_(2)mu_(6)-mu_(2)^(2)mu_(4))/(t_(0)^(4)mu_(2)^(7))C_{3}=\frac{2 \mu_{4}^{2}-\mu_{2} \mu_{6}-\mu_{2}^{2} \mu_{4}}{t_{0}^{4} \mu_{2}^{7}}C3=2μ42μ2μ6μ22μ4t04μ27
with the arditional definitions of the terms (Castle, 1994)
μ j = 1 t 0 ı = 1 N v ı J Δ τ i μ j = 1 t 0 ı = 1 N v ı J Δ τ i mu_(j)=(1)/(t_(0))sum_(ı=1)^(N)v_(ı)^(J)Deltatau_(i)\mu_{j}=\frac{1}{t_{0}} \sum_{\imath=1}^{N} v_{\imath}^{J} \Delta \tau_{i}μj=1t0ı=1NvıJΔτi
Note that
μ 2 = v r m s 2 μ 2 = v r m s 2 mu_(2)=v_(rms)^(2)\mu_{2}=v_{r m s}^{2}μ2=vrms2
since
v r π s 2 = 1 t 0 ı = 1 N v i 2 Δ τ 1 v r π s 2 = 1 t 0 ı = 1 N v i 2 Δ τ 1 v_(r pi s)^(2)=(1)/(t_(0))sum_(ı=1)^(N)v_(i)^(2)Deltatau_(1)v_{r \pi s}^{2}=\frac{1}{t_{0}} \sum_{\imath=1}^{N} v_{i}^{2} \Delta \tau_{1}vrπs2=1t0ı=1Nvi2Δτ1
where Δ τ i Δ τ i Deltatau_(i)\Delta \tau_{i}Δτi is the vertical two-way traveltime through the i i iii-th layer, v v vvv is the velocity, and t 0 = t 0 = t_(0)=t_{0}=t0= i = 1 N Δ τ i i = 1 N Δ τ i sum_(i=1)^(N)Deltatau_(i)\sum_{i=1}^{N} \Delta \tau_{i}i=1NΔτi. Derivation of equation (C-I) is based on the parametric equations for traveltime and offet for a horizontally layered earth model (Slotnick, 1959; Grant and West, 1965) and is given by Castle (1994).
Drop higher-order terms in equation (C-1) to obtain the fourth-order moveout equation
t 2 = C 0 + C 1 x 2 + C 2 x 4 t 2 = C 0 + C 1 x 2 + C 2 x 4 t^(2)=C_(0)+C_(1)x^(2)+C_(2)x^(4)t^{2}=C_{0}+C_{1} x^{2}+C_{2} x^{4}t2=C0+C1x2+C2x4
Now, substitute for the coefficients from equations (C-2a). (C-2b) and (C-3a) to obtain
t 2 = t 0 2 + x 2 v r m s 2 + C 2 x 4 t 2 = t 0 2 + x 2 v r m s 2 + C 2 x 4 t^(2)=t_(0)^(2)+(x^(2))/(v_(rms)^(2))+C_(2)x^(4)t^{2}=t_{0}^{2}+\frac{x^{2}}{v_{r m s}^{2}}+C_{2} x^{4}t2=t02+x2vrms2+C2x4
This equation can in principle be used to compute a velocity spectrum (Section 3.2). First, drop the fourth-order term to get the small-spread hyperbolic equation
t 2 = t 0 2 + x 2 v r m s 2 t 2 = t 0 2 + x 2 v r m s 2 t^(2)=t_(0)^(2)+(x^(2))/(v_(rms)^(2))t^{2}=t_{0}^{2}+\frac{x^{2}}{v_{r m s}^{2}}t2=t02+x2vrms2
Compute the velocity spectrum using equation (C-6), and pick an initial velocity function v r m a ( t 0 ) v r m a t 0 v_(rma)(t_(0))v_{r m a}\left(t_{0}\right)vrma(t0). Then, use this picked velocity function in equation (C-5) and compute a velocity spectrum for the parameter C 2 C 2 C_(2)C_{2}C2. Pick a function C 2 ( t 0 ) C 2 t 0 C_(2)(t_(0))C_{2}\left(t_{0}\right)C2(t0) and use in equation (C-5) to recompute the velocity spectrum. Finally, pick an updated velocity function v rnas ( t 0 ) v rnas  t 0 v_("rnas ")(t_(0))v_{\text {rnas }}\left(t_{0}\right)vrnas (t0) from this velocity spectrum.
The fourth-order moveout equation (C-4) can be expressed exactly by a time-shifted hyperbolic traveltime equation of the form (Castle, 1994)
t = t 0 ( 1 1 S ) + ( t 0 S ) 2 + x 2 S v r m s 2 t = t 0 1 1 S + t 0 S 2 + x 2 S v r m s 2 t=t_(0)(1-(1)/(S))+sqrt(((t_(0))/(S))^(2)+(x^(2))/(Sv_(rms)^(2)))t=t_{0}\left(1-\frac{1}{S}\right)+\sqrt{\left(\frac{t_{0}}{S}\right)^{2}+\frac{x^{2}}{S v_{r m s}^{2}}}t=t0(11S)+(t0S)2+x2Svrms2
where S S SSS is a constant of the form
S = μ 4 μ 2 2 S = μ 4 μ 2 2 S=(mu_(4))/(mu_(2)^(2))S=\frac{\mu_{4}}{\mu_{2}^{2}}S=μ4μ22
For S = 1 S = 1 S=1S=1S=1, equation (C-7) reduces to the conventional moveout equation (C-6).
Figure C-I shows the traveltime trajectories of the hyperbolic moveout equation (C-6) and the time-shifted hyperbolic equation (C-7) where τ s = t 0 ( I 1 / S ) τ s = t 0 ( I 1 / S ) tau_(s)=t_(0)(I-1//S)\tau_{s}=t_{0}(I-1 / S)τs=t0(I1/S). Note that the shifted hyperbola is a better match to the true traveltime trajectory at far offsets. The latter was computed for a horizontally layered earth model using the exact parametric equations for traveltime and offset (Slotnick, 1959; Grant and West, 1965).
The shifted hyperbola equation satisfies the requirements for a moveout equation:
(a) The traveltime trajectory is symmetric with respect to the time axis.
(b) The instantaneous velocity d x / d t d x / d t dx//dtd x / d tdx/dt is never zero.
(c) For constant velocity, it reduces to the exact hyperbolic moveout equation.
As for the fourth-order moveout equation (C-5), this equation can, in principle, be used to conduct the velocity analysis of CMP gathers. First, set S = 1 S = 1 S=1S=1S=1 in equation (C-7) to get equation (C-6). Compute the velocity spectrum using equation ( C 6 C 6 C-6\mathrm{C}-6C6 ), and pick an initial velocity function v r m a ( t 0 ) v r m a t 0 v_(rma)(t_(0))v_{r m a}\left(t_{0}\right)vrma(t0). Then, use this picked velocity function in equation (C-7) and compute a velocity spectrum for the parameter S S SSS. Pick a function S ( t 0 ) S t 0 S(t_(0))S\left(t_{0}\right)S(t0) and use in equation (C-7) to recompute the velocity spectrum. Finally, pick an updated velocity function v r m s ( t 0 ) v r m s t 0 v_(rms)(t_(0))v_{\mathrm{rms}}\left(t_{0}\right)vrms(t0) from this velocity spectrum.
De Bazelaire (1988) offers an alternative moveout equation to achieve higher-order accuracy at far offsets:
t = ( t 0 t p ) + t p 2 + x 2 v s 2 t = t 0 t p + t p 2 + x 2 v s 2 t=(t_(0)-t_(p))+sqrt(t_(p)^(2)+(x^(2))/(v_(s)^(2)))t=\left(t_{0}-t_{p}\right)+\sqrt{t_{p}^{2}+\frac{x^{2}}{v_{s}^{2}}}t=(t0tp)+tp2+x2vs2
where t 0 t 0 t_(0)t_{0}t0 is the two-way zero-offset time, t p t p t_(p)t_{p}tp is related to the time at which the asymptotes of the hyperbolic traveltime trajectory converge (Figure C C C\mathrm{C}C-2), and v s v s v_(s)v_{s}vs is the reference velocity assigned to the layer below the recording surface (not the near-surface layer). When t p = t 0 t p = t 0 t_(p)=t_(0)t_{p}=t_{0}tp=t0, equation (C-9) reduces to the small-spread hyperbolic equation (C-6).
FIG. C-1. Traveltime trajectories based on (top) the hyperbolic equation (C-23) and (bottom) the time-shifted hyperbolic equation (C-14). Compare with the true traveltime trajectory associated with a layered model (Castle, 1994).

C. 2 Moveout Stretch

Refer to Figure 3.1-10 for a sketch of a wavelet before and after moveout correction. The moveout equation is
t 2 = t 0 2 + x 2 v 2 t 2 = t 0 2 + x 2 v 2 t^(2)=t_(0)^(2)+(x^(2))/(v^(2))t^{2}=t_{0}^{2}+\frac{x^{2}}{v^{2}}t2=t02+x2v2
where t t ttt is the two-way traveltime associated with a source-receiver separation x , t 0 x , t 0 x,t_(0)x, t_{0}x,t0 is the two-way vertical traveltime - the time after moveout correction, and v v vvv is the moveout velocity.
Consider a reflection event represented by a wavelet of dominant period T T TTT with an arrival time t t ttt at offset x x xxx. After normal-moveout correction, the dominant period becomes T 0 = T + Δ T T 0 = T + Δ T T_(0)=T+Delta TT_{0}=T+\Delta TT0=T+ΔT. The moveout equation ( C 10 ) ( C 10 ) (C-10)(\mathrm{C}-10)(C10) is associated with the onset of the wavelet. Similarly, the moveout
FIG. C-2. The traveltime trajectory associated with the moveout equation (3-5c) (De Bazelaire, 1988).
equation with the termination of the wavelet is expressed by
( t + T ) 2 = ( t 0 + T + Δ T ) 2 + x 2 v 2 ( t + T ) 2 = t 0 + T + Δ T 2 + x 2 v 2 (t+T)^(2)=(t_(0)+T+Delta T)^(2)+(x^(2))/(v^(2))(t+T)^{2}=\left(t_{0}+T+\Delta T\right)^{2}+\frac{x^{2}}{v^{2}}(t+T)2=(t0+T+ΔT)2+x2v2
Expand the terms on both sides:
t 2 + 2 t T + T 2 = t 0 2 + 2 t 0 ( T + Δ T ) + ( T + Δ T ) 2 + x 2 v 2 t 2 + 2 t T + T 2 = t 0 2 + 2 t 0 ( T + Δ T ) + ( T + Δ T ) 2 + x 2 v 2 t^(2)+2tT+T^(2)=t_(0)^(2)+2t_(0)(T+Delta T)+(T+Delta T)^(2)+(x^(2))/(v^(2))t^{2}+2 t T+T^{2}=t_{0}^{2}+2 t_{0}(T+\Delta T)+(T+\Delta T)^{2}+\frac{x^{2}}{v^{2}}t2+2tT+T2=t02+2t0(T+ΔT)+(T+ΔT)2+x2v2
By making the substitution from equation (C-10), we obtain
2 t T + T 2 = 2 t 0 ( T + Δ T ) + ( T + Δ T ) 2 2 t T + T 2 = 2 t 0 ( T + Δ T ) + ( T + Δ T ) 2 2tT+T^(2)=2t_(0)(T+Delta T)+(T+Delta T)^(2)2 t T+T^{2}=2 t_{0}(T+\Delta T)+(T+\Delta T)^{2}2tT+T2=2t0(T+ΔT)+(T+ΔT)2
Simplify and rearrange the terms
2 ( t t 0 ) T = 2 ( t 0 + T ) Δ T + Δ T 2 2 t t 0 T = 2 t 0 + T Δ T + Δ T 2 2(t-t_(0))T=2(t_(0)+T)Delta T+DeltaT^(2)2\left(t-t_{0}\right) T=2\left(t_{0}+T\right) \Delta T+\Delta T^{2}2(tt0)T=2(t0+T)ΔT+ΔT2
Now, ignore the second term on the right-hand side of the equation and observe that Δ t N M O = Δ t N M O = Deltat_(NMO)=\Delta t_{N M O}=ΔtNMO= t t 0 t t 0 t-t_(0)t-t_{0}tt0 to obtain
Δ t N M O T = ( t 0 + T ) Δ T Δ t N M O T = t 0 + T Δ T Deltat_(NMO)T=(t_(0)+T)Delta T\Delta t_{N M O} T=\left(t_{0}+T\right) \Delta TΔtNMOT=(t0+T)ΔT
Assume that t 0 > T t 0 > T t_(0) > Tt_{0}>Tt0>T and rearrange the terms to obtain a relationship for change in the period of the wavelet as a result of moveout correction:
Δ T T = Δ t N M O t 0 Δ T T = Δ t N M O t 0 (Delta T)/(T)=(Deltat_(NMO))/(t_(0))\frac{\Delta T}{T}=\frac{\Delta t_{N M O}}{t_{0}}ΔTT=ΔtNMOt0
Now, we want to express equation ( C 13 C 13 C-13\mathrm{C}-13C13 ) in terms of the dominant frequency f f fff of the wavelet. Start with the relation
T = 1 f T = 1 f T=(1)/(f)T=\frac{1}{f}T=1f
and obtain
Δ T = 1 f 2 Δ f Δ T = 1 f 2 Δ f Delta T=-(1)/(f^(2))Delta f\Delta T=-\frac{1}{f^{2}} \Delta fΔT=1f2Δf
Finally, combine equations ( C 13 C 13 C-13\mathrm{C}-13C13 ) and (C-15) to obtain the equation for the absolute value of frequency stretching:
Δ f f = Δ t N M O t 0 Δ f f = Δ t N M O t 0 (Delta f)/(f)=(Deltat_(NMO))/(t_(0))\frac{\Delta f}{f}=\frac{\Delta t_{N M O}}{t_{0}}Δff=ΔtNMOt0
This is the same as equation (3-6) in the main text.

C. 3 Equations for a Dipping Reflector

We want to derive equation (3-7) of the main text using the geometry of a dipping reflector as shown in Figure C-3. (The derivation provided here is coutresy Zhiming L i , 1999 L i , 1999 Li,1999\mathbf{L i}, 1999Li,1999 ). The distance from source location S S SSS to reflection point R R RRR back to receiver location G G GGG is given by S R + R G = F R + R G = F G = v t S R + R G = F R + R G = F G = v t SR+RG=FR+RG=FG=vtS R+R G=F R+R G=F G=v tSR+RG=FR+RG=FG=vt, whcre point F F FFF is the mirror image of the source location S S SSS v v vvv is the velocity of the medium above the dipping reflector, and t t ttt is the traveltime from F F FFF to G G GGG.
To compute the traveltime t t ttt associated with the distance F G F G FGF GFG, we shall need to compute the coordinates of F : ( x F , z F ) F : x F , z F F:(x_(F),z_(F))F:\left(x_{F}, z_{F}\right)F:(xF,zF) and G : { x G , z G ) G : x G , z G G:{x_(G),z_(G))G:\left\{x_{G}, z_{G}\right)G:{xG,zG), so that
( F G ) 2 = ( x F x G ) 2 + ( z F z G ) 2 ( F G ) 2 = x F x G 2 + z F z G 2 (FG)^(2)=(x_(F)-x_(G))^(2)+(z_(F)-z_(G))^(2)(F G)^{2}=\left(x_{F}-x_{G}\right)^{2}+\left(z_{F}-z_{G}\right)^{2}(FG)2=(xFxG)2+(zFzG)2
From the geometry of Figure C-3, the coordinates of F : ( x F , z F ) F : x F , z F F:(x_(F),z_(F))F:\left(x_{F}, z_{F}\right)F:(xF,zF) are
x F = O F cos 2 ϕ x F = O F cos 2 ϕ x_(F)=OF cos 2phix_{F}=O F \cos 2 \phixF=OFcos2ϕ
and
z F = O F sin 2 ϕ z F = O F sin 2 ϕ z_(F)=OF sin 2phiz_{F}=O F \sin 2 \phizF=OFsin2ϕ
where ϕ ϕ phi\phiϕ is the dip angle of the reflector. Substitute the relation O F = O S = O M + x / 2 O F = O S = O M + x / 2 OF=OS=OM+x//2O F=O S=O M+x / 2OF=OS=OM+x/2 into the above equations to obtain
x ˙ F = ( O M + x 2 ) cos 2 ϕ x ˙ F = O M + x 2 cos 2 ϕ x^(˙)_(F)=(OM+(x)/(2))cos 2phi\dot{x}_{F}=\left(O M+\frac{x}{2}\right) \cos 2 \phix˙F=(OM+x2)cos2ϕ
and
z F = ( O M + x 2 ) sin 2 ϕ z F = O M + x 2 sin 2 ϕ z_(F)=(OM+(x)/(2))sin 2phiz_{F}=\left(O M+\frac{x}{2}\right) \sin 2 \phizF=(OM+x2)sin2ϕ
Again, from the geometry of Figure C-3, the coordinates of G : ( x G , z G ) G : x G , z G G:(x_(G),z_(G))G:\left(x_{G}, z_{G}\right)G:(xG,zG) are
x G = O M x 2 x G = O M x 2 x_(G)=OM-(x)/(2)x_{G}=O M-\frac{x}{2}xG=OMx2
and
z G = 0 z G = 0 z_(G)=0z_{G}=0zG=0
Substitute equations (C-18a,b) and (C-19a,b) into cquation (C-17)
( F G ) 2 = [ ( O M + x 2 ) cos 2 ϕ ( O M x 2 ) ] 2 + [ ( O M + x 2 ) sin 2 ϕ ] 2 , ( C 20 a ) ( F G ) 2 = O M + x 2 cos 2 ϕ O M x 2 2 + O M + x 2 sin 2 ϕ 2 , ( C 20 a ) (FG)^(2)=[(OM+(x)/(2))cos 2phi-(OM-(x)/(2))]^(2)+[(OM+(x)/(2))sin 2phi]^(2),quad(C-20 a)(F G)^{2}=\left[\left(O M+\frac{x}{2}\right) \cos 2 \phi-\left(O M-\frac{x}{2}\right)\right]^{2}+\left[\left(O M+\frac{x}{2}\right) \sin 2 \phi\right]^{2}, \quad(C-20 a)(FG)2=[(OM+x2)cos2ϕ(OMx2)]2+[(OM+x2)sin2ϕ]2,(C20a)
then use the trigonometric relation cos 2 ϕ = 2 cos 2 ϕ 1 cos 2 ϕ = 2 cos 2 ϕ 1 cos 2phi=2cos^(2)phi-1\cos 2 \phi=2 \cos ^{2} \phi-1cos2ϕ=2cos2ϕ1 and apply some algebra to obtain
( F G ) 2 = ( O M + x 2 ) 2 + ( O M x 2 ) 2 2 [ ( O M ) 2 x 2 4 ] ( 2 cos 2 ϕ 1 ) . ( C 20 b ) ( F G ) 2 = O M + x 2 2 + O M x 2 2 2 ( O M ) 2 x 2 4 2 cos 2 ϕ 1 . ( C 20 b ) (FG)^(2)=(OM+(x)/(2))^(2)+(OM-(x)/(2))^(2)-2[(OM)^(2)-(x^(2))/(4)](2cos^(2)phi-1).quad(C-20 b)(F G)^{2}=\left(O M+\frac{x}{2}\right)^{2}+\left(O M-\frac{x}{2}\right)^{2}-2\left[(O M)^{2}-\frac{x^{2}}{4}\right]\left(2 \cos ^{2} \phi-1\right) . \quad(C-20 b)(FG)2=(OM+x2)2+(OMx2)22[(OM)2x24](2cos2ϕ1).(C20b)
Further algebraic manipulation yields
( F G ) 2 = 4 ( O M ) 2 sin 2 ϕ + x 2 cos 2 ϕ ( F G ) 2 = 4 ( O M ) 2 sin 2 ϕ + x 2 cos 2 ϕ (FG)^(2)=4(OM)^(2)sin^(2)phi+x^(2)cos^(2)phi(F G)^{2}=4(O M)^{2} \sin ^{2} \phi+x^{2} \cos ^{2} \phi(FG)2=4(OM)2sin2ϕ+x2cos2ϕ
Finally, note from the geometry of Figure C 3 C 3 C-3\mathrm{C}-3C3 the relation
M N = O M sin ϕ M N = O M sin ϕ MN=OM sin phiM N=O M \sin \phiMN=OMsinϕ
Subsitute equation (C-22) into equation (C-21), and use the relations 2 M N = v t 0 2 M N = v t 0 2MN=vt_(0)2 M N=v t_{0}2MN=vt0 und F G = v t F G = v t FG=vtF G=v tFG=vt to obtain the desired expression for the reflection truveltime associated with a dipping reflector
t 2 = t 0 2 + x 2 cos 2 ϕ v 2 t 2 = t 0 2 + x 2 cos 2 ϕ v 2 t^(2)=t_(0)^(2)+(x^(2)cos^(2)phi)/(v^(2))t^{2}=t_{0}^{2}+\frac{x^{2} \cos ^{2} \phi}{v^{2}}t2=t02+x2cos2ϕv2
and the moveout velocity
v N M O = v cos ϕ v N M O = v cos ϕ v_(NMO)=(v)/(cos phi)v_{N M O}=\frac{v}{\cos \phi}vNMO=vcosϕ
Equations (C-23a) and (C-23b) are the same as equations (3-10) and (3-11) of the main text.
FIC. C-3. Geometry of a dipping reflector used in deriving the equations in Section C.3.

C. 4 Traveltime Decomposition for Residual Statics Estimation

We want to model traveltime deviations t 2 t 2 t_(2)^(')t_{2}^{\prime}t2 associated with a reflection event on moveoutcorrected CMP gathers by the following equation (Taner et al., 1974; Wiggins et al., 1976):
t ı 3 = s j + r i + G k + M k x ı ȷ 2 , t ı 3 = s j + r i + G k + M k x ı ȷ 2 , t_(ı3)^(')=s_(j)+r_(i)+G_(k)+M_(k)x_(ıȷ)^(2),t_{\imath 3}^{\prime}=s_{j}+r_{i}+G_{k}+M_{k} x_{\imath \jmath}^{2},tı3=sj+ri+Gk+Mkxıȷ2,
where s 3 s 3 s_(3)s_{3}s3 is the residual statics shift at the j j jjj th source location, r 2 r 2 r_(2)r_{2}r2 is the residual statics shift at the i i iii th recejver location, G k G k G_(k)G_{k}Gk is the structure term at the k k kkk th midpoint location, [ k = i + j ) / 2 ] [ k = i + j ) / 2 ] [k=(:i+j)//2][k=\langle i+j) / 2][k=i+j)/2], M k x i 2 M k x i 2 M_(k)x_(i)^(2)M_{k} x_{i}^{2}Mkxi2 is the residual moveout at the k k kkk th midpoint location.
For m m mmm picks of t z t z t_(z)t_{z}tz, and n s n s n_(s)n_{s}ns shot locations, n r n r n_(r)n_{r}nr receiver locations, n G n G n_(G)n_{G}nG midpoint locations, we have the following set of equations:
A more parsimonious parameterization can be achieved by an appropriate traveltime picking strategy such that the structure term can be set to zero. Additionally, the residual moveout term coeficient M M MMM may be set to a constant. The model equation (C-24a) can be rewritten as
t i j = s j + r i + M x i j 2 t i j = s j + r i + M x i j 2 t_(ij)^(')=s_(j)+r_(i)+Mx_(ij)^(2)t_{i j}^{\prime}=s_{j}+r_{i}+M x_{i j}^{2}tij=sj+ri+Mxij2
Equation (C-24b) is modified, accordingly
Whichever the preferred modeled traveltimes, write the respective equations ( C 24 b C 24 b C-24b\mathrm{C}-24 \mathrm{~b}C24 b ) or (C-25b) in matrix notation as
t = L p t = L p t^(')=L_(p)\mathrm{t}^{\prime}=\mathbf{L}_{\mathbf{p}}t=Lp
where t t t^(')\mathbf{t}^{\prime}t is the columin vector of m m mmm-length (number of traveltime picks) in equation (C-24b) or (C-25b), L L L\mathbf{L}L is the sparse matrix in the same equations with dimensions m × ( n s + n r + n G + n G ) m × n s + n r + n G + n G m xx(n_(s)+n_(r)+n_(G)+n_(G))m \times\left(n_{s}+n_{r}+n_{G}+n_{G}\right)m×(ns+nr+nG+nG) in case of equation (C-24b) and m × ( n s + n r + 1 ) m × n s + n r + 1 m xx(n_(s)+n_(r)+1)m \times\left(n_{s}+n_{r}+1\right)m×(ns+nr+1) in case of equation ( C 25 b ) C 25 b {:C-25(b))\left.\mathrm{C}-25 \mathrm{~b}\right)C25 b), and p p p\mathrm{p}p is the column vector of ( n s + n r + n G + n C ) n s + n r + n G + n C (n_(s)+n_(r)+n_(G)+n_(C))\left(n_{s}+n_{r}+n_{G}+n_{C}\right)(ns+nr+nG+nC)-length in case of equation (C-24b) and ( n s + n r + 1 ) n s + n r + 1 (n_(s)+n_(r)+1)\left(n_{s}+n_{r}+1\right)(ns+nr+1)-length in case of equation (C-25b) on the right-hand side of these equations. Except the three elements in each row, the L L LLL matrix contains zeros.
The generalized least-squares solution to equation (C-26) satisfies the requirement that the energy of the error vector
e = t t e = t t e=t-t^(')e=t-t^{\prime}e=tt
is minimum (Lines and Treitel, 1984). The cumulative error energy is
E = e T e E = e T e E=e^(T)eE=\mathbf{e}^{\mathrm{T}} \mathbf{e}E=eTe
Substitute equation (C-27a) into equation (C-27b) and use equation (C-26) to obtain
E = ( t L p p ) T ( t L p ) E = t L p p T t L p E=(t-Lp^(p))^(T)(t-L_(p))E=\left(\mathrm{t}-\mathbf{L p}^{\mathrm{p}}\right)^{T}\left(\mathbf{t}-\mathbf{L}_{\mathbf{p}}\right)E=(tLpp)T(tLp)
Minimization of E E EEE with respect to p p ppp requires that
E s 3 = E τ i = E G k = E M k = 0 E s 3 = E τ i = E G k = E M k = 0 (del E)/(dels_(3))=(del E)/(deltau_(i))=(del E)/(delG_(k))=(del E)/(delM_(k))=0\frac{\partial E}{\partial s_{3}}=\frac{\partial E}{\partial \tau_{i}}=\frac{\partial E}{\partial G_{k}}=\frac{\partial E}{\partial M_{k}}=0Es3=Eτi=EGk=EMk=0
which, in the case of equation (C-24b), yields n s + n r + n G + n G n s + n r + n G + n G n_(s)+n_(r)+n_(G)+n_(G)n_{s}+n_{r}+n_{G}+n_{G}ns+nr+nG+nG equations and that many unknowns. These equations can be solved for the residual statics associated with n n nnn, source locations, n r n r n_(r)n_{r}nr receiver locations, n G n G n_(G)n_{G}nG structural terms, and n G n G n_(G)n_{G}nG residual moveout terms.
Finally, the solution that satisfies the minimization requirement given by equation ( C 27 d C 27 d C-27d\mathrm{C}-27 \mathrm{~d}C27 d ) follows (Lines and Treitel, 1984)
p = ( L T L ) 1 L T t p = L T L 1 L T t p=(L^(T)L)^(-1)L^(T)t\mathbf{p}=\left(\mathbf{L}^{\mathbf{T}} \mathbf{L}\right)^{-\mathbf{1}} \mathbf{L}^{\mathrm{T}} \mathbf{t}p=(LTL)1LTt
where t t t\mathbf{t}t denotes the column vector of m m mmm-length that represents the traveltime deviations picked from moveout-corrected CMP gathers, and T T TTT denotes the matrix transposition.
A practical scheme for solving equation (C-24a) is based on the Gauss-Seidel method. In this scheme, each term on the right-hand side of equation (C-24a) is computed by the set of recursive equations
s j m = 1 n r i n r { t ı ȷ G k m 1 M k m 1 x ı j 2 r i m 1 } r 7 m = 1 n g j n 3 { t ı j G k n 1 M k n 1 x ı ȷ 2 s ȷ m 1 } s j m = 1 n r i n r t ı ȷ G k m 1 M k m 1 x ı j 2 r i m 1 r 7 m = 1 n g j n 3 t ı j G k n 1 M k n 1 x ı ȷ 2 s ȷ m 1 {:[s_(j)^(m)=(1)/(n_(r))sum_(i)^(n_(r)){t_(ıȷ)-G_(k)^(m-1)-M_(k)^(m-1)x_(ıj)^(2)-r_(i)^(m-1)}],[r_(7)^(m)=(1)/(n_(g))sum_(j)^(n_(3)){t_(ıj)-G_(k)^(n-1)-M_(k)^(n-1)x_(ıȷ)^(2)-s_(ȷ)^(m-1)}]:}\begin{aligned} & s_{j}^{m}=\frac{1}{n_{r}} \sum_{i}^{n_{r}}\left\{t_{\imath \jmath}-G_{k}^{m-1}-M_{k}^{m-1} x_{\imath j}^{2}-r_{i}^{m-1}\right\} \\ & r_{7}^{m}=\frac{1}{n_{g}} \sum_{j}^{n_{3}}\left\{t_{\imath j}-G_{k}^{n-1}-M_{k}^{n-1} x_{\imath \jmath}^{2}-s_{\jmath}^{m-1}\right\} \end{aligned}sjm=1nrinr{tıȷGkm1Mkm1xıj2rim1}r7m=1ngjn3{tıjGkn1Mkn1xıȷ2sȷm1}
G k m = 1 n h l n h , { t ı j s j m 1 M k m 1 x v 2 r i m 1 } G k m = 1 n h l n h , t ı j s j m 1 M k m 1 x v 2 r i m 1 G_(k)^(m)=(1)/(n_(h))sum_(l)^(n_(h)),{t_(ıj)-s_(j)^(m-1)-M_(k)^(m-1)x_(v)^(2)-r_(i)^(m-1)}G_{k}^{m}=\frac{1}{n_{h}} \sum_{l}^{n_{h}},\left\{t_{\imath j}-s_{j}^{m-1}-M_{k}^{m-1} x_{v}^{2}-r_{i}^{m-1}\right\}Gkm=1nhlnh,{tıjsjm1Mkm1xv2rim1}
and
M k m = 1 n G k n g 1 x i j 2 { t 2 j s j m 1 G k m 1 r ı m 1 } M k m = 1 n G k n g 1 x i j 2 t 2 j s j m 1 G k m 1 r ı m 1 M_(k)^(m)=(1)/(n_(G))sum_(k)^(n_(g))(1)/(x_(ij)^(2)){t_(2j)-s_(j)^(m-1)-G_(k)^(m-1)-r_(ı)^(m-1)}M_{k}^{m}=\frac{1}{n_{G}} \sum_{k}^{n_{g}} \frac{1}{x_{i j}^{2}}\left\{t_{2 j}-s_{j}^{m-1}-G_{k}^{m-1}-r_{\imath}^{m-1}\right\}Mkm=1nGkng1xij2{t2jsjm1Gkm1rım1}
where i i iii and j j jjj are the receiver and source indexes, respectively, l = | i j | l = | i j | l=|i-j|l=|i-j|l=|ij| is the offset index, k = ( ı + j ) / 2 k = ( ı + j ) / 2 k=(ı+j)//2k=(\imath+j) / 2k=(ı+j)/2 is the midpoint index, m m mmm is the iteration index, and n h n h n_(h)n_{h}nh is the fold of coverage. The solutions in equations (C-29) are based on the orthogonality of the shot and receiver axes, and the orthogonality of the midpoint and offet axes. Equations (C-29) can be modified as
s j m = 1 n r i n v { t v j } 1 n r v n r { G k m 1 M k m 1 x i j 2 r 2 m 1 } r i m = 1 n s j n y { t 2 j } 1 n s j n s { G k m 1 M k m 1 x i j 2 s j m 1 } G k m = 1 n h l n h { t i j } 1 n h l n h { s j m 1 M k m 1 x 1 j 2 r i m 1 } s j m = 1 n r i n v t v j 1 n r v n r G k m 1 M k m 1 x i j 2 r 2 m 1 r i m = 1 n s j n y t 2 j 1 n s j n s G k m 1 M k m 1 x i j 2 s j m 1 G k m = 1 n h l n h t i j 1 n h l n h s j m 1 M k m 1 x 1 j 2 r i m 1 {:[s_(j)^(m)=(1)/(n_(r))sum_(i)^(n_(v)){t_(vj)}-(1)/(n_(r))sum_(v)^(n_(r)){G_(k)^(m-1)-M_(k)^(m-1)x_(ij)^(2)-r_(2)^(m-1)}],[r_(i)^(m)=(1)/(n_(s))sum_(j)^(n_(y)){t_(2j)}-(1)/(n_(s))sum_(j)^(n_(s)){G_(k)^(m-1)-M_(k)^(m-1)x_(ij)^(2)-s_(j)^(m-1)}],[G_(k)^(m)=(1)/(n_(h))sum_(l)^(n_(h)){t_(ij)}-(1)/(n_(h))sum_(l)^(n_(h)){s_(j)^(m-1)-M_(k)^(m-1)x_(1j)^(2)-r_(i)^(m-1)}]:}\begin{aligned} & s_{j}^{m}=\frac{1}{n_{r}} \sum_{i}^{n_{v}}\left\{t_{v j}\right\}-\frac{1}{n_{r}} \sum_{v}^{n_{r}}\left\{G_{k}^{m-1}-M_{k}^{m-1} x_{i j}^{2}-r_{2}^{m-1}\right\} \\ & r_{i}^{m}=\frac{1}{n_{s}} \sum_{j}^{n_{y}}\left\{t_{2 j}\right\}-\frac{1}{n_{s}} \sum_{j}^{n_{s}}\left\{G_{k}^{m-1}-M_{k}^{m-1} x_{i j}^{2}-s_{j}^{m-1}\right\} \\ & G_{k}^{m}=\frac{1}{n_{h}} \sum_{l}^{n_{h}}\left\{t_{i j}\right\}-\frac{1}{n_{h}} \sum_{l}^{n_{h}}\left\{s_{j}^{m-1}-M_{k}^{m-1} x_{1 j}^{2}-r_{i}^{m-1}\right\} \end{aligned}sjm=1nrinv{tvj}1nrvnr{Gkm1Mkm1xij2r2m1}rim=1nsjny{t2j}1nsjns{Gkm1Mkm1xij2sjm1}Gkm=1nhlnh{tij}1nhlnh{sjm1Mkm1x1j2rim1}
and
M k m = 1 n G k n C 1 x v 2 { t t } 1 n G k n k 1 x v 2 { s j m 1 G k m 1 r i m 1 } M k m = 1 n G k n C 1 x v 2 t t 1 n G k n k 1 x v 2 s j m 1 G k m 1 r i m 1 M_(k)^(m)=(1)/(n_(G))sum_(k)^(n_(C))(1)/(x_(v)^(2)){t_(t)}-(1)/(n_(G))sum_(k)^(n_(k))(1)/(x_(v)^(2)){s_(j)^(m-1)-G_(k)^(m-1)-r_(i)^(m-1)}M_{k}^{m}=\frac{1}{n_{G}} \sum_{k}^{n_{C}} \frac{1}{x_{v}^{2}}\left\{t_{t}\right\}-\frac{1}{n_{G}} \sum_{k}^{n_{k}} \frac{1}{x_{v}^{2}}\left\{s_{j}^{m-1}-G_{k}^{m-1}-r_{i}^{m-1}\right\}Mkm=1nGknC1xv2{tt}1nGknk1xv2{sjm1Gkm1rim1}
This modificution enables us to compute and store the sum of the traveltime deviations t t t t sumt_(t)\sum t_{\mathfrak{t}}tt, thus circumventing the need for storing the individual traveltime deviations. The process is iterated until an index in that yields the least-squares solution such that the differences between the solutions for s j , τ t , G k s j , τ t , G k s_(j),tau_(t),G_(k)s_{j}, \tau_{t}, G_{k}sj,τt,Gk, and M k M k M_(k)M_{k}Mk from the m m mmm th and ( m 1 m 1 m-1m-1m1 )st iteration are smaller than some specified values.

G. 5 Depth Estimation from Refracted Arrivals

Refer to Figure 3.4-11 a for a sketch of refracted arrivals associated with a flat refractor. We want to estimate the depth to bedrock z w z w z_(w)z_{w}zw (thickness of the weathering layer) at some shot-receiver station. The traveltime t t ttt for the critically refracted arrival associated with a shot S S SSS and receiver R R RRR has thre parts
t = S B v t w + B C v b + C R v w t = S B v t w + B C v b + C R v w t=(SB)/(v_(tw))+(BC)/(v_(b))+(CR)/(v_(w))t=\frac{S B}{v_{t w}}+\frac{B C}{v_{b}}+\frac{C R}{v_{w}}t=SBvtw+BCvb+CRvw
The terms in this equation can be expressed in terms of the near-surface model parameters
t = z w v w cos θ c + x 2 z w tan θ c v b + z w v w cos θ c t = z w v w cos θ c + x 2 z w tan θ c v b + z w v w cos θ c t=(z_(w)^('))/(v_(w)cos theta_(c))+(x-2z_(w)tan theta_(c))/(v_(b))+(z_(w))/(v_(w)cos theta_(c))t=\frac{z_{w}^{\prime}}{v_{w} \cos \theta_{c}}+\frac{x-2 z_{w} \tan \theta_{c}}{v_{b}}+\frac{z_{w}}{v_{w} \cos \theta_{c}}t=zwvwcosθc+x2zwtanθcvb+zwvwcosθc
where x x xxx is the shot-receiver separation, z w z w z_(w)z_{w}zw is the depth to bedrock, and v w v w v_(w)v_{w}vw and v b v b v_(b)v_{b}vb are weathering and bedrock velocities, respectively. The critical angie of refraction θ c θ c theta_(c)\theta_{c}θc is related to the velocities by the relation
sin θ c = v w v b sin θ c = v w v b sin theta_(c)=(v_(w))/(v_(b))\sin \theta_{c}=\frac{v_{w}}{v_{b}}sinθc=vwvb
Combine the first and third terms on the right, and spiit the second term in equation (C-31b) to get
t = 2 z w v w v cos θ c 2 z w sin θ c v b cos θ c + x v b t = 2 z w v w v cos θ c 2 z w sin θ c v b cos θ c + x v b t=(2z_(w))/(v_(wv)cos theta_(c))-(2z_(w)sin theta_(c))/(v_(b)cos theta_(c))+(x)/(v_(b))t=\frac{2 z_{w}}{v_{w v} \cos \theta_{c}}-\frac{2 z_{w} \sin \theta_{c}}{v_{b} \cos \theta_{c}}+\frac{x}{v_{b}}t=2zwvwvcosθc2zwsinθcvbcosθc+xvb
Substitute equation (C-32) into equation (C-33a) and apply some algebra to obtain
t = 2 z w v b 2 v w 2 v b v w + x v b t = 2 z w v b 2 v w 2 v b v w + x v b t=(2z_(w)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(b)v_(w))+(x)/(v_(b))t=\frac{2 z_{w} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{b} v_{w}}+\frac{x}{v_{b}}t=2zwvb2vw2vbvw+xvb
Note that this is the equation of a line
t = t 2 + x v b , t = t 2 + x v b , t=t_(2)+(x)/(v_(b)),t=t_{2}+\frac{x}{v_{b}},t=t2+xvb,
with its slope given by 1 / v 3 1 / v 3 1//v_(3)1 / v_{3}1/v3 - inverse of the bedrock velocity, and the intercept time t 2 t 2 t_(2)t_{2}t2 given by
t ı = 2 z w v b 2 v w 2 v b v w t ı = 2 z w v b 2 v w 2 v b v w t_(ı)=(2z_(w)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(b)v_(w))t_{\imath}=\frac{2 z_{w} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{b} v_{w}}tı=2zwvb2vw2vbvw
By measuring the slope of the line associated with refracted arrivals in Figure 3-4.11a, we estimate the bedrock velocity v 6 v 6 v_(6)v_{6}v6. We also estimate the intercept time t 2 t 2 t_(2)t_{2}t2 by extending the line to x = 0 x = 0 x=0x=0x=0. Finally, we assume a value for the weathering velocity v w v w v_(w)v_{w}vw. Then, equation (C-35) can be rearranged to compute the depth to bedrock z w z w z_(w)z_{w}zw as
z w = v b t w t 2 2 v b 2 v w 2 z w = v b t w t 2 2 v b 2 v w 2 z_(w)=(v_(b)t_(w)t_(2))/(2sqrt(v_(b)^(2)-v_(w)^(2)))z_{w}=\frac{v_{b} t_{w} t_{2}}{2 \sqrt{v_{b}^{2}-v_{w}^{2}}}zw=vbtwt22vb2vw2
This is equation (3-41a) in the text.
The depth to bedrock can also be computed from the crossover distance x c x c x_(c)x_{c}xc where the refracted arrival and the direct arrival coincide (Figure 3-4.112). The equation for the direct arrivals is
t = x v w t = x v w t=(x)/(v_(w))t=\frac{x}{v_{w}}t=xvw
whereas equation (C-34) describes the refracted arrivals. At the crossover distance x c x c x_(c)x_{c}xc, we equate the arrival times in equations (C-34) and (C-37) as
t 1 + x c v b = x c v w . t 1 + x c v b = x c v w . t_(1)+(x_(c))/(v_(b))=(x_(c))/(v_(w)).t_{1}+\frac{x_{c}}{v_{b}}=\frac{x_{c}}{v_{w}} .t1+xcvb=xcvw.
By substituting equation (C-35), we obtain
z v = v b v w x c 2 v b 2 v t 2 ( 1 v w 1 v b ) z v = v b v w x c 2 v b 2 v t 2 1 v w 1 v b z_(v)=(v_(b)v_(w)x_(c))/(2sqrt(v_(b)^(2)-v_(t)^(2)))((1)/(v_(w))-(1)/(v_(b)))z_{v}=\frac{v_{b} v_{w} x_{c}}{2 \sqrt{v_{b}^{2}-v_{t}^{2}}}\left(\frac{1}{v_{w}}-\frac{1}{v_{b}}\right)zv=vbvwxc2vb2vt2(1vw1vb)
By simplifying, we obtain the expression for depth to bedrock in terms of the crossover distance:
z w = 1 2 v b v w v b + v w x c z w = 1 2 v b v w v b + v w x c z_(w)=(1)/(2)sqrt((v_(b)-v_(w))/(v_(b)+v_(w)))x_(c)z_{w}=\frac{1}{2} \sqrt{\frac{v_{b}-v_{w}}{v_{b}+v_{w}}} x_{c}zw=12vbvwvb+vwxc
This is equation (3-41b) in the text.

C. 6 Equations for a Dipping Refractor

Consider the dipping refractor depicted in Figure 3.4-1lc. The traveltime for the refracted arrivals from downdip shooting is given by
t = S A v u + A B v b + B R v w t = S A v u + A B v b + B R v w t^(-)=(SA)/(v_(u))+(AB)/(v_(b))+(BR)/(v_(w))t^{-}=\frac{S A}{v_{u}}+\frac{A B}{v_{b}}+\frac{B R}{v_{w}}t=SAvu+ABvb+BRvw
From the geometry and the variables of Figure 3.4-11c, the terms in equation (C-40a) are explicitly written as
t = z w S v w cos θ c + x cos φ z w S tan θ c ( z w S + x sin φ ) tan θ c v b + z w S + x sin φ v w s cos θ c t = z w S v w cos θ c + x cos φ z w S tan θ c z w S + x sin φ tan θ c v b + z w S + x sin φ v w s cos θ c {:[t^(-)=(z_(wS))/(v_(w)cos theta_(c))],[+(x cos varphi-z_(wS)tan theta_(c)-(z_(wS)+x sin varphi)tan theta_(c))/(v_(b))],[+(z_(wS)+x sin varphi)/(v_(ws)cos theta_(c))]:}\begin{aligned} t^{-} & =\frac{z_{w S}}{v_{w} \cos \theta_{c}} \\ & +\frac{x \cos \varphi-z_{w S} \tan \theta_{c}-\left(z_{w S}+x \sin \varphi\right) \tan \theta_{c}}{v_{b}} \\ & +\frac{z_{w S}+x \sin \varphi}{v_{w s} \cos \theta_{c}} \end{aligned}t=zwSvwcosθc+xcosφzwStanθc(zwS+xsinφ)tanθcvb+zwS+xsinφvwscosθc
Apply some algebra to obtain
t = 2 z w S cos θ c cos φ v w + x sin ( θ c + φ ) v w t = 2 z w S cos θ c cos φ v w + x sin θ c + φ v w t^(-)=(2z_(w)S cos theta_(c)cos varphi)/(v_(w))+(x sin(theta_(c)+varphi))/(v_(w))t^{-}=\frac{2 z_{w} S \cos \theta_{c} \cos \varphi}{v_{w}}+\frac{x \sin \left(\theta_{c}+\varphi\right)}{v_{w}}t=2zwScosθccosφvw+xsin(θc+φ)vw
This is the equation of a line
t = t τ + x v b t = t τ + x v b t^(-)=t_(tau)^(-)+(x)/(v_(b)^(-))t^{-}=t_{\tau}^{-}+\frac{x}{v_{b}^{-}}t=tτ+xvb
with its inverse slope defined as
v b = v w sin ( θ c + φ ) v b = v w sin θ c + φ v_(b)^(-)=(v_(w))/(sin(theta_(c)+varphi))v_{b}^{-}=\frac{v_{w}}{\sin \left(\theta_{c}+\varphi\right)}vb=vwsin(θc+φ)
and the intercept time given by
t z = 2 z w S cos θ c cos φ v w t z = 2 z w S cos θ c cos φ v w t_(z)^(-)=(2z_(wS)cos theta_(c)cos varphi)/(v_(w))t_{\mathrm{z}}^{-}=\frac{2 z_{w S} \cos \theta_{c} \cos \varphi}{v_{w}}tz=2zwScosθccosφvw
Equation (C-41a) can be rewritten for the refracted arrivals from updip shooting (Figure 3.4-11d) as
t + = 2 z w R cos θ c cos φ v w + x sin ( θ c φ ) v w . t + = 2 z w R cos θ c cos φ v w + x sin θ c φ v w . t^(+)=(2z_(wR)cos theta_(c)cos varphi)/(v_(w))+(x sin(theta_(c)-varphi))/(v_(w)).t^{+}=\frac{2 z_{w R} \cos \theta_{c} \cos \varphi}{v_{w}}+\frac{x \sin \left(\theta_{c}-\varphi\right)}{v_{w}} .t+=2zwRcosθccosφvw+xsin(θcφ)vw.
Again, this is the equation of a line
t + = t 1 + + x v b + t + = t 1 + + x v b + t^(+)=t_(1)^(+)+(x)/(v_(b)^(+))t^{+}=t_{1}^{+}+\frac{x}{v_{b}^{+}}t+=t1++xvb+
with its inverse slope defined as
v b + = v w sin ( θ c φ ) v b + = v w sin θ c φ v_(b)^(+)=(v_(w))/(sin(theta_(c)-varphi))v_{b}^{+}=\frac{v_{w}}{\sin \left(\theta_{c}-\varphi\right)}vb+=vwsin(θcφ)
and the intercept time given by
t z + = 2 z w R cos θ c cos φ v w t z + = 2 z w R cos θ c cos φ v w t_(z)^(+)=(2z_(wR)cos theta_(c)cos varphi)/(v_(w))t_{z}^{+}=\frac{2 z_{w R} \cos \theta_{c} \cos \varphi}{v_{w}}tz+=2zwRcosθccosφvw
To compute the refractor dip and bedrock velocity, first, rewrite equations (C-41c) and (C-42c)
θ c + φ = sin 1 v w v b θ c + φ = sin 1 v w v b theta_(c)+varphi=sin^(-1)(v_(w))/(v_(b)^(-))\theta_{c}+\varphi=\sin ^{-1} \frac{v_{w}}{v_{b}^{-}}θc+φ=sin1vwvb
and
θ c φ = sin 1 v w v b + θ c φ = sin 1 v w v b + theta_(c)-varphi=sin^(-1)(v_(w))/(v_(b)^(+))\theta_{c}-\varphi=\sin ^{-1} \frac{v_{w}}{v_{b}^{+}}θcφ=sin1vwvb+
By subtracting equation (C-43b) from (C-43a), we obtain an expression for the refractor dip φ φ varphi\varphiφ :
φ = 1 2 [ sin 1 v w v b sin 1 v w v b + ] φ = 1 2 sin 1 v w v b sin 1 v w v b + varphi=(1)/(2)[sin^(-1)(v_(w))/(v_(b)^(-))-sin^(-1)(v_(w))/(v_(b)^(+))]\varphi=\frac{1}{2}\left[\sin ^{-1} \frac{v_{w}}{v_{b}^{-}}-\sin ^{-1} \frac{v_{w}}{v_{b}^{+}}\right]φ=12[sin1vwvbsin1vwvb+]
This is equation (3-46a) of the text. Measure the slopes of the downdip and updip refracted arrivals in Figure 3.4-11d v b v b -v_(b)^(-)-v_{b}^{-}vband v b + v b + v_(b)^(+)v_{b}^{+}vb+, respectively. Then, assume a value for the weathering velocity t w t w t_(w)t_{w}tw. By direct substitution into equation (C-44), compute the refractor dip φ φ varphi\varphiφ.
To obtain the bedrock velocity v b v b v_(b)v_{b}vb, first, rewrite slopes from equations ( C 41 c ) ( C 41 c ) (C-41c)(\mathrm{C}-41 \mathrm{c})(C41c) and ( C 42 c ) ( C 42 c ) (C-42c)(\mathrm{C}-42 \mathrm{c})(C42c) as
1 v b = sin θ c cos φ + sin φ cos θ c v w 1 v b = sin θ c cos φ + sin φ cos θ c v w (1)/(v_(b)^(-))=(sin theta_(c)cos varphi+sin varphi cos theta_(c))/(v_(w))\frac{1}{v_{b}^{-}}=\frac{\sin \theta_{c} \cos \varphi+\sin \varphi \cos \theta_{c}}{v_{w}}1vb=sinθccosφ+sinφcosθcvw
and
1 v b + = sin θ c cos φ sin φ cos θ c v w 1 v b + = sin θ c cos φ sin φ cos θ c v w (1)/(v_(b)^(+))=(sin theta_(c)cos varphi-sin varphi cos theta_(c))/(v_(w))\frac{1}{v_{b}^{+}}=\frac{\sin \theta_{c} \cos \varphi-\sin \varphi \cos \theta_{c}}{v_{w}}1vb+=sinθccosφsinφcosθcvw
Add equations ( C 45 a ) C 45 a ) C-45a)\mathrm{C}-45 \mathrm{a})C45a) and ( C 45 b ( C 45 b (C-45b(\mathrm{C}-45 \mathrm{~b}(C45 b ) and take the inverse. Then use the relation given by equation (C-32) to obtain
v b = 2 cos φ ( 1 v b + 1 v b + ) v b = 2 cos φ 1 v b + 1 v b + v_(b)=(2cos varphi)/(((1)/(v_(b)^(-))+(1)/(v_(b)^(+))))v_{b}=\frac{2 \cos \varphi}{\left(\frac{1}{v_{b}^{-}}+\frac{1}{v_{b}^{+}}\right)}vb=2cosφ(1vb+1vb+)
This is equation (3-46b) of the text. Finally, we compute the depth to the bedrock at shotreceiver stations by substituting the estimates for refractor dip φ φ varphi\varphiφ from equation (C-44) and the bedrock velocity v b v b v_(b)v_{b}vb from equation (C-46), and the measurements for the intercept times t z t z t_(z)^(-)t_{z}^{-}tzand t 1 + t 1 + t_(1)^(+)t_{1}^{+}t1+from the arrival timos in Figure 3-4.11d into equations (C-41d) and (C-42d) to obtain
z w S = v b v u t 2 2 cos φ v b 2 v w i 2 z w S = v b v u t 2 2 cos φ v b 2 v w i 2 z_(wS)=(v_(b)v_(u)t_(2)^(-))/(2cos varphisqrt(v_(b)^(2)-v_(wi)^(2)))z_{w S}=\frac{v_{b} v_{u} t_{2}^{-}}{2 \cos \varphi \sqrt{v_{b}^{2}-v_{w i}^{2}}}zwS=vbvut22cosφvb2vwi2
and
z w R = v b v w t t + 2 cos φ v b 2 v w 2 z w R = v b v w t t + 2 cos φ v b 2 v w 2 z_(wR)=(v_(b)v_(w)t_(t)^(+))/(2cos varphisqrt(v_(b)^(2)-v_(w)^(2)))z_{w R}=\frac{v_{b} v_{\mathbf{w}} t_{t}^{+}}{2 \cos \varphi \sqrt{v_{b}^{2}-v_{w}^{2}}}zwR=vbvwtt+2cosφvb2vw2
These equations are equivalent to equation (3-46c) of the text.

C. 7 The Plus-Minus Times

Consider the three raypaths in Figure 3.4-12a associated with shot-receiver pairs A D , D G A D , D G AD,DGA D, D GAD,DG, and A G A G AGA GAG. The plus and minus times are defined as
t + = t A B C D + t D E F G t A B F G t + = t A B C D + t D E F G t A B F G t_(+)=t_(ABCD)+t_(DEFG)-t_(ABFG)t_{+}=t_{A B C D}+t_{D E F G}-t_{A B F G}t+=tABCD+tDEFGtABFG
and
t = t A B C D t D E F G + t A B F G t = t A B C D t D E F G + t A B F G t_(-)=t_(ABCD)-t_(DEFG)+t_(ABFG)t_{-}=t_{A B C D}-t_{D E F G}+t_{A B F G}t=tABCDtDEFG+tABFG
The times given on the right side of these equations are the picked values from the first breaks for the three raypaths shown in Figure 3.4-12a. From the raypath configuration, we have the relation
t + = 2 ( C D v w C H v b ) t + = 2 C D v w C H v b t_(+)=2((CD)/(v_(w))-(CH)/(v_(b)))t_{+}=2\left(\frac{C D}{v_{w}}-\frac{C H}{v_{b}}\right)t+=2(CDvwCHvb)
By using the geometric relations from Figure (3.4-12a), equation (C-49a) can be expressed in terms of the critical angle of refraction θ θ theta\thetaθ and depth to bedrock z w j z w j z_(wj)z_{w j}zwj as
t + = 2 ( z w v w cos θ z w tan θ v b ) t + = 2 z w v w cos θ z w tan θ v b t_(+)=2((z_(w))/(v_(w)cos theta)-(z_(w)tan theta)/(v_(b)))t_{+}=2\left(\frac{z_{w}}{v_{w} \cos \theta}-\frac{z_{w} \tan \theta}{v_{b}}\right)t+=2(zwvwcosθzwtanθvb)
Finally, by using the relation (C-32), we have the relation for the plus time t + t + t_(+)t_{+}t+in terms of the near-surface parameters - depth to bedrock z w z w z_(w)z_{w}zw, weathering velocity v w v w v_(w)v_{w}vw, and bedrock velocity v b v b v_(b)v_{b}vb :
t + = 2 z w v b 2 v w 2 v u b v b t + = 2 z w v b 2 v w 2 v u b v b t_(+)=(2z_(w)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(ub)v_(b))t_{+}=\frac{2 z_{w} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{u b} v_{b}}t+=2zwvb2vw2vubvb
This is equation ( 3 48 a ) ( 3 48 a ) (3-48 a)(3-48 a)(348a) of the text.
Now, consider the minus time t t t_(-)t_{-}tdefined by equation (C-48b). By using the raypath configuration depicted in Figure 3.4-12b, we have
t = 2 C D v w + 2 B C v b + C E v b t = 2 C D v w + 2 B C v b + C E v b t_(-)=(2CD)/(v_(w))+(2BC)/(v_(b))+(CE)/(v_(b))t_{-}=\frac{2 C D}{v_{w}}+\frac{2 B C}{v_{b}}+\frac{C E}{v_{b}}t=2CDvw+2BCvb+CEvb
Make substitutions in terms of the near-surface parameters to get
t = 2 z w v z , cos θ + 2 B C v b + 2 z w tan θ v b t = 2 z w v z , cos θ + 2 B C v b + 2 z w tan θ v b t_(-)=(2z_(w))/(v_(z,)cos theta)+(2BC)/(v_(b))+(2z_(w)tan theta)/(v_(b))t_{-}=\frac{2 z_{w}}{v_{z,} \cos \theta}+\frac{2 B C}{v_{b}}+\frac{2 z_{w} \tan \theta}{v_{b}}t=2zwvz,cosθ+2BCvb+2zwtanθvb
By some algebraic manipulation, we gct
t = 2 z w v w cos θ 2 z w tan θ v b + 2 x v b t = 2 z w v w cos θ 2 z w tan θ v b + 2 x v b t_(-)=(2z_(w))/(v_(w)cos theta)-(2z_(w)tan theta)/(v_(b))+(2x)/(v_(b))t_{-}=\frac{2 z_{w}}{v_{w} \cos \theta}-\frac{2 z_{w} \tan \theta}{v_{b}}+\frac{2 x}{v_{b}}t=2zwvwcosθ2zwtanθvb+2xvb
where x x xxx is the source receiver separation A D A D ADA DAD. Compare the first two terms on the right with equation (C-48b), and rewrite equation ( C 49 c C 49 c C-49c\mathrm{C}-49 \mathrm{c}C49c ) to obtain
t = t + + 2 ε v ϕ t = t + + 2 ε v ϕ t_(-)=t_(+)+(2epsi)/(v_(phi))t_{-}=t_{+}+\frac{2 \varepsilon}{v_{\phi}}t=t++2εvϕ
This is equation ( 3 48 c ) ( 3 48 c ) (3-48c)(3-48 \mathrm{c})(348c) of the main text.

C. 8 Generalized Linear Inversion of Refracted Arrivals

For an arbitrary source-receiver geometry, given a set of observed traveltimes associated with the refracted arrivals, we can estimate the parameters associated with a single-layer near-surface model using the generalized linear inversion (GLI). The parameters consist of the refractor velocity, and the velocity and thickness of the near-surface layer at all shot/receiver locations. The GLI solution for the parameters satisfies the requirement that the difference between the observed (picked) refracted arrival times and the estimated (modeled) times is minimum in the least-squares sense. The modeled times are computed using the traveltime equation for refracted arrivals for a flat refractor considered as the base of a weathering layer.
The GLI schemes that allow velocity and thickness of a near-surface layer to vary spatially require iterative strategies (Hampson and Russell, 1984; Schneider and Kuo, 1985; De Amorim et al., 1987). Starting with initial estimates for the near-surface layer velocity and thickness, and an initial estimate for the bedrock velocity, these parumeters are changed such that the difference between the observed (picked) refracted arrival times and the estimated (modeled) times is minimum in the least-squares sense. The GLI method is not only applicable to 2-D line recording but also to 3-D swath recording geometries (Baixas and Du Pont, 1988; Kircheimer, 1988). It is important to parameterize the near-surface layer parsimoniously while conforming with the basic assumptions required for the use of refacted arrivals in estimating the near-surface model.
There are several ways to paramcterize the near-surface layer. The most general formulation would include varying the weathering and the bedrock velocities and the thickness of the weathering layer at all shot/receiver locations. This, however, would require linearizing the problem and iterating over the estimated parameters (Hampson and Russell, 1984; Schneider and Kuo, 1985; De Amorim et al., 1987). In a simplified version of this general formulation, the weathering velocity may be fixed and is assumed to be known. This leaves the weathering thickness and bedrock velocity as spatially varying parameters. A further simplification may be made by defining a polynomial as a function of the space variable for the bedrock velocity (Farrell and Euwema, 1984). In practice, we often find that iterative GLI schemes suffer from
stability problems. When an inversion scheme leads to unstable solutions, the most likely reason is the ill-posed nature of the problem.
In this section, two robust parameterizations of the near-surface layer are presented and the GLI method is used to estimate the associated parameters. In each, we assume that the near-surface is made up of a single weathering layer with a significant velocity contrast at its base. The varable-thickness scheme allows the thickness of the weathering layer to vary spatially, while assuming a fixed known value for the weathering velocity. The bedrock velocity, however, is included in the parameterization and is assumed to be constant. The vartable-velocity scheme a)lows the weathering velocity to vary spatially, while fixing the refractor position at a specified depth. The bedrock velocity, again, is treated as a parameter to be estimated and is asssumed to be constant. We find that in many field data applications, these two inversion schemes are able to remove long-wavelength statics variations from the data.
We want to describe the near-surface with minimal parameterization and consider the model shown in Figure 3.4-13. The traveltime t γ j t γ j t_(gamma j)^(')t_{\gamma j}^{\prime}tγj for the refracted raypath from the shot location S S SSS, to the receiver location R 2 R 2 R_(2)R_{2}R2 is given by
t i j = t S 3 B + t B C + t C R 2 t i j = t S 3 B + t B C + t C R 2 t_(ij)^(')=t_(S_(3)B)+t_(BC)+t_(CR_(2))t_{i j}^{\prime}=t_{S_{3} B}+t_{B C}+t_{C R_{2}}tij=tS3B+tBC+tCR2
The first and the third terms are associated with the raypaths within the weathering layer and the second term is associated with the raypath within the bedrock along the refractor. In Figure 3.4-13, θ c θ c theta_(c)\theta_{c}θc is the critical angle of refraction which is expressed in terms of the weathering and bedrock velocities by the relation θ c = sin 1 ( v w / t b ) θ c = sin 1 v w / t b theta_(c)=sin^(-1)(v_(w)//t_(b))\theta_{c}=\sin ^{-1}\left(v_{w} / t_{b}\right)θc=sin1(vw/tb). Also, as depicted in Figure 3.4-13, we assume a flat refractor. When refractor dip is taken into consideration, the problem cannot be readily linearized.
By rewriting equation (C-50), for a flat or near-flat refractor, we obtain
t i = S y B v w + D E D B C E v b + C R i v w t i = S y B v w + D E D B C E v b + C R i v w t_(i)^(')=(S_(y)B)/(v_(w))+(DE-DB-CE)/(v_(b))+(CR_(i))/(v_(w))t_{i}^{\prime}=\frac{S_{y} B}{v_{w}}+\frac{D E-D B-C E}{v_{b}}+\frac{C R_{i}}{v_{w}}ti=SyBvw+DEDBCEvb+CRivw
By regrouping the terms, we get
t v = ( S j B v w D B v b ) + ( C R z v w C E v b ) + D E v b t v = S j B v w D B v b + C R z v w C E v b + D E v b t_(v)^(')=((S_(j)B)/(v_(w))-(DB)/(v_(b)))+((CR_(z))/(v_(w))-(CE)/(v_(b)))+(DE)/(v_(b))t_{v}^{\prime}=\left(\frac{S_{j} B}{v_{w}}-\frac{D B}{v_{b}}\right)+\left(\frac{C R_{z}}{v_{w}}-\frac{C E}{v_{b}}\right)+\frac{D E}{v_{b}}tv=(SjBvwDBvb)+(CRzvwCEvb)+DEvb
Finally, by rewriting equation ( C 52 C 52 C-52\mathrm{C}-52C52 ) in terms of the near-surface parameters, we obtain the model equation for the refracted arrivals:
t ı j = z j v b 2 v w 2 v b v w + z i v b 2 v w 2 v b v w + x 2 j v b t ı j = z j v b 2 v w 2 v b v w + z i v b 2 v w 2 v b v w + x 2 j v b t_(ıj)^(')=(z_(j)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(b)v_(w))+(z_(i)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(b)v_(w))+(x_(2j))/(v_(b))t_{\imath j}^{\prime}=\frac{z_{j} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{b} v_{w}}+\frac{z_{i} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{b} v_{w}}+\frac{x_{2 j}}{v_{b}}tıj=zjvb2vw2vbvw+zivb2vw2vbvw+x2jvb
In additon to asumming a flat refractor, we fix the bedrock velocity but retain it as a parameter to be estimated. Under these assumptions, equation (C-52) can be rewritten in the following form:
t v j = T j + T ı + s b x i j , ( C 54 ) t v j = T j + T ı + s b x i j , ( C 54 ) t_(vj)^(')=T_(j)+T_(ı)+s_(b)x_(ij),quad(C-54)t_{v j}^{\prime}=T_{j}+T_{\imath}+s_{b} x_{i j}, \quad(C-54)tvj=Tj+Tı+sbxij,(C54)
where
T j = z j v b 2 v w 2 v b v w , T i = z t v b 2 v w 2 t b v w T j = z j v b 2 v w 2 v b v w , T i = z t v b 2 v w 2 t b v w {:[T_(j)=(z_(j)sqrt(v_(b)^(2)-v_(w)^(2)))/(v_(b)v_(w))","],[T_(i)=(z_(t)sqrt(v_(b)^(2)-v_(w)^(2)))/(t_(b)v_(w))]:}\begin{aligned} & T_{j}=\frac{z_{j} \sqrt{v_{b}^{2}-v_{w}^{2}}}{v_{b} v_{w}}, \\ & T_{i}=\frac{z_{t} \sqrt{v_{b}^{2}-v_{w}^{2}}}{t_{b} v_{w}} \end{aligned}Tj=zjvb2vw2vbvw,Ti=ztvb2vw2tbvw
and
s b = 1 / ν b . s b = 1 / ν b . s_(b)=1//nu_(b).s_{b}=1 / \nu_{b} .sb=1/νb.
Note that T , and T 1 T , and  T 1 T_(", and ")T_(1)T_{\text {, and }} T_{1}T, and T1 are the intercept time anomalies at shot and receiver locations, respectively, and s b s b s_(b)s_{b}sb is the bedrock slowness. Hence, for n n nnn shot/receiver stations the parameter vector is p : ( T 1 , T 2 , , T n ; s b ) p : T 1 , T 2 , , T n ; s b p:(T_(1),T_(2),dots,T_(n);s_(b))\mathbf{p}:\left(T_{1}, T_{2}, \ldots, T_{n} ; s_{b}\right)p:(T1,T2,,Tn;sb). We refer to the scheme based on equation (C-54) as the varable-thackness
GLI solution. Once the parameter vector p : ( T 1 , T 2 , , T n ; s b ) p : T 1 , T 2 , , T n ; s b p:(T_(1),T_(2),dots,T_(n);s_(b))\mathbf{p}:\left(T_{1}, T_{2}, \ldots, T_{n} ; s_{b}\right)p:(T1,T2,,Tn;sb) is estimated, then the thickness of the weathering layer below shot and receiver locations can be computed using equations (C55 ) and (C-56), respectively. For m m mmm picks of t ı j t ı j t_(ıj)t_{\imath j}tıj, and n + 1 n + 1 n+1n+1n+1 parameters p : ( T 1 , T 2 , , T n ; s b ) p : T 1 , T 2 , , T n ; s b p:(T_(1),T_(2),dots,T_(n);s_(b))\mathbf{p}:\left(T_{1}, T_{2}, \ldots, T_{n} ; s_{b}\right)p:(T1,T2,,Tn;sb), we have the following set of equations:
( t ı j ) = ( 1 1 x ı ) ( T 2 T 2 s b ) t ı j = 1 1 x ı T 2 T 2 s b ([vdots],[vdots],[vdots],[t_(ıj)^(')],[vdots],[vdots],[vdots])=([,,,,,],[cdots,1,cdots,1,cdots,x_(ı)],[,,,,,])([vdots],[T_(2)],[vdots],[T_(2)],[vdots],[s_(b)])\left(\begin{array}{c} \vdots \\ \vdots \\ \vdots \\ t_{\imath j}^{\prime} \\ \vdots \\ \vdots \\ \vdots \end{array}\right)=\left(\begin{array}{llllll} & & & & & \\ \cdots & 1 & \cdots & 1 & \cdots & x_{\imath} \\ & & & & & \end{array}\right)\left(\begin{array}{c} \vdots \\ T_{2} \\ \vdots \\ T_{2} \\ \vdots \\ s_{b} \end{array}\right)(tıj)=(11xı)(T2T2sb)
By writing these equations in matrix notation, we have
t = L p t = L p t^(')=Lp\mathrm{t}^{\prime}=\mathrm{L} \mathbf{p}t=Lp
where t t t^(')\mathbf{t}^{\prime}t is the column vector of m m mmm-length on the left-hand side of equation ( C 58 ) , L C 58 , L {:C-58),L\left.\mathbf{C}-58\right), \mathbf{L}C58),L is the sparse matrix in the same equation with dimensions m × ( n + 1 ) m × ( n + 1 ) m xx(n+1)m \times(n+1)m×(n+1), and p p p\mathbf{p}p is the column vector of ( n + 1 ) ( n + 1 ) (n+1)(n+1)(n+1)-length on the right-hand side of equation (C-58). Except for the three elements in each row, the L L LLL matrix contains zeros. The GLI solution to equation (C-59) satisfies the requirement that the energy of the error vector
e = t t e = t t e=t-t^(')e=t-t^{\prime}e=tt
is minimum and is given by:
p = ( L T L ) 1 L T t p = L T L 1 L T t p=(L^(T)L)^(-1)L^(T)t\mathbf{p}=\left(\mathbf{L}^{\mathbf{T}} \mathbf{L}\right)^{-\mathbf{1}} \mathbf{L}^{\mathbf{T}} \mathbf{t}p=(LTL)1LTt
where t t ttt denotes the column vector of m m mmm-length that represents the ohserved (picked) refracted arrival times, and T T TTT denotes matrix transposition.
In summary, the variable-thickness scheme for refraction statics is as follows:
(1) Assume a value for the weathering velocity v w v w v_(w)v_{w}vw. This can be varied spatially based on available uphole information.
(2) Estimate the parameter vector p : ( T 1 , T 2 , , T n ; s b ) p : T 1 , T 2 , , T n ; s b p:(T_(1),T_(2),dots,T_(n);s_(b))\mathbf{p}:\left(T_{1}, T_{2}, \ldots, T_{n} ; s_{b}\right)p:(T1,T2,,Tn;sb), hence compute the intercept time anomalies at shot/receiver locations and the bedrock slowness by solving equation (C-61).
(3) Solve equations (C-55) and (C-56) for the weathering layer thickness at shot and receiver stations, respectively.
The shape of the weathering layer derived from the variable-thickness scheme strictly depends on the assumed value for the weathering velocity. To demonstrate this important aspect of the variable-thickness scheme, consider the near-surface model in Figure C-4a with a flat refractor R1, and constant weathering and bedrock velocities. We use equation (C-53) and compute the refracted arrival times associated with shot/receiver locations as indicated in Figure C-4a. Then we use these arrival times in equation (C-61) and assume a value for the weathering velocity different from its trie value to estimate the thickness of the weathering layer at all shot/receiver stations. Figures C-4b,c show the estimated refractor shapes R2, R.3 for two different weathering velocities. Note the significant departure from the true refractor shape R.1. Results of Figure C-4 clearly demonstrate that the estimated refractor shape using the variable-thickness scheme (whether it is based on GRM or GLI) does not yield the true refractor shape. Instead, the uncertainty in weathering velocity significantly influences the implied refractor shape.
We now consider an alternative parameterization for the near-surface model. We assume a flat base of weathering as in Figure 3.4-13. This assumption makes the weathering thickness a known quantity in equation (C-53), and leaves the weathering and bedrock velocities as unknown parameters to be estimated. We take the similar view as in the variable-thickness scheme, and
FIG. C-4. (a) A single-layered near-surface model with a flat refractor R l i v w = 3000 f / s , v b = 9000 R l i v w = 3000 f / s , v b = 9000 Rl_(i)v_(w)=3000f//s,v_(b)=9000\mathbf{R l}_{i} v_{w}=3000 \mathrm{f} / \mathrm{s}, v_{b}=9000Rlivw=3000f/s,vb=9000 f / s f / s f//s\mathrm{f} / \mathrm{s}f/s. Shot locations are denoted by x x x\mathrm{x}x and receiver locations are denoted by the vertical bars. Traveltimes computed from the model in (a) and equation (C-53) are put into the varuable-thickness GLI inversion scheme (equation 2-5) to obtain the results shown in (b) where the weathering velocity is assumed to be 3500 f / s 3500 f / s 3500f//s3500 \mathrm{f} / \mathrm{s}3500f/s, and (c) where the weathering velocity is assumed to be 2500 f / s 2500 f / s 2500f//s2500 \mathrm{f} / \mathrm{s}2500f/s. The estimated refractor shapes are denoted by R 2 R 2 R2\mathrm{R} 2R2 and R 3 R 3 R3\mathrm{R} 3R3. Note the departure from the true location of the flat refractor R 1 R 1 R1\mathrm{R} 1R1 due to the uncertainty in the weathering velocity.
FIG. C-5. (a) Same model as in Figure C-4a. (b) Results of the variable-velocity GLI inversion scheme (equation 2-13) using the traveltimes computed from equation (C-53) and the model in (a) with an assumed refractor position R 2 R 2 R2\mathrm{R} 2R2 that is different from the true position R 1 R 1 R1\mathrm{R} 1R1 of the reftactor. The true weathering and bedrock velocities, v w v w v_(w)v_{w}vw and v b v b v_(b)v_{b}vb, are 3000 f / s 3000 f / s 3000f//s3000 \mathrm{f} / \mathrm{s}3000f/s and 9000 f / s 9000 f / s 9000f//s9000 \mathrm{f} / \mathrm{s}9000f/s, respectively. Shot locations are denoted by x x xxx and receiver locations are denoted by vertical bars. While the GLI inversion yields the true refractor velocity, note the spatially varying adjustment of the weathering velocity to the change of the refractor position from R 1 R 1 R1\mathrm{R} 1R1 to R 2 R 2 R2\mathrm{R} 2R2 to compensete for the thickness R.1-R2.
further assume the bedrock velocity to be a constant parameter. Under these implicit constraints, equation (C-53) takes the form
t i j = α j z j + α 2 z ı + s 6 x ı j , t i j = α j z j + α 2 z ı + s 6 x ı j , t_(ij)^(')=alpha_(j)z_(j)+alpha_(2)z_(ı)+s_(6)x_(ıj),t_{i j}^{\prime}=\alpha_{j} z_{j}+\alpha_{2} z_{\imath}+s_{6} x_{\imath j},tij=αjzj+α2zı+s6xıj,
where
α J = s w J 2 s b 2 , α 2 = s w i t 2 s b 2 , s w = 1 / ψ w α J = s w J 2 s b 2 , α 2 = s w i t 2 s b 2 , s w = 1 / ψ w {:[alpha_(J)=sqrt(s_(wJ)^(2)-s_(b)^(2))","],[alpha_(2)=sqrt(s_(wit)^(2)-s_(b)^(2))","],[s_(w)=1//psi_(w)]:}\begin{gathered} \alpha_{J}=\sqrt{s_{w J}^{2}-s_{b}^{2}}, \\ \alpha_{2}=\sqrt{s_{w i t}^{2}-s_{b}^{2}}, \\ s_{w}=1 / \psi_{w} \end{gathered}αJ=swJ2sb2,α2=swit2sb2,sw=1/ψw
and
s b = 1 / v b s b = 1 / v b s_(b)=1//v_(b)s_{b}=1 / v_{b}sb=1/vb
Hence, for n n nnn shot/receiver stations, the parameter vector is p : ( α 1 , α 2 , , α n ; s b ) p : α 1 , α 2 , , α n ; s b p:(alpha_(1),alpha_(2),dots,alpha_(n);s_(b))\mathbf{p}:\left(\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n} ; s_{b}\right)p:(α1,α2,,αn;sb). We refer to the scheme based on equation (C-62) as the varable-velocrty GLI solution. Once the parameter vector p : ( α 1 , α 2 , , α n ; s b ) p : α 1 , α 2 , , α n ; s b p:(alpha_(1),alpha_(2),dots,alpha_(n);s_(b))\mathbf{p}:\left(\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n} ; s_{b}\right)p:(α1,α2,,αn;sb) is estimated, then the weathering velocity below shot and receiver locations can be computed using equations (C-63) and (C-64), respectively. For m m mmm picks of t z t z t_(z)t_{z}tz, and n + 1 n + 1 n+1n+1n+1 parameters p : ( α 1 , α 2 , , α n ; s b ) p : α 1 , α 2 , , α n ; s b p:(alpha_(1),alpha_(2),dots,alpha_(n);s_(b))\mathbf{p}:\left(\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n} ; s_{b}\right)p:(α1,α2,,αn;sb), we have the following set of equations:
We write these equations in matrix notation as in equation (C-59), where t t t^(')\mathrm{t}^{\prime}t is the column vector of m m mmm-length on the left-hand side of equation (C-67), L L LLL is the sparse matrix in the same equation with dimensions m × ( n + 1 ) m × ( n + 1 ) m xx(n+1)m \times(n+1)m×(n+1), and p p p\mathbf{p}p is the column vector of ( n + 1 ) ( n + 1 ) (n+1)(n+1)(n+1)-length on the right-hand side of equation (C-67). Except for the three elements in each row, the L L L\mathbf{L}L matrix contains zeros. The GLI solution is given by equation (C-61) where the L L L\mathbf{L}L matrix is defined as in equation (C-67).
In summary, the variable-velocity scheme for refraction statics is as follows:
(1) Specify a flat datum to which shot and receivers are to be lowered along vertical raypaths.
(2) Estimate the parameters: p : ( α 1 , α 2 , , α n ; s b ) p : α 1 , α 2 , , α n ; s b p:(alpha_(1),alpha_(2),dots,alpha_(n);s_(b))\mathbf{p}:\left(\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n} ; s_{b}\right)p:(α1,α2,,αn;sb) using the GLI solution given by equation (C-61) where the L L LLL matrix is defined as in equation (C-67).
(3) Solve equations (C-63) and (C-64) for the weathering velocity at shot and receiver stations, respectively.
The estimated weathering velocity from the variable-velocity scheme depends on the assumed refractor position. Consider the near-surface model in Figure C-5a, with a flat refractor R 1 R 1 R1\mathrm{R} 1R1, and constant weathering and bedrock velocities. We use equation (C-53) and compute the refracted arrival times associated with shot/receiver locations as indicated in Figure C-5a. We then use these arrival times in equation (C-61) and assume a refractor position R 2 R 2 R2\mathbf{R} 2R2 to estimate the weathering velocity at all shot/receiver stations. Figure C-5b shows the estimated weathering velocity which departs from the true value v w v w v_(w)v_{w}vw. The difference arises from compensating for the difference between the true refractor position R l R l Rl\mathrm{Rl}Rl and the assumed refractor position R.2 (Figure C-5a).
In equations ( C 58 C 58 C-58\mathrm{C}-58C58 ) and ( C 67 C 67 C-67\mathrm{C}-67C67 ), we made no distinction between a shot and a receiver if they occupy the same location on the surface. This strictly surface-consistent solution is of course not valid for a dynamite source. However, shots can be brought up to surface with an uphole correction prior to setting up equations (C-58) and (C-67).
For most field data applications, both the variable-thickness and the variable-velocity schemes yield comparable staties solutions. The solution from the variable-thickness scheme is sensitive to the uncertainty in weathering velocity, and the solution from the variable-velocity scheme is influenced by the assumed depth of the flat refractor.

C. 9 Refraction Traveltime Tomography

Return to equation (C-52) and re-express it in the following manner (De Amorim et al., 1987):
t i j = s w j Z j + s w 1 Z t + s b X i j t i j = s w j Z j + s w 1 Z t + s b X i j t_(ij)^(')=s_(wj)Z_(j)+s_(w1)Z_(t)+s_(b)X_(ij)t_{i j}^{\prime}=s_{w j} Z_{j}+s_{w 1} Z_{t}+s_{b} X_{i j}tij=swjZj+sw1Zt+sbXij
where
Z j = z j cos θ j , Z i = z 2 cos θ 2 , X 2 j = x 2 j z j tan θ j z 2 tan θ 1 , s w = 1 v w , Z j = z j cos θ j , Z i = z 2 cos θ 2 , X 2 j = x 2 j z j tan θ j z 2 tan θ 1 , s w = 1 v w , {:[Z_(j)=(z_(j))/(cos theta_(j))","],[Z_(i)=(z_(2))/(cos theta_(2))","],[X_(2j)=x_(2j)-z_(j)tan theta_(j)-z_(2)tan theta_(1)","],[s_(w)=(1)/(v_(w))","]:}\begin{gathered} Z_{j}=\frac{z_{j}}{\cos \theta_{j}}, \\ Z_{i}=\frac{z_{2}}{\cos \theta_{2}}, \\ X_{2 j}=x_{2 j}-z_{j} \tan \theta_{j}-z_{2} \tan \theta_{1}, \\ s_{w}=\frac{1}{v_{w}}, \end{gathered}Zj=zjcosθj,Zi=z2cosθ2,X2j=x2jzjtanθjz2tanθ1,sw=1vw,
and
s b = 1 v b s b = 1 v b s_(b)=(1)/(v_(b))s_{b}=\frac{1}{v_{b}}sb=1vb
In matrix form, equation (C-68) now is writter as follows:
( t ı ) = ( Z 2 Z 1 X v ȷ ) ( s w j s w s s b ) t ı = Z 2 Z 1 X v ȷ s w j s w s s b ([vdots],[vdots],[vdots],[t_(ı)^(')],[vdots],[vdots],[vdots])=([],[cdots,Z_(2),cdots,Z_(1),cdots,X_(vȷ)],[,,,,,])([vdots],[s_(wj)],[vdots],[s_(ws)],[vdots],[s_(b)])\left(\begin{array}{c} \vdots \\ \vdots \\ \vdots \\ t_{\imath}^{\prime} \\ \vdots \\ \vdots \\ \vdots \end{array}\right)=\left(\begin{array}{cccccc} \\ \cdots & Z_{2} & \cdots & Z_{1} & \cdots & X_{v \jmath} \\ & & & & & \end{array}\right)\left(\begin{array}{c} \vdots \\ s_{w j} \\ \vdots \\ s_{w s} \\ \vdots \\ s_{b} \end{array}\right)(tı)=(Z2Z1Xvȷ)(swjswssb)
Consider an initial estimate of the parameter vector p : ( , s w , , s w r , , s b ) p : , s w , , s w r , , s b p:(cdots,s_(w),cdots,s_(wr),cdots,s_(b))\mathbf{p}:\left(\cdots, s_{w}, \cdots, s_{w r}, \cdots, s_{b}\right)p:(,sw,,swr,,sb). We want to minimize the difference between the observed and the modeled times by iteratively perturbing the initial estimate of the parameter vector. A change Δ p Δ p Delta p\Delta pΔp in the paramater vector will change the modeled times as follows:
[ t ı j ] modeled = [ t ı j ] mittal + [ t ı j p ] modeled Δ p . t ı j modeled  = t ı j mittal  + t ı j p modeled  Δ p . [t_(ıj)^(')]_("modeled ")=[t_(ıj)^(')]_("mittal ")+[(delt_(ıj)^('))/(del p)]_("modeled ")Delta p.\left[t_{\imath j}^{\prime}\right]_{\text {modeled }}=\left[t_{\imath j}^{\prime}\right]_{\text {mittal }}+\left[\frac{\partial t_{\imath j}^{\prime}}{\partial p}\right]_{\text {modeled }} \Delta p .[tıj]modeled =[tıj]mittal +[tıjp]modeled Δp.
The error in modeling the traveltimes is given by
e 2 j = [ t 2 j ] observed [ t 2 j ] madeled e 2 j = t 2 j observed  t 2 j madeled  e_(2j)=[t_(2j)]_("observed ")-[t_(2j)^(')]_("madeled ")e_{2 j}=\left[t_{2 j}\right]_{\text {observed }}-\left[t_{2 j}^{\prime}\right]_{\text {madeled }}e2j=[t2j]observed [t2j]madeled 
Substitute equation (C-71) into equation (C-72) to obtain
e i j = [ t ı j ] obgerved [ t ı j ] mitial [ t i j p ] modeled Δ p e i j = t ı j obgerved  t ı j mitial  t i j p modeled  Δ p e_(ij)=[t_(ıj)]_("obgerved ")-[t_(ıj)^(')]_("mitial ")-[(delt_(ij)^('))/(del p)]_("modeled ")Delta pe_{i j}=\left[t_{\imath j}\right]_{\text {obgerved }}-\left[t_{\imath j}^{\prime}\right]_{\text {mitial }}-\left[\frac{\partial t_{i j}^{\prime}}{\partial p}\right]_{\text {modeled }} \Delta peij=[tıj]obgerved [tıj]mitial [tijp]modeled Δp
Now define the difference Δ t ı Δ t ı Deltat_(ı)\Delta t_{\imath}Δtı between the observed traveltimes t ı j t ı j t_(ıj)t_{\imath j}tıj and the initial estimate of the modeled traveltimes t i j t i j t_(ij)^(')t_{i j}^{\prime}tij, and rewrite equation (C-73) to get
e ı ȷ = Δ t ı ȷ t ı ȷ p Δ p e ı ȷ = Δ t ı ȷ t ı ȷ p Δ p e_(ıȷ)=Deltat_(ıȷ)-(delt_(ıȷ)^('))/(del p)Delta pe_{\imath \jmath}=\Delta t_{\imath \jmath}-\frac{\partial t_{\imath \jmath}^{\prime}}{\partial p} \Delta peıȷ=ΔtıȷtıȷpΔp
The second term on the right is the amount of change in Δ t i j Δ t i j Deltat_(ij)\Delta t_{i j}Δtij as a result of the change in the parameter Δ p Δ p Delta p\Delta pΔp. Define this term as Δ t 1 y Δ t 1 y Deltat_(1y)^(')\Delta t_{1 y}^{\prime}Δt1y, and rewrite equation (C-74) once more to obtain
e ı = Δ t ı Δ t ı e ı = Δ t ı Δ t ı e_(ı)=Deltat_(ı)-Deltat_(ı)^(')e_{\imath}=\Delta t_{\imath}-\Delta t_{\imath}^{\prime}eı=ΔtıΔtı
where
Δ t v j = t v p Δ p Δ t v j = t v p Δ p Deltat_(vj)^(')=(delt_(v)^('))/(del p)Delta p\Delta t_{\mathfrak{v} j}^{\prime}=\frac{\partial t_{\mathfrak{v}}^{\prime}}{\partial p} \Delta pΔtvj=tvpΔp
The derivatives t 2 j / p t 2 j / p delt_(2j)^(')//del p\partial t_{2 j}^{\prime} / \partial pt2j/p in equation (C-76) can be computed by differentiating the model equation ( C 68 C 68 C-68\mathrm{C}-68C68 ) with respect to each of the paraneters:
t v s w j Z j , t ı j s w / 1 Z v , t v s w j Z j , t ı j s w / 1 Z v , {:[(delt_(v)^('))/(dels_(wj))-=Z_(j)","],[(delt_(ıj)^('))/(dels_(w//1))-=Z_(v)","]:}\begin{aligned} & \frac{\partial t_{\mathfrak{v}}^{\prime}}{\partial s_{w j}} \equiv Z_{j}, \\ & \frac{\partial t_{\imath j}^{\prime}}{\partial s_{w / 1}} \equiv Z_{v}, \end{aligned}tvswjZj,tıjsw/1Zv,
and
t ı ȷ s b X 2 ȷ t ı ȷ s b X 2 ȷ (delt_(ıȷ)^('))/(dels_(b))-=X_(2ȷ)\frac{\partial t_{\imath \jmath}^{\prime}}{\partial s_{b}} \equiv X_{2 \jmath}tıȷsbX2ȷ
These then are substituted back into the right-hand side of equation (C-76) to get
Δ t i j = Z j Δ s w j + Z ı Δ s w 2 + X ı j Δ s b . Δ t i j = Z j Δ s w j + Z ı Δ s w 2 + X ı j Δ s b . Deltat_(ij)^(')=Z_(j)Deltas_(wj)+Z_(ı)Deltas_(w_(2))+X_(ıj)Deltas_(b).\Delta t_{i j}^{\prime}=Z_{j} \Delta s_{w j}+Z_{\imath} \Delta s_{w_{2}}+X_{\imath j} \Delta s_{b} .Δtij=ZjΔswj+ZıΔsw2+XıjΔsb.
Examine the structure of equation (C-78) and note that, instead of modeling refraction traveltimes by way of equation ( C 68 C 68 C-68\mathrm{C}-68C68 ), we can model the change in traveltimes by way of equation (C-78), and thus estimate the near-surface parameters. Hence, for n n nnn shot/receiver stations, the parameter vector is Δ p : ( Δ s w 1 , Δ s w 2 , , Δ s w n n , Δ s b ) Δ p : Δ s w 1 , Δ s w 2 , , Δ s w n n , Δ s b Deltap:(Deltas_(w1),Deltas_(w2),cdots,Deltas_(wnn),Deltas_(b))\Delta \mathbf{p}:\left(\Delta s_{w 1}, \Delta s_{w 2}, \cdots, \Delta s_{w n n}, \Delta s_{b}\right)Δp:(Δsw1,Δsw2,,Δswnn,Δsb). We refer to the scheme based on equation (C-78) as the terateve GLI solution. For m m mmm picks of t 2 t 2 t_(2)t_{2}t2, and n + 1 n + 1 n+1n+1n+1 parameters Δ p : ( Δ s w 1 , Δ s w 2 , , Δ s w n , Δ s b ) Δ p : Δ s w 1 , Δ s w 2 , , Δ s w n , Δ s b Deltap:(Deltas_(w1),Deltas_(w2),cdots,Deltas_(wn),Deltas_(b))\Delta \mathbf{p}:\left(\Delta s_{w 1}, \Delta s_{w 2}, \cdots, \Delta s_{w n}, \Delta s_{b}\right)Δp:(Δsw1,Δsw2,,Δswn,Δsb), we have the following set of equations:
( Δ t ı ȷ ) = ( Z 3 Z ı X ı ȷ ) ( Δ s w j Δ s w } Δ s b ) . Δ t ı ȷ = Z 3 Z ı X ı ȷ Δ s w j Δ s w } Δ s b . ([vdots],[vdots],[vdots],[Deltat_(ıȷ)^(')],[vdots],[vdots],[vdots])=([],[cdots,Z_(3),cdots,Z_(ı),cdots,X_(ıȷ)])([vdots],[Deltas_(wj)],[vdots],[Deltas_(w})],[vdots],[Deltas_(b)]).\left(\begin{array}{c} \vdots \\ \vdots \\ \vdots \\ \Delta t_{\imath \jmath}^{\prime} \\ \vdots \\ \vdots \\ \vdots \end{array}\right)=\left(\begin{array}{llllll} \\ \cdots & Z_{3} & \cdots & Z_{\imath} & \cdots & X_{\imath \jmath} \end{array}\right)\left(\begin{array}{c} \vdots \\ \Delta s_{w j} \\ \vdots \\ \Delta s_{w\}} \\ \vdots \\ \Delta s_{b} \end{array}\right) .(Δtıȷ)=(Z3ZıXıȷ)(ΔswjΔsw}Δsb).
We write these equations in matrix notation as in equation (C-59) to obtain
Δ t = t p Δ p Δ t = t p Δ p Deltat^(')=(delt^('))/(delp)Deltap\Delta \mathrm{t}^{\prime}=\frac{\partial \mathbf{t}^{\prime}}{\partial \mathbf{p}} \Delta \mathrm{p}Δt=tpΔp
or
Δ t = L Δ p Δ t = L Δ p Deltat^(')=LDeltap\Delta \mathbf{t}^{\prime}=\mathrm{L} \Delta \mathrm{p}Δt=LΔp
where Δ t Δ t Deltat^(')\Delta \mathbf{t}^{\prime}Δt is the column vector of m-length on the left-hand side of equation (C-79), L L L\mathrm{L}L is the sparse matrix in the same equation with nonzero elements as the partial derivatives t / p t / p delt^(')//del p\partial t^{\prime} / \partial pt/p and with dimensions m × ( n + 1 ) m × ( n + 1 ) m xx(n+1)m \times(n+1)m×(n+1), and p p ppp is the column vector of ( n + 1 ) ( n + 1 ) (n+1)(n+1)(n+1)-length on the right-hand side of equation (C-79). Except for the three elements in each row, the L L L\mathbf{L}L matrix contains zeros,
The GLI solution to equation (C-81) satisfies the requirement that the energy of the error vector
e = Δ t Δ t e = Δ t Δ t e=Deltat-Deltat^(')\mathbf{e}=\Delta \mathrm{t}-\Delta \mathrm{t}^{\prime}e=ΔtΔt
is minimum and is given by
Δ p = ( L T L ) 1 L T Δ t , Δ p = L T L 1 L T Δ t , Deltap=(L^(T)L)^(-1)L^(T)Delta t,\Delta \mathbf{p}=\left(\mathbf{L}^{\mathbf{T}} \mathbf{L}\right)^{-\mathbf{1}} \mathbf{L}^{\mathbf{T}} \Delta t,Δp=(LTL)1LTΔt,
where Δ t Δ t Delta t\Delta tΔt denotes the column vector of m m mmm-length that represents the difference between the observed (picked) refracted arrival times and the initial estimate of the modeled times, and T T TTT denotes matrix transposition.
In summary, the iterative scheme for refraction statics is as follows:
(a) Specify a flat datum to which shot and receivers are to be lowered along vertical raypaths.
(b) Also specify a set of initial model parameters p : ( s w : 1 , s w 2 , , s w n , s b ) p : s w : 1 , s w 2 , , s w n , s b p:(s_(w:1),s_(w2),cdots,s_(wn),s_(b))\mathbf{p}:\left(s_{w: 1}, s_{w 2}, \cdots, s_{w n}, s_{b}\right)p:(sw:1,sw2,,swn,sb).
(c) Compute Δ t 5 j Δ t 5 j Deltat_(5j)\Delta t_{5 j}Δt5j, the time difference between the picked (observed) times t 5 j t 5 j t_(5j)t_{5 j}t5j and the initial modeled times t t j t t j t_(tj)^(')t_{t j}^{\prime}ttj.
(d) Estimate the change in parameters: Δ p : ( Δ s w 1 , Δ s w 2 , , Δ s w n , Δ s b ) Δ p : Δ s w 1 , Δ s w 2 , , Δ s w n , Δ s b Deltap:(Deltas_(w1),Deltas_(w2),cdots,Deltas_(wn),Deltas_(b))\Delta \mathbf{p}:\left(\Delta s_{w 1}, \Delta s_{w 2}, \cdots, \Delta s_{w n}, \Delta s_{b}\right)Δp:(Δsw1,Δsw2,,Δswn,Δsb), by way of the GLI solution given by equation (C-83).
(e) Update the paramater vector p + Δ p p + Δ p p+Deltap\mathbf{p}+\Delta \mathbf{p}p+Δp, and compute new modeled times t i j t i j t_(ij)^(')t_{i j}^{\prime}tij.
(f) Iterate steps (c), (d), and (e) to get a final estimate of the parameter vector p p p\mathbf{p}p.
The parameter vector for the iterative scheme described above comprises laterally varying weathering velocity and a constant bedrock velocity. Depth to the refractor is assumed to be known. An alternative parameterization of the near-surface model may involve estimating a laterally varying weathering velocity and depth to the refractor while assuming a known value for the bedrock velocity.
Rearrange the terms in equation (C-62):
t ı j = t ı j s b x 1 j t ı j = t ı j s b x 1 j t_(ıj)^('')=t_(ıj)^(')-s_(b)x_(1j)t_{\imath j}^{\prime \prime}=t_{\imath j}^{\prime}-s_{b} x_{1 j}tıj=tıjsbx1j
so that
t i j = T j + T i t i j = T j + T i t_(ij)^('')=T_(j)+T_(i)t_{i j}^{\prime \prime}=T_{j}+T_{i}tij=Tj+Ti
Equation (C-84) implies that, in this scheme, we deal with picked times that have been linearmoveout corrected using the assumed value for the bedrock velocity. By way of equations ( C 55 C 55 C-55\mathrm{C}-55C55 ) and (C-56), equation (C-85) is expressed as follows:
t y j = z j s w j 2 s b 2 + z z s w t 2 s b 2 t y j = z j s w j 2 s b 2 + z z s w t 2 s b 2 t_(yj)^('')=z_(j)sqrt(s_(wj)^(2)-s_(b)^(2))+z_(z)sqrt(s_(wt)^(2)-s_(b)^(2))t_{y j}^{\prime \prime}=z_{j} \sqrt{s_{w j}^{2}-s_{b}^{2}}+z_{z} \sqrt{s_{w t}^{2}-s_{b}^{2}}tyj=zjswj2sb2+zzswt2sb2
Compute the partial derivatives of the parameters to be estimated - depth to refractor and weathering velocity at shot and receiver locations:
t i j z j = s w j 2 s b 2 Z j , t i j z k = s w i 2 s b 2 Z i t i j z j = s w j 2 s b 2 Z j , t i j z k = s w i 2 s b 2 Z i {:[(delt_(ij)^(''))/(delz_(j))=sqrt(s_(wj)^(2)-s_(b)^(2))-=Z_(j)","],[(delt_(ij)^(''))/(delz_(k))=sqrt(s_(wi)^(2)-s_(b)^(2))-=Z_(i)]:}\begin{aligned} & \frac{\partial t_{i j}^{\prime \prime}}{\partial z_{j}}=\sqrt{s_{w j}^{2}-s_{b}^{2}} \equiv Z_{j}, \\ & \frac{\partial t_{i j}^{\prime \prime}}{\partial z_{k}}=\sqrt{s_{w i}^{2}-s_{b}^{2}} \equiv Z_{i} \end{aligned}tijzj=swj2sb2Zj,tijzk=swi2sb2Zi
t t j s w j = z j s w j s w j 2 s b 2 S w j t t j s w j = z j s w j s w j 2 s b 2 S w j (delt_(tj)^(''))/(dels_(wj))=(z_(j)s_(wj))/(sqrt(s_(wj)^(2))-s_(b)^(2))-=S_(wj)\frac{\partial t_{t j}^{\prime \prime}}{\partial s_{w j}}=\frac{z_{j} s_{w j}}{\sqrt{s_{w j}^{2}}-s_{b}^{2}} \equiv S_{w j}ttjswj=zjswjswj2sb2Swj
and
t 2 s t i n = z 2 s w i s w 1 2 s b 2 S w 11 t 2 s t i n = z 2 s w i s w 1 2 s b 2 S w 11 (delt_(2)^(''))/(dels_(tin))=(z_(2)s_(wi))/(sqrt(s_(w1)^(2)-s_(b)^(2)))-=S_(w 11)\frac{\partial t_{2}^{\prime \prime}}{\partial s_{t i n}}=\frac{z_{2} s_{w i}}{\sqrt{s_{w 1}^{2}-s_{b}^{2}}} \equiv S_{w 11}t2stin=z2swisw12sb2Sw11
Now rewrite equation (C-76) in terms of the new variable t t t^('')t^{\prime \prime}t to obtain
Δ t = t p Δ p Δ t = t p Δ p Deltat^('')=(delt^(''))/(del p)Delta p\Delta t^{\prime \prime}=\frac{\partial t^{\prime \prime}}{\partial p} \Delta pΔt=tpΔp
and substitute equations ( 2 49 a , b , c , d ) ( 2 49 a , b , c , d ) (2-49a,b,c,d)(2-49 \mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d})(249a,b,c,d) to get the model equation
Δ t = Z 3 Δ z 3 + Z 2 Δ z 2 + S w 3 Δ s w 3 + S w 2 Δ s w 3 Δ t = Z 3 Δ z 3 + Z 2 Δ z 2 + S w 3 Δ s w 3 + S w 2 Δ s w 3 Deltat^('')=Z_(3)Deltaz_(3)+Z_(2)Deltaz_(2)+S_(w3)Deltas_(w3)+S_(w_(2))Deltas_(w3)\Delta t^{\prime \prime}=Z_{3} \Delta z_{3}+Z_{2} \Delta z_{2}+S_{w 3} \Delta s_{w 3}+S_{w_{2}} \Delta s_{w 3}Δt=Z3Δz3+Z2Δz2+Sw3Δsw3+Sw2Δsw3
Finally, similar to equation (C-79), we have the following set of equations:
( Δ t 2 j ) = ( z j z 2 S w , S w 1 ) ( Δ z j Δ z 1 Δ s w , j Δ s 1 z 2 ) . Δ t 2 j = z j z 2 S w , S w 1 Δ z j Δ z 1 Δ s w , j Δ s 1 z 2 . ([vdots],[vdots],[Deltat_(2j)^('')],[vdots],[vdots],[vdots])=([],[cdots,z_(j),cdots,z_(2),cdots,S_(w,),cdots,S_(w1),cdots],[,,,,,,,,])([vdots],[Deltaz_(j)],[vdots],[Deltaz_(1)],[vdots],[Deltas_(w,j)],[vdots],[Deltas_(1z2)],[vdots]).\left(\begin{array}{c} \vdots \\ \vdots \\ \Delta t_{2 j}^{\prime \prime} \\ \vdots \\ \vdots \\ \vdots \end{array}\right)=\left(\begin{array}{lllllllll} \\ \cdots & z_{j} & \cdots & z_{2} & \cdots & S_{w,} & \cdots & S_{w 1} & \cdots \\ & & & & & & & & \end{array}\right)\left(\begin{array}{c} \vdots \\ \Delta z_{j} \\ \vdots \\ \Delta z_{1} \\ \vdots \\ \Delta s_{w, j} \\ \vdots \\ \Delta s_{1 z 2} \\ \vdots \end{array}\right) .(Δt2j)=(zjz2Sw,Sw1)(ΔzjΔz1Δsw,jΔs1z2).
Follow the steps which involve equations (C-80) through (C-83) to estimate the paraneter vector p : ( , z j , , z t , , s w j , , s w 1 ) p : , z j , , z t , , s w j , , s w 1 p:(cdots,z_(j),cdots,z_(t),cdots,s_(wj),cdots,s_(w1))\mathbf{p}:\left(\cdots, z_{j}, \cdots, z_{t}, \cdots, s_{w j}, \cdots, s_{w 1}\right)p:(,zj,,zt,,swj,,sw1).

C. 10 L 1 10 L 1 10L_(1)10 L_{1}10L1-Norm Refraction Statics

The generalized linear inversion method applied to residual and refraction statics is based on minimization of the quantity
E = i j t i j t i j 2 E = i j t i j t i j 2 E=sum_(ij)||t_(ij)-t_(ij)^(')||^(2)E=\sum_{i j}\left\|t_{i j}-t_{i j}^{\prime}\right\|^{2}E=ijtijtij2
where t 33 t 33 t_(33)t_{33}t33 are the actual traveltime picks and t 2 j t 2 j t_(2j)^(')t_{2 j}^{\prime}t2j are the modeled traveltimes defined by equation (C-24a) for residual statics and (C-54) for refraction statics.
The minimization norm defined by equation (C-91) is formally referred to as the L 2 L 2 L_(2)L_{2}L2 norm. For statics applications, it may be desirable to use the L 1 L 1 L_(1)L_{1}L1 minimization norm defined by
E = v j t i j t i j E = v j t i j t i j E=sum_(vj)||t_(ij)-t_(ij)^(')||E=\sum_{v j}\left\|t_{i j}-t_{i j}^{\prime}\right\|E=vjtijtij
Outliers in picked times can cause biased results from the L 2 L 2 L_(2)L_{2}L2-norm, whereas, they may be better handled by the L 1 L 1 L_(1)L_{1}L1-norm schemes. The L 2 L 2 L_(2)L_{2}L2-norm solutions to equations (C-24a) and (C-54) are expressed by the generalized linear inversion formula (equations C 28 C 28 C-28\mathrm{C}-28C28 or C 61 C 61 C-61\mathrm{C}-61C61 ). Whereas, the L 1 L 1 L_(1)L_{1}L1-norm solution is based on linear programming techniques (Press et al., 1987) and will not be dealt with here. Instead, we shall refer to model experiments and a field data example for the L 1 L 1 L_(1)L_{1}L1-norm refraction statics corrections.
L-1 Norm Statics
FIG. C-6. CMP stack associated with the model data in Figure 3.4-14 (a) with refraction statics corrections using the L 1 L 1 L_(1)L_{1}L1-norm, (b) section as in (a) after residual statics corrections u s i n g u s i n g usingu s i n gusing the L 1 L 1 L_(1)L_{1}L1-norm. Compare with the L2-norm results in Figure 34-17.
FIG. C-7. Summary of the L 1 L 1 L_(1)L_{1}L1-norm solution for refraction statics associated with the CMP stacked section in Figure 34-15a. Plot direction is the same as that in Figure 3.4-15. Except in frame 1 , shot attributes are denoted with x x xxx and receiver attributes are denoted with vertical bars. Estimated parameters are intercept time anomalies and are plotted in frame 1 with no distinction made between shot and receiver locations.
(a)
L1-Norm Statics
(b)
FIG. C-8. CMP stack associated with the model data in Figure 3.421 (a) with refraction statics corrections using the L 1 L 1 L_(1)L_{1}L1-norm, (b) section as in (a) after residual statics corrections using the L 1 L 1 L_(1)L_{1}L1-norm. Compare with the L2-norm results in Figure 3.4-26.
FIG. C-9. Surnmary of the L 1 L 1 L_(1)L_{1}L1-norm solution for refraction statics associated with the CMP stacked section in Figure 3.4-26a. Plot direction is the same as that in Figure 3 4-26. Except in frame 1, shot attributes are denoted with x x xxx and receiver attributes are denoted with vertical bars, Estimated perameters are intercept time anomaiies and are plotted in frame 1 with no distinction made between shot and receiver locations.
FIG. C-10. The CMP stacked section of the data in Figure 3.4-29 (a) after refraction statics using an L 1 L 1 L_(1)L_{1}L1-norm scheme for refraction statics, and (b) followed by residual statics corrections. Compare with Figure 3.4-29 and note the significant improvement of CMP stacking as a result. of resolving both longand short-wavelength statics anomalies by refraction and residual statics corrections, respectively. Also, compare with Figure 3.4-32 and note that the results of L 1 L 1 L_(1^(-))L_{1^{-}}L1and L 2 L 2 L_(2^(-))L_{2^{-}}L2norm statics solutions, in this case, yield very similar results.
Consider the single-layered near-surface model shown in Figure 3.4-14. Figure C-6 shows results of refraction and residual statics corrections using the L 1 L 1 L_(1)L_{1}L1-norm. Note that these results are comparable to those obtained from L 2 L 2 L_(2)L_{2}L2-norm minimization (Figure 3.4-17).
The results of the L 1 L 1 L_(1)L_{1}L1-norm statics estimates are summarized in Figure C-7. Compare with those of the L 2 L 2 L_(2)L_{2}L2-norm solution in Figure 3.4-18 and note that the statics solutions exhibit minor differences, although the resulting stacked sections are almost identical. Frame 1 shows the estimated intercept time anomalies (equations 3 53 a , b 3 53 a , b 3-53a,b3-53 \mathrm{a}, \mathrm{b}353a,b ), as a function of the shot-receiver station number. Frame 2 shows the pick fold, namely the number of picks in each shot (denoted by x x xxx ) and receiver (denoted by the vertical bars) gather.
A quantitative measure of the accuracy of the L 1 L 1 L_(1)L_{1}L1-norm solution to refraction statics is the sum of the differences between the observed picks t 3 j t 3 j t_(3j)t_{3 j}t3j and the modeled traveltimes t i , t i , t_(i,)^(')t_{i,}^{\prime}ti, (equation C-91b) over each shot and receiver gather. These residual time differences are plotted in frame 3 of Figure C-7. Large residuals often are related to bad picks. Nevertheless, even with good picks, there may be large residuals attributable to inappropriateness of the model assumed for the near-surface.
Figure C-7 also shows the estimated weathering thicknesses at all shot-receiver stations (frame 4). Finally, the computed staties and the near-surface model are shown in frames 5 and 6 , respectively.
Now consider the multilayered near-surface model shown in Figure 3.4-21. Figure C-8 shows results of refraction and residual statics corrections using the L 1 L 1 L_(1)L_{\mathbf{1}}L1-norm solution. Again, results are comparable to those obtained from L 2 L 2 L_(2)L_{2}L2-norm minimization (Figure 3.4-26).
Results of the L 1 L 1 L_(1)L_{1}L1-norm refraction statics solution are summarized in Figure C-9. Compare with those of the L 2 L 2 L_(2)L_{2}L2-norm solution in Figure 3.4-27 and note that the statics solutions and the resulting stacked sections are virtually identical. Although the actual near-surface model consists of several layers (Figure 3.4-21a), the L 1 L 1 L_(1)L_{1}L1-norm solution is based on a single layer with a constant velocity of 1400 m / s 1400 m / s 1400m//s1400 \mathrm{~m} / \mathrm{s}1400 m/s as for the L 2 L 2 L_(2)L_{2}L2-norm solution (Figure 3.4-27). In Figure C-9, Frame 1 shows the estimated intercept time anomalies (equation 3-53a,b), as a function of the shot-receiver station number. Frame 2 shows the pick fold, namely the number of picks in each shot (denoted by × × xx\times× ) and receiver (denoted by the vertical bars) gather. The sum of the differences between the observed picks t 3 t 3 t_(3)t_{3}t3 and the modeled traveltimes t ı 3 t ı 3 t_(ı3)^(')t_{\imath 3}^{\prime}tı3 (equation G-91b) over each shot and receiver gather is shown in frame 3 . Large residuals, in this case, are attributable to inappropriateness of the model assumed for the near-surface. Figure C-9 also shows the estimated weathering thicknesses at all shot-receiver stations (frame 4). Finally the computed statics and the nearsurface model are shown in frames 5 and 6 , respectively. Whatever the inversion norm, the important point is how the near-surface model is parameterized and how close it is to the real situation.
Figure C-10 shows the results of refraction and residual statics corrections applied to field data as in Figure 3.4-29 using the L 1 L 1 L_(1)L_{1}L1-norm solution. The results are comparable to those obtained from L 2 L 2 L_(2)L_{2}L2-norm minimization (Figure 3.4-32).

REFERENCES

Al-Chalabi, M., 1973, Series approximations in velocity and traveltime computations: Geophys. Prosp., 21, 783-795.
Baixas, F. and Du Pont, R., 1988, Practical view of 3-D refraction statics: 58th Ann. Internat. Mtg., Soc. Expl. Geophs., Expanded Abstracts, 787-790.
Bevc, D., 1997 , Flooding the topography: Wave-equation datuming of land data with rugged topography: Geophysics, 62, 1558-1569.
Castle, R. J., 1994, A theory of normal moveout: Geophysics. 59, 983-999.
Claerbout, J. F., 1978, How to derive interval velocities using a pencil and straight edge: Stanford Expl. Proj., Rep. No. 14.
De A morim, W. N., Hubral, P. and Tygel, M., 1987, Computing field statics with the help of seismic tomography: Geophys. Prosp., 35, 907-919.
De Bazelaire, E., 1988, Normal moveout revisited: Inhomogeneous media and curved interfaces: Geophysics, 53, 143-157.
Dix, C. H., 1955, Seismic velocities from surface measurements: Geophysics, 20, 68-86.
Dobrin. M. B., 1960, Introduction to geophysical prospecting: McGraw-Hill Book Co.
Farrell, R. C. and Euwema, R. N., 1984, Refraction Statics: Proc. Inst. Electr. Electron. Eng., 72, 1316-1329.
Grant, F. S. and West, G. F., 1965, Interpretation theory in applied geophysics: McGraw-H.ll Book Co.
Gulunay, N., 1985, A new method for the surface-consistent decomposition of statics using diminishing residual matrices (DRM): 55th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 293-295.
Hagedoorn, J. G., 1959, The pltts-munus method of interpreting seismic refraction sections: Geophys Prosp., 7, 158-182.
Hampson, D. and Russell, B., 1984, First-break interpretation using generalized inversion: J. Can. Soc. Explor. Geophys., 20, 40-54
Hileman, J. A., Embree, P., and Pfieuger, J. C., 1968, Automatod static corrections: Geophys. Prosp., 16, 326-358.
Hill, R. N., 1987, Downward continuation of refracted arrivals to determine shallow strucutre: Geophysics, 52, 118&-1198.
Hill, R. N. and Wuenschel, P. C., 1985, Numerical modeling of refraction arrivals in complex aress: Geophysics, 50, 90-98.
Hubral, P and Krey, T., 1980, Interval velocities from sensmic reflection time measurcments: Soc. Expl. Geophys.
Kircheimer, F, 1988, 3-D Refraction statics by weighted least-squares inversion: 59th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 794-797.
Levin, F. K , 1971, Apparent velocity from dipping interface reflections: Geophysics, 36, 510-516.
Lines, L. R. and Treitel, S., 1984, Tutorial: A review of leest-squares inversion and its application to geophyiscal problems: Geophys. Prosp., 32, 159-186.
Neidell, N. S, and Taner, M. T., 1971, Semblance and other coheroncy measures for multichannel data: Geophysics, 34, 482-497.
Nur, A., 1981, Physical properties of rocks: Soc. Expl. Geophys. Continuing Education Course Notes.
Palmer, D., 1981, The gencralized reciprocal method of refaction seismic interpretation: Geophysics, 46, 1508-1518.
Press, W. H., B. P. Flannery, S. A. Teukolsky and W. A. Vettering, 1987: Numerical recipes The art of scientific computing, Cambridge University Press.
Ronen, J. and Claerbout, J. F., 1985, Surface-consistent residual statics estimation by stack-power maximization: Geophysics, 50, 2759-2767.
Schneider, W. A., 1971, Developments in seismic data procossing and analysis (1968-1970): Gcophysics, 36 , 1043-1073.
Schneider, W. A. and Kuo, S., 1985, Refraction modeling for statics corrcctions: 55th Ann Internat. Mtg,, Soc. Expl. Geophys., Expanded Abstracts, 295-299.
Sheriff, R. E., 1976, Inferring stratigraphy from seismic data: Am. Assn. Petr. Geol. Bull, 60, 528 542 528 542 528-542528-542528542.
Sherwood, J. W. C. and Poe, P. H., 1972, Constant velocity stack and selsmic wavelet processing: Geophysics, 37, 769-787.
Slotnıc, M. M., 1959, Lessons in seismic computing: Soc. Expl. Geophys.
Taner, M. T. and Koehler, F., 1969, Velocity spectra - digital computer derivation and applications of velocity functions: Geophysics, 39 , 859 881 39 , 859 881 39,859-88139,859-88139,859881.
Taner, M. T., Koehler, F, and Alhilali, K. A., 1974, Estimstion and correction of near-surface time anomalies: Geophysics, 41, 441-463.
Taner, M. T., Wagner, D. E., Baysal, E., and Lu, L., 1998, A untfied method for 2-D and 3-D refraction staitcs: Geophysics, 63, 1-15.
Thore, P. D, and Kelly, P., 1992, Stack enhancement using the three-term equation: Synthetic and real data examples: 62 nd Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 1550-1553.
Wiggins, R. A., Larner, K. L., and Wisecup, R. D., 1976, Residual statics analysis as a general linear inverse problem: Geophysics, 41, 922-938.

4 Migration

  • Introduction *\cdot Exploding Reflectors \bullet Migration Strategies \bullet Migration Algorithms \bullet Migration Parameters \bullet As pects of Input data \bullet Migration Velocities \bullet Migration Principles - Kirchhoff Migration \bullet Diffraction Summation - Amplitude and Phase Factors - Kirchhof Summation - Finite-Difference Migration - Downward Continuation Differencing Schemes *\cdot Rational Approximations for Implicit Schemes *\cdot Reverse Time Migration - Frequency-Space Implicit Schemes *\cdot Frequency-Space Explicit Schemes - Frequency-Wavenumber Migration - Phase-Shift Migration - Stolt Migration - Summary of Domains of Migration Algorithms - Kirchhoff Migration in Practice Aperture Width *\cdot Maximum Dip to Migrate *\cdot Velocity Errors *\cdot Finite-Difference Migration in Practice *\cdot Depth Step Size - Velocity Errors *\cdot Cascaded Migration *\cdot Reverse Time Migration *\cdot Frequency-Space Migration in Practice *\cdot Steep-Dip Implicit Methods *\cdot Depth Step Size *\cdot Velocity Errors *\cdot Steep-Dip Explicit Methods - Dip Limits of Extrapolation Filters *\cdot Velocity Errors - Frequency-Wavenumber Migration in Practice *\cdot Maximum Dip to Migrate \bullet Depth Step Size *\cdot Velocity Errors *\cdot Stolt Stretch Factor ~  Wraparound - Residual Migration *\cdot Further Aspects of Migration in Practice *\cdot Migration and Spatial Aliasing *\cdot Migration and Random Noise - Migration and Line Length - Migration from Topography \bullet Exercises *\cdot Appendix D: Mathematical Foundation of Migration - Wavefield Extrapolation and Migration - Stationary Phase Approximations - The Parabolic Approximation - Frequency-Space Implicit Schemes \bullet Stable Explicit Extrapolation - Optimum Depth Step *\cdot Frequency-Wavenumber Migration \bullet Residual Migration \bullet References

4.0 INTRODUCTION

Migration moves dipping refloctions to their true subsurface positions and collapses diffractions, thus increasing spatial resolution and yielding a sewmic mage of the subsurface. Figure 4.0-1 shows a CMP-stacked section before and after migration. The stacked section indicates the presence of a salt dome flanked by gently dipping strata. Figure 4.0-1 also shows a sketch of two prominent features - the diffraction hyperbola D D DDD that originates at the tip of the sait dome, and the reflection B B BBB off the fank of the salt dome. After migration, note that the diffraction has collapsed to its apux P P PPP and the dipping event has moved to a subsurface location A A AAA, which is at or near the salt dome flank. In contrast, reflections associated with the gently dipping strata have moved little after migration.
Fignre 4,0-2 is an example with a different type of structural feature. The stack contains a zone of nearhorizontal reflections down to 1 s 1 s 1s1 \mathrm{~s}1 s. After migration, these events are virtually unchanged. Note the prominent unconformity that represents an ancient erosional surface just below 1 s 1 s 1s1 \mathrm{~s}1 s. On the stacked section, the unconformity appears complex, while on the migrated section, it becomes interpretable. The bowties on the stacked section are untied and turned into synclines on the mi-
(a)
(b)
(c)
FIG. 4.0-1. A CMP stack (a) before, (b) after migration; (c) sketch of a prominent diffraction D D DDD and a dipping event before (B) and after (A) migration. Migration moves the dipping event B to its assumed true subsurface position A and collapses the diffraction D D DDD to its apex P P PPP. The dotted line indicates the boundary of a salt dome.
(a)
(b)
FIG. 4.0-2. A CMP stack (a) before, (b) after mgration. Mygation unties the bowties on the stacked section and turns them into synclnes (Taner and Koehler, 1977). grated section. The deeper event in the neighborhood of 3 s 3 s 3s3 \mathrm{~s}3 s is the multiple associated with the unconformity above. When treated as a primary and migrated with the primary velocity, it is overnigrated.
Figure 4.0-3a shows a stacked section that contains fault-plane reflections conflicting with the shallow gently-dipping reflections. Note the accurate positioning of the fault planes and delineation of the fault blocks on the migrated section in Figure 4.0-3b. From the three examples shown in Figures 4.0-1, 4.0-2, and 4.0 3 4.0 3 4.0-34.0-34.03, note that migration moves dipping events in the updip direction and collapses diffractions, thus enabling us to delineate faults while retaining horizontal events in their original positions.
The goal of migration is to make the stacked section appear similar to the geologic cross-section in depth along a seismic traverse. The migrated section, however, commonly is displayed in time. One reason for this is that velocity estimation based on seismic and other data always is limited in accuracy. Therefore, depth conversion is not completely accurate. Another reason is that interpreters prefer to evaluate the validity of migrated sections by comparing them to the unmigrated data. Therefore, it is preferable to have both sections displayed in time. The migration process that produces a migrated time section is called tame mugration. Time migration, the main theme of Chapter 4 , is appropriate as long as lateral velocity variations are mild to moderate.
When the lateral velocity gradients are significant, time migration does not produce the true subsurface image. Instead, we need to use depth magntion, the output
FIG. 4.0-3. A CMP stack (a) before, (b) after migration. Migration collapses subtle diffractions associated with the growth faults, moves the fault-plane reflections to the fault poeitions, and thus makes detailed structural interpretation easier.
(a)
FIG. 4.0-4. A CMP stack (a) before, (b) after time migration. Time migration is adequate for accurate imaging o top-salt boundary, whereas depth migration is imperative for accurate imaging of the base-salt boundary (B).
of which is a depth section. Consider the data from an area with intense salt tectonics in Figure 4.0-4. Time migration has produced an acceptable image of the region above the salt. However, note the crossing of events that is a manifestation of overmigration of the reflection associated with the base-salt boundary (denoted by B B BBB in Figure 4.0-4b). The improper migration is the result of inadequate treatment by the time migration of the effects of severe raypath bendings at the top-balt boundary caused by the strong velocity contrast between the selt layer and the overlying rocks.
Complex structures associated with salt diapirism, overthrust tectonics and irregular water-bottom topography usually are three dimensional (3-D) in character. A stacked section really is the seismic response of a 3D subsurface on a two-dimensional (2-D) plane of profile. Therefore, 2-D migration is not completely valid for 3-D data from areas with complex 3-D structures. Figure 4.0 5 a 4.0 5 a 4.0-5a4.0-5 \mathrm{a}4.05a is an inline stacked section from a land 3-D survey. Figure 4.0 5 b 4.0 5 b 4.0-5b4.0-5 \mathrm{~b}4.05 b is a 2-D migration of this section, while Figure 4.0 5 c 4.0 5 c 4.0-5c4.0-5 \mathrm{c}4.05c is the same section after 3-D migration of the entire 3-D survey data. In particular, note the significant difference in the imaging of the top of salt T T TTT and base of salt B B BBB. In 2-D migration, we assume that the stacked section does not contain any energy that comes from outside the plane of recording (sideswipe). Three-dimensional imaging of the subsurface is discussed in Section 7.3.

Exploding Reflectors

When a stacked section is migrated, we use the migration theory applicable to data recorded with a coincident source and receiver (zero-offset). To develop a conceptual framework for discussing migration of zerooffset data, we now examine two types of recording schemes.
A zero-offset section is recorded by moving a single source and a single receiver along the line with no separation between them (Figure 4.0-6). The recorded energy follows raypaths that are normal incidence to reflecting interfaces. This recording geometry obviously is not realizable in practice.
Now consider an alternative geometry (Figure 4.06) that will produce the same seismic section. Imagine exploding sources that are located along the reflecting interfaces (Loewenthal et al., 1976). Also, consider one receiver located on the surface at each GMP location along the line. The sources explode in unison and send out waves that propagate upward. The waves are recorded by the receivers at the surface. The earth model described by this experiment is referred to as the exploding reflectors model.
(a)
(b)
(c)
FIG. 4.0-5. A 2-D CMP stack (a) represents a 2-D crosssection of a 3-D wavefield. Thus, it can contain energy from outside the plane of the 2-D line traverse. A 2-D migration (b) is inadequate when this kind of energy is present on the 2-D CMP-stacked section. (c) Clear imaging of the salt structure requires both 3-D data collection and 3-D migration (Section 7.3), (Data courtesy Nederlandse Aardole Maatschappij B.V)
(a)
(b)
FIG. 4.0-6. Geometry of zero-offet recording (left), and hypothetical simulation of the zero-offset experiment using exploding reflectors (right) (Claerbout, 1985).
The seismic section that results from the exploding reflectors model is largely equivalent to the zero-offset section, with one important distinction. The zero-offset section is recorded as two-way traveltime (from source to reflection point to receiver), while the exploding reflectors model is recorded as one-way traveltime (from the reflection point at which the source is located to the receiver). To make the sections compatible, we can imagine that the velocity of propagation is half the true medium velocity for the exploding reflectors model.
The equivalence between the zero-offset section and the exploding reflectors model is not quite exact, particularly in the presence of strong lateral velocity variations (Kjartansson and Rocca, 1979).
These concepts now are applied to the velocitydepth model in Figure 4.0-7. Consider source-receiver pairs placed along the earth's surface at every tenth midpoint. In this case, a zero-offset section is modeled. At midpoint 130, five different arrivals are associated with rays that are normal incidence to the first interface. Alternatively, imagine receivers placed along the earth's surface at every tenth midpoint and sources placed along the interface where the rays emerge at the right angle to the interface (equivalent to the normalincidence rays of the zero-offset section). In the latter case, the velocities indicated in Figore 4.0-7 must be halved to match the time axis with that associated with the zero-offset section.
The interface can be sampled more densely by placing receivers and sources at closer spacing (Figure 4.08a). The next deeper interface can be modeled; that is,
FIG. 4.0-7. A velocty-depth model (top) and the zerooffset traveltime response (bottom) of the water-bottom reflector. Shown also are the normal-incidence rays used to compute the zero-offset traveltime trajectory. Note the five arrivals A , B , C , D A , B , C , D A,B,C,DA, B, C, DA,B,C,D and E E EEE at CMP 130 all from the water bottom.
D15IANCE (M)
F1G. 4.0-8. Exploding-reflector modeling of zero-offset traveltimes associated with (a) a water botton, (b) a flat, and (c) a dipping reflector. (d) The superposition of the normal-incidence traveltime responses in (a), (b), and (c). Shown on the velocity-depth models in the left-hand column are the normal-incidence rays used to compute the traveltime trajectories. The time sections shown on the right-hand column are equivalent to a zero-offet traveltme section with the vertical axis in two-way tıme.
the traveltime trajectory can be computed by placing sources along this interface and leaving the receivers where they were on the surface (Figure 4.0-8b). Finally, the same experiment can be repeated for the third interface (Figure 4.0-8c). To derive the composite response from the velocity-depth model in Figure 4.0-8d (the lefthand column), individual responses shown in Figures 4.0 8 a , 4.0 8 b 4.0 8 a , 4.0 8 b 4.0-8a,4.0-8b4.0-8 \mathrm{a}, 4.0-8 \mathrm{~b}4.08a,4.08 b and 4.0 8 c 4.0 8 c 4.0-8c4.0-8 \mathrm{c}4.08c from each interface are superimposed. The result is shown in Figure 4.0-8d (the right-hand column). We can imagine that sources were placed at all three interfaces and turned on simultaneously. Such an experiment would cause the rays emerging from the three interfaces to be recorded at receivers placed on the surface, along the line
Actually, Figure 4.0-8d (the right-hand column) represents the modeled zero-offset traveltime section. Sersmic wavefields, however, are represented not only by wave traveltimes but also by wave ampltudes. Figure 4.0-9a shows the modeled zero-offeet wavefield section based on the same velocity-depth model in Figure 4.08d (the left-hand column). The shallow complex interface (horizon 1 in Figure 4.0-8a) caused the complicated response of the two simple interfaces (horizons 2 and 3) in this zero-offset traveltime section.
How valid is the assumption that a stacked section is equivalent to a zero-ofiset section? The conventional CMP recording geometry provides the wavefield at nonzero offsets. During processing, we collapse the offset axis by stacking the data onto the midpoint-time plane at zero offset. For CMP stacking, we normally assume hyperbolic moveout. Figure 4.0 10 4.0 10 4.0-104.0-104.010 shows selected CMP gathers modeled from the velocity-depth model in Figure 4.0-8d (the left-hand column). Because of the presence of strong lateral velocity variations, the hyperbolic assumption may not be appropriate for some reflections on some CMP gathers (Figure 4 0-10a); however, it may be valid for others (Figure 4.0-10b). We obtain a stacked section (Figure 4.0-9b) that resembles the zero-offset section (Figure 4.0-9a) to the extent that the hyperbolic moveout assumption is valid. The assumption that a conventional stacked section is equivalent to a zero-offset section also is violated to varying degrees in the presence of strong multiples and conflicting dips with different stacking velocities (Chapter 5). While migration of unstacked data is discussed in Chapter 5 , our main focus in this chapter is on migration after stack.

Migration Strategies

In practice, migration of seismic data requires decision making with regards to:
(a) an appropriate migration strategy, (b) a migration algorithm compatible with the strategy,
(c) appropriate parameters for the algorithm,
(d) issues concening the input data, and
(e) migration velocities.
Migration strategies include:
(a) 2-D versus 3-D migration,
(b) post- versus prestack migration, and
(c) time versus depth migration.
The spectrum of migration strategies extend from 2-D poststack time migration to 3 D 3 D 3-D3-D3D prestack depth migration. Depending on the nature of the subsurface geology, any other in-between combination can be selected. In practice, 2-D/3-D poststack time migration is used most often for a good reason it is the least sensitive to velocity errors, and it often yields results acceptable for a reliable interpretation. Table 4-1 is an overview of different migration strategies applied to different types of seismic data (2-D, 3-D, stacked, and unstacked).
Choice of an appropriate migration strategy requires input from the interpreter as to the structural geology and stratigraphy in an area. Dipping events on a stacked section call for time migration, Conflicting dips with different stacking velocities is one case in which a conventional stacked section differs from a zero-offset section. Thus, strictly speaking, poststack migration
Table 4-1. Migration strategies.
Case Migration
dipping events time migration
conflicting dips with
different stacking velocities
conflicting dips with different stacking velocities| conflicting dips with | | :--- | | different stacking velocities |
prestack migration
3-D behavior of
fault planes and salt flanks
3-D behavior of fault planes and salt flanks| 3-D behavior of | | :--- | | fault planes and salt flanks |
3 -D migration
Case Migration dipping events time migration "conflicting dips with different stacking velocities" prestack migration "3-D behavior of fault planes and salt flanks" 3 -D migration| Case | Migration | | :--- | :--- | | dipping events | time migration | | conflicting dips with <br> different stacking velocities | prestack migration | | 3-D behavior of <br> fault planes and salt flanks | 3 -D migration |
Case Migration
strong lateral velocity depth migration
variations associated with
complex overburden structures
complex nonhyperbolic moveout prestack migration
3-D structures
3-D migration
(a)
(b)
FIG. 4.0-9. (a) The zero-offset wavefield section equivalent to the zero-offiset traveltime section in Figure 4.0-8d (the right-hand column); (b) the CMP stack generated from the CMP gathers as in Figure 4.0-10. (Modeling by Deregowski and Barley, 1981.)
which assumes that the stacked section is equivalent to a zero-offset section is not valid to handle the case of conflicting dips. Instead, one needs to do prestack time migration.
Conflicting dips often are associated with salt flanks and fault planes, which can have 3-D characteristics. This then requires 3 D 3 D 3-D3-D3D prestack time migration. In Section 5.3, we shall discuss a practical alternative to 2-D prestack time migration strategies. The alternative sequence includes the application of normal-moveout (NMO) correction using velocities appropriate for flat events followed by 2-D dip moveout correction (DMO) to correct for the dip and source-receiver azimuth effects on stacking velocities. As a result, conflicting dips are preserved during stacking, and thus, inuaging can be deferred until after stacking using 2-D poststack time migration strategies. This series of processing steps is largely equivalent to 2 -D prestack time migration and results often are comparable. The same workflow also is applicable to 3-D prestack time migration (Section 7,4).
Accurate imaging of targets beneath complex structures with strong lateral velocity variations requires depth migration. Aside from the problem of conflicting dips with different stacking velocities, strong lateral velocity variations associated with complex overburden structures usually cause conventional stacking based on the hyperbolic moveout assumption to fail.
Therefore, a case of complex overburden structures calls for depth migration before stacking the data.
Furthermore, complex overburden structures, encountered in areas with salt tectonics, overthrust tectonics and irregular water-bottom topographles can often exhibit 3-D characteristics. Thus, imaging such structures may require 3 D 3 D 3-D3-D3D prestack depth migration.
Field surveys are designed such that line orientations are, as much as puosible, along the dominant strike and dip directions, so as to minimize 3-D effects. Under these circumstances, the 2-D assumption for migration can be acceptable. However, if the subsurface has a truly 3-D geometry, without a dominant dip or strike direction, then it is imperative to do 3-D migration of 3-D data. In such cases, 2-D migration (whether poststack or prestack, time or depth) can lead to potential problems in interpretation.
A practical alternative to 2 -D prestack depth m i m i mi\mathrm{mi}mi gration can be a prestack layer replacement to correct for the complex nonhyperbolic moveout followed by time migration after stack. This, however, is applicable to situations involving a single overburden layer, such as irregular water-bottom topography for it to be reasonably practical.

Migration Algorithms

The one-way-in-depth scalar wave equation is the basis for common migration algorithms. These algorithms do not explicitly model multiple reflections, converted waves, surface waves, or noise. Any such energy present in data input to migration is treated as primary reflections. Migration algorithms can be classified under three main categories:
(a) those that are based on the integral solution to the scalar wave equation,
(b) those that are based on the finite-difference solutions, and
(c) those that are based on frequency-toatienumber implementations.
Whatever the algorithm, it should desirably:
(a) handle steep dips with sufficient accuracy,
(b) handle lateral and vertical velocity variations, and
(c) be implemented, efficiently.
Figure 4.0 11 4.0 11 4.0-114.0-114.011 is a migrated CMP stacked section with a major unconformity. The undermigration - incomplete imaging of the unconformity, is not because of
(a)

CMP

240
(b)
FIG. 4.0-10. Selected CMP gathers modeled from the velocity-depth model in Figure 4,0-8d (the left-hand column). (a) Gathers from the complex part of the velocity-depth model, (b) gathers from the simpler part of the velocity-depth model. CMP locations arc indicated in Figure 4.0-8d. The CMP stack is shown in Figure 40 9 b 40 9 b 40-9b40-9 \mathrm{~b}409 b (Modeling by Deregowski and Barley, 1981.)
erroneously too low velocities. Although we should always be aware of velocity errors when migrating seismic data, the undermigration in Figure 4.0 11 4.0 11 4.0-114.0-114.011 is the result of using a dip-limited algorithm. By using a steep-dip algorithm, we can achieve a more accurate imaging of the unconformity (Figure I-9).
The three principle migration techniques are discussed in this chapter in their historical order of development as outlined below. The first migration technique developed was the semicircle superposition method that was used before the age of computers. Then came the diffraction-summation technique, which is based on summing the seismic amplitudes along a diffraction hyperbola whose curvature is governed by the medium velocity. The Kirchhoff summation technique introduced later (Schneider, 1978), but actually in use earlier, basically is the same as the diffraction summation technique with added amplitude and phase corrections applied to the data before summation. These corrections make the summation consistent with the wave equation in that they account for spherical spreading (Section 1.4), the obliquity factor (angle-dependency of amplitudes), and the phase shift inherent in Huygens' secondary sources (Section 4.1).
Another migration technique (Claerbout and Doherty, 1972) is based on the idea that a stacked section can be modeled as an upcoming zero-offset wavefield generated by exploding reflectors. Using the exploding reflectors model, migration can be conceptualized as consisting of wavefield extrapolation in the form of downward continuation followed by imaging. To understand imaging, consider the shape of a wavefield at observation time t = 0 t = 0 t=0t=0t=0 generated by an exploding reflector. Since no time has elapsed and, thus, no propagation has occurred, the wavefront shape must be the same as the reflector shape that generated the wavefront. The fact that the wavefront shape at t = 0 t = 0 t=0t=0t=0 corresponds to the reflector shape is called the magng principle. To define the reflector geometry from a wavefield recorded at the surface, we only need to extrapolate the wavefield back in depth then monitor the energy arriving at t = 0 t = 0 t=0\boldsymbol{t}=\mathbf{0}t=0. The reflector shape at any particular extrapola-
FIG. 4.0-11. A CMP stack (a) before, and (b) after migration. Note the undermigration of the unconformity event (U) caused by the use of a dip-limited algorithm.
tion depth directly corresponds to the wavefront shape at t = 0 t = 0 t=0t=0t=0.
Downward continuation of wavefields can be implemented conveniently using finite-difference solutions to the scalar wave equation. Migration methods based on such implementations are called finite-difference migration. Many different differencing schemes applied to the differential operators in the scalar wave equation exist both in time-space and frequency-space domains. Glaerbout (1985) provides a comprehensive theoretical foundation of finite-difference migration and its practical espects.
After the developments on Kirchhoff summation and finite-difference migrations, Stolt (1978) introduced migration by Fourier transform. This method involves a coordinate transformation from frequency (the transform variable associated with the input time axis) to vertical wavenumber axis (the transform variable associated with the output depth axis), while keeping the horizontal wavenumber unchanged. The Stolt method is based on a constant-velocity assumption. However, Stolt modifed his method by introducing stretching in the time direction to handle the types of velocity variations for which time migration is acceptable. Stolt, and Benson (1986) combine theory with practice in the field of migration with an emphasis on the frequencywavenumber methods.
Another frequency-wavenumber migration is the phase-shift method (Gazdag, 1978). This method is besed on the equivalence of downward continuation to a phase shift in the frequency-wavenumber domain. The imaging principle is invoked by summing over the frequency components of the extrapolated wavefield at each depth step to obtain the image at t = 0 t = 0 t=0t=0t=0.
A reason for the wide range of migration algorithms used in the industry today is that none of the algorithms fully meets the important criteria of handling all dips and velocity variations while still being cost-effective.
Migration algorithms based on the integral solution to the scalar wave equation, commonly known as Kirchhoff migration, can handle all dips up to 90 degrees, but they can be cumbersome in handling lateral velocity variations.
Finite-difference algorithms can handle all types of velocity variations, but they have different degrees of dip approximations. Furthermore, differencing schemes, if carelessly designed, can severely degrade the intended dip approximation.
FIG. 4.0-12. A CMP stack (a) before, and (b) after migration. Lack of any event to the right of the dotted line on the migrated section is a result of the finite line length.
Finally, frequency-wavenumber algorithms have limited ability in handling velocity variations, particularly in the lateral direction. As a result of limitations of the three main categories of migration algorithms integral, finite-difference, and frequencywavenumber methods, migration software has expended further to additional extensions and combinations of the basic algorithms. Residual migration - phase-shift or constant-velocity Stolt migration followed by the application of a dip-limited algorithm is one example.

Migration Parameters

After deciding on the migration strategy and the appropriate algorithm, the analyst then needs to decide on the migration parameters. Migration aperture width is the critical parameter in Kirchhoff migration. A smal] aperture causes removal of steep dips; it generates spurious horizontal events and organizes the random noise uncorrelated from trace to trace.
Depth step size in downward continuation is the critical parameter in finite-difference methods. An optimum depth step size is the largest depth step with the minimum tolerable phase errors. It depends on temporal and spatial samplings, dip, velocity, and frequency. It also depends on the type of differencing scheme used in the algorithm.
Finally, the stretch factor is the critical parameter for Stolt migration. A constant-velocity medium implies a stretch factor of 1 . In general, the larger the vertical velocity gradient, the smaller the stretch factor needs to be.

Aspects of Input Data

When migrating seismic data, one needs to be concerned with various aspects of the input data set itself:
(a) line length or areal extent,
(b) signal-to-noise ratio, and
(c) spatial aliasing.
The line length must be sufficient to allow a steeply dipping event to migrate to its true subsurface location. It is a fatal error to record short profiles in areas with complex geology. Also, for 3-D migration, the surface areal extent of a 3-D survey is almost always larger than the target subsurface areal extent.
Random noise at late times on a stacked section, when migrated, potentially can be hazardous for shallower data. One may have to compromise on migration aperture for deep data to prevent this problem to occur.
Trace spacing must be small enough to prevent spatial aliasing of steep dips at high frequencies. Although this is not an issue for modern prestack data a coarse shot-receiver spacing can degrade the fidelity of prestack migration severely. Old data and 3-D marine data in the crossline direction often are trace interpolated prior to poststack migration.
Figure 4.0-12 is a CMP stacked section before and after migration. From an interpretation viewpoint, the reliable part of this migrated section is confined to the upper central part. Lack of any reflection energy to the right of the dotted line does not mean that there is a structural discontinuity there. It only means that the reflections associated with the imbricate structure have been migrated in the updip direction from right to left. As a result, a zone with no reflectors to the right of the dotted line is left behind because of the truncation of the wavefeld represented by the right-hand edge of the stacked section. The deeper part is useless, because the noise dominates the section.

Migration Velocities

Horizontal displacement during migration is proportional to migration velocity squared (equation 4-1). Since velocities generally increase with depth, errors in migration are usually larger for deep events than shallow events. Also, the steeper the dip, the more accurate the migration velocities need to be, since displacement is proportional to dip.
Figure 4.0-13 shows a portion of a CMP-stacked section after 3 D 3 D 3-D3-D3D poststack time migration using a percent range of stacking velocities. Note the subtle underand overmigration effects on dipping events below the major unconformity represented by the strong, nearhorizontal reflection. Events A A AAA dipping up to the left and B B BBB dipping up to the right cross over one another on sections that correspond to 90 percent and 95 percent of stacking velocities, indicating undermigration. The same events are split away from one another in opposite directions on sections that correspond to 105 percent and 110 percent of stacking velocities. The most overall acceptable image is seen on the section that corresponds to the 100 percent of stacking velocities.
Accuracy in event positioning after migration actually depends on the combined effects of the performance of the migration algorithm used and the velocity errors. For example, the inherently undermigrating character of a 45-degree finite-difference algorithm can be, for an event with a specific dip, coincidentally counterbalanced by the overmigration effect of erroneously too high velocities. In the presence of large vertical velocity gradients, a two-pass 3-D migration can also cause overmigration of steep dips (in the form of lateral translation) even with the correct migration velocities.
Figure 4.0-14a shows a portion of a migrated stacked section. Although this section does not contain steep dips, accurate imaging of the faults along the lowrelief structures can be important to the interpreter. Note the slight undermigration, which may be caused by any of the following: (a) error in migration velocities, (b) a dip-limited algorithm that failed to focus the diffraction energy adequately, or (c) a possible 3-D behavior of the geometry of the reflector. The section in Figure 4.0-14a has been migrated with a dip-limited algorithm. Using a proper algorithm, with the same velocities, we get the migrated section in Figure 4.0-14b. The resulting section shows slight overmigration, which can be attributed to errors in migration velocities. Lowering the velocities gives the improved, but not completely accurate, image in Figure 4.0-14c. Perhaps, the remaining issues in imaging may be attributed to 3 D 3 D 3-D3-\mathrm{D}3D effects.
As demonstrated by the example in Figure 4.0-14, migration results generally are self-evident underand overmigration often can be recognized on a migrated section. Problems in imaging often are traced to accuracy in migration velocities. I consider migration velocities as the weak link between the seismic section and the geologic cross-section.
In the next section, basic principles of migration are presented and the Kirchhoff summation, finitedifference, irequency-space, and frequency-wavenumber algorithms are reviewed. Practical aspects of the migration algorithms are expounded in Sections 4.2 through 4.5. Specifically, key parameters for each category of the migration algorithms are analyzed using appropriate synthetic and field data examples. Further aspects of
FIG. 4.0-13. A portion of a CMP-stacked section after 3 D poststack time migration using, from top to bottom, 90 , 95 , 100 , 105 95 , 100 , 105 95,100,10595,100,10595,100,105 and 110 percent of stacking velocities. Note the subtle under- and overmigration effects on dipping events below the major unconformity represented by the strong, near-horizontal reflection. Note the effect of velocities used in migration on the positioning of the event A A AAA dipping up to the left and event B dipping up to the right.
migration in practice, including spatial aliasing, migration response to random noise, line length, and irregular topography are discussed in Section 4.6. The problem of conflicting dips with different stacking velocities that requires dip-moveout (DMO) correction and prestack time migration, and the accompanying topic on migration velocity analysis are deferred until Chapter 5 . The problem of imaging beneath complex structures that requires earth imaging and modeling in depth is discussed in Chapters 8 and 9, respectively.
FIG. 4.0-14. (a) A portion of a migrated CMP stack; note the subtle undermigration at fault locations A A AAA and B B BBB caused by the use of a dip-limited algorithm; (b) same data set but migrated with an algorithm with no dip limitation; note the subtle overmigration most likely due to erroneously too high velocities; (c) same data set migrated with the same algorithm as in (b) but with velocities adjusted to prevent overmigration.

4.1 MIGRATION PRINCIPLES

Consider the dipping reflector C D C D CDC DCD of the simple geologic section in Figure 4.1-1a. We want to obtain a zero-offset section along the profile O O OOO z As we move the source-receiver pair ( s , g ) ( s , g ) (s,g)(s, g)(s,g) along O x O x O_(x)O_{x}Ox, the first normalincidence arrival from the dipping reflector is recorded at location A A AAA. In this discussion, we assume a normalized constant-velocity medium v = 1 v = 1 v=1v=1v=1 so that time and depth coordinates become interchangeable. The reflection arrival at location A A AAA is indicated by point C C CCC on the zero-offset time section in Figure 4.1-1b. As we move from location A A AAA to the right, normal-incidence arrivals are recorded from the dipping reflector C D C D CDC DCD. The last arrival is recorded at location B B BBB, which is indicated by point D D D^(')D^{\prime}D in Figure 4.1-1b. In this experiment, diffractions off the edges of reflector C D C D CDC DCD are excluded to simplify the discussion.
(a)
(b)
FIG. 4,1-1. Migration principles: The reflection segment C D C D C^(')D^(')C^{\prime} D^{\prime}CD in the time section as in (b), when migrated, is moved updip, steepened, shortened, and mapped onto its true subsurface location C D C D CDC DCD as in (a). (Adapted from Chun and Jacewitz, 1981.)
Compare the geologic section in Figure 4.1-1a, which is in depth, with the zero-offset seismic section in Figure 4.1-1b, which is in time. The true subsurface position of reflector C D C D CDC DCD is superimposed onto the time section for comparison. Clearly the true geologic position of reflector C D C D CDC DCD is not the same as the reflection event position C D C D C^(')D^(')C^{\prime} D^{\prime}CD.
From this simple geometric construction, note that the reflection in the time section C D C D C^(')D^(')C^{\prime} D^{\prime}CD must be morated to its true subsurface position C D C D CDC DCD in the depth section. The following observations can be made from the geometric description of migration in Figure 4.1-1:
(a) The dip angle of the reflector in the geologic section is greater than in the time section; thus, migration steepens reflectors.
(b) The length of the reflector, as seen in the geologic section, is shorter than in the time section; thus, migration shortens reflectors. (c) Migration moves reflectors in the updip direction.
The example in Figure 4.0-1 demonstrates the above observations. In particular, the dipping event ( B ) ( B ) (B)(B)(B) has moved in the updip direction, become shorter, and steepened after migration ( A ) ( A ) (A)(A)(A).
As mentioned in the previous section, conventional migration output is displayed in time, as is the input stacked section. To distinguish the two time axes, we will denote the time axis on the stacked section as t t ttt
event time in the unmigrated position, and the time axis on the migrated section as T T TTT event time in the migrated position.
We shall now examine the horizontal and vertical displacements as seen on the migrated time section. From Figure 4.1-2, consider a reflector segment C D C D CDC DCD. Assume that C D C D CDC DCD migrates to C D C D C^(')D^(')C^{\prime} D^{\prime}CD and that point E E E^(')E^{\prime}E on C D C D C^(')D^(')C^{\prime} D^{\prime}CD migrates to point E E EEE on C D C D CDC DCD. The horizontal and vertical (time) displacements d x d x d_(x)d_{x}dx and d t d t d_(t)d_{t}dt, and the dip Δ τ / Δ x Δ τ / Δ x Delta tau//Delta x\Delta \tau / \Delta xΔτ/Δx, all measured on the migrated time section (Figure 4.1-2), can be expressed in terms of medium velocity v v vvv, traveltime t t ttt, and apparent dip Δ t / Δ x Δ t / Δ x Delta t//Delta x\Delta t / \Delta xΔt/Δx as measured on the unmigrated time section (Figure 4.1-2). Chun and Jacewitz (1981) derived the following formulas:
d x = v 2 t 4 Δ t Δ x d t = t [ 1 1 ( v Δ t 2 Δ x ) 2 ] Δ τ Δ x = Δ t Δ x 1 1 ( v Δ t 2 Δ x ) 2 d x = v 2 t 4 Δ t Δ x d t = t 1 1 v Δ t 2 Δ x 2 Δ τ Δ x = Δ t Δ x 1 1 v Δ t 2 Δ x 2 {:[d_(x)=(v^(2)t)/(4)(Delta t)/(Delta x)],[d_(t)=t[1-sqrt(1-((v Delta t)/(2Delta x))^(2))]],[(Delta tau)/(Delta x)=(Delta t)/(Delta x)(1)/(sqrt(1-((v Delta t)/(2Delta x))^(2)))]:}\begin{gathered} d_{x}=\frac{v^{2} t}{4} \frac{\Delta t}{\Delta x} \\ d_{t}=t\left[1-\sqrt{1-\left(\frac{v \Delta t}{2 \Delta x}\right)^{2}}\right] \\ \frac{\Delta \tau}{\Delta x}=\frac{\Delta t}{\Delta x} \frac{1}{\sqrt{1-\left(\frac{v \Delta t}{2 \Delta x}\right)^{2}}} \end{gathered}dx=v2t4ΔtΔxdt=t[11(vΔt2Δx)2]ΔτΔx=ΔtΔx11(vΔt2Δx)2
To gain a quantitative insight into these expressions, we consider a numerieal example. For a realistic velocity function that increases with depth, consider five reflecting segments at various depths. For simplicity, assume that quantity Δ t / Δ x Δ t / Δ x Delta t//Delta x\Delta t / \Delta xΔt/Δx is the same for all (10 ms per 25 m 25 m 25-m25-\mathrm{m}25m trace spacing). From equations (4-1), (42), and (4-3), compute the horizontal and vertical displacements d x d x d_(x)d_{x}dx and d t d t d_(t)d_{t}dt and the dips (in ms/trace) after migration. The results are summarized in Table 4-2.
Refer to Table 4-2 and equations (4-1), (4-2), and (4.3) and make the following observations:
(a) The time dip Δ τ / Δ x Δ τ / Δ x Delta tau//Delta x\Delta \tau / \Delta xΔτ/Δx on the migrated section is always greater than the time dip Δ t / Δ x Δ t / Δ x Delta t//Delta x\Delta t / \Delta xΔt/Δx on the unmigrated section.
(b) The horizontal displacement d x d x d_(x)d_{x}dx increases with event time t t ttt in the unmigrated position. At 4 s 4 s 4s4 \mathrm{~s}4 s, the horizontal displacement is more than 6 k m 6 k m 6km6 \mathrm{~km}6 km.
FIG. 4.1-2. Quantitative analysis of the migration process. Dipping event A B A B ABA BAB on the unmigrated section (Ieft) is moved to A B A B A^(')B^(')A^{\prime} B^{\prime}AB on the migrated section (nght). The event after migration also is supcrimposed on the unmigrated section to compare the position of the event before and after migration. Point C C CCC on dipping reflector A B A B ABA BAB is moved to C C C^(')C^{\prime}C after migration. The amount of horizontal displacement d x d x d_(x)d_{x}dx, vertical displacement d t d t d_(t)d_{t}dt, and the dip Δ τ / Δ x Δ τ / Δ x Delta tau//Delta x\Delta \tau / \Delta xΔτ/Δx after migration is calculated from equations (4-I), (4-2) and (4-3).
Table 4-2. Horizontal and vertical displacements as a result of migration of a series of dipping reflections with the same apparent dip ( 10 m s / 10 m s / 10ms//10 \mathrm{~ms} /10 ms/ trace) as measured on the unmigrated stacked section at various depths, and changes in dip angle as measured on the migrated section in time.
t t ttt v v vvv d x d x d_(x)d_{x}dx d t d t d_(t)d_{t}dt Δ t / Δ x Δ t / Δ x Delta t//Delta x\Delta t / \Delta xΔt/Δx Δ τ / Δ x ¯ Δ τ / Δ x ¯ bar(Delta tau//Delta x)\overline{\Delta \tau / \Delta x}Δτ/Δx¯
( s ) ( s ) (s)(\mathrm{~s})( s) ( m / s ) ( m / s ) (m//s)(\mathrm{m} / \mathrm{s})(m/s) ( m ) ( m ) (m)(\mathrm{m})(m) ( s ) ( s ) (s)(\mathrm{s})(s)
Δ m / Δ m / Deltam//\Delta \mathrm{m} /Δm/ trace ) ) )))
( m s / ( m s / (ms//(\mathrm{ms} /(ms/ trace ) ) )))
Deltam// trace ) (ms// trace )| $\Delta \mathrm{m} /$ trace $)$ | | :---: | | $(\mathrm{ms} /$ trace $)$ |
1 2500 625 0.134 10 11.5
2 3000 1800 0.400 10 12.5
3 3500 3675 0.858 10 14.0
4 4000 6400 1.600 10 16.7
5 4500 10125 2.820 10 23.0
t v d_(x) d_(t) Delta t//Delta x bar(Delta tau//Delta x) (s) (m//s) (m) (s) "Deltam// trace ) (ms// trace )" 1 2500 625 0.134 10 11.5 2 3000 1800 0.400 10 12.5 3 3500 3675 0.858 10 14.0 4 4000 6400 1.600 10 16.7 5 4500 10125 2.820 10 23.0| $t$ | $v$ | $d_{x}$ | $d_{t}$ | $\Delta t / \Delta x$ | $\overline{\Delta \tau / \Delta x}$ | | ---: | :---: | ---: | :---: | :---: | :---: | | $(\mathrm{~s})$ | $(\mathrm{m} / \mathrm{s})$ | $(\mathrm{m})$ | $(\mathrm{s})$ | $\Delta \mathrm{m} /$ trace $)$ <br> $(\mathrm{ms} /$ trace $)$ | | | 1 | 2500 | 625 | 0.134 | 10 | 11.5 | | 2 | 3000 | 1800 | 0.400 | 10 | 12.5 | | 3 | 3500 | 3675 | 0.858 | 10 | 14.0 | | 4 | 4000 | 6400 | 1.600 | 10 | 16.7 | | 5 | 4500 | 10125 | 2.820 | 10 | 23.0 |
(c) The horizontal displacement d x d x d_(x)d_{x}dx is a function of the velocity squared. If there is a 20 percent error in the velocity used in migration, then the event is misplaced by an error of 44 percent.
(d) The vertical displacement d t d t d_(t)d_{t}dt also increases with time and velocity.
(e) The steeper the event dip, the more the horizontal and vertical displacements after migration.
In Figure 4.1-1a, assume that the zero-offset section was recorded only between surface locations A A AAA and B B BBB. The time section would include the event C D C D C^(')D^(')C^{\prime} D^{\prime}CD, but when migrated, the event would migrate out of the section, resulting in a blank migrated section (Figure 4.11b). Therefore, the data on a stacked section are not necessarily confined to the subsurface below the seismic line. The converse is even more important; the structure below the seismic line may not be recorded on the seismic section. Suppose that the data were recorded only between surface locations O O OOO and A A AAA. This time, the resulting time section would be blank. So, we should not record between A A AAA and B B BBB, and neither should we record between O O OOO and A A AAA. Instead, we should record between O O OOO and B B BBB in order to record the reflector of interest properly and also to migrate it properly.
In areas with a structural dip, line length must be chosen by considering the horizontal displacements of dipping events from the structures causing the events. This is an important consideration, especially in 3-D seismic work. The areal surface coverage of a survey usually is larger than the areal subsurface coverage of interest.
To achieve a complete image of a dipping reflector, also, the recording time must be long enough. For
FIG. 4.1-3. (a) A zero-offet section modeled from the dipping reflectors shown in (b). The medium velocity is constant 3500 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s and the trace spacing is 25 m 25 m 25m25 \mathrm{~m}25 m. The true dip angles of the reflectors vary from 0 to 45 degrees at 5 -degree increment. Migration of the zero-ofiset section (a) yieids the model of the dipping reflectors (b).
(a)
(b)
FIG. 4.1-4. A portion of a CMP stack (a) before and (b) after migration. Note the group of events with a range of dips that fan out from a fault plane. Migration has moved them in the updip direction, made them shorter and steeper.
FIG. 4.1-5. Curyed reflecting interfaces (synclines and anticlines) (a) before and (b) after migration. See text for detals. (Modeling courtesy Union Oil Company.)
FIG. 4.1-6. (a) A velocity-depth model consisting of a synclinal reflector; (b) selected normal-incidence arrivals on the sero-offet section Trace the bowtie in the time section.
example, if only O E O E OEO EOE seconds were recorded (Figure 4.11), then the recorded segment C D C D C^(')D^('')C^{\prime} D^{\prime \prime}CD would yield only part of the complete image C D C D CDC DCD. An excellent example of recording deeper in time and with longer line length for steeper dips is shown in Figure 4.0-1. Proper imaging of the salt dome boundary required that data be recorded for more than 6 s 6 s 6s6 \mathrm{~s}6 s.
The migration concepts described above are demonstrated further by the dipping events model in Figure 4.1-3. The edge diffractions are included here. The dipping reflectors on the zero-offset section are steepened, shortened, and moved in the updip direction as a result of migration. A field data example of a series of dipping events on a stacked section before and after migration is shown in Figure 4.1-4. Note that the steeper the dip, the more the event moves after migration.
So far, only linear reflectors were considered. We now consider a more realistic geologic situation that involves curved reflecting interfaces. Figure 4.1-5 shows
(a)
(b)
FIG. 4.1-7. A portion of a CMP stack (a) before and (b) after migration. Antichnes appear bigger, while synclines appear smaller than their actual sizes on the unmigrated section (a).
three synclines and a smali anticlinal feature. The synclines appear as bowties on the zero-offset section. By using the principles deduced from the geometry of Figure 4.1-1, note that as a result of migration, segment A A AAA of the bow tie moves in the updip direction to the left. Similarly, segment B B BBB moves to the right, while fattopped segment C C CCC does not move much at all. Consequently, after migration the flanks of bow ties associated with synclines are opened up. On the other hand, the small anticline seems to be broader on the zero-offset section than it is on the migrated section. Again note that segment D D DDD moves updip to the right, while segment E E EEE moves updip to the left as a result of migration. Thus, synclines broaden and anticlines compress us a result of migration. Migration velocities also affect the apparent size of the structure; higher velocities mean more migration and, hence, smaller anticlinal structure.
Why does a syncline look like a bowtie on the stacked section? The answer is in Figure 4.1-6, where a symmetric syncline is modeled. Given the subsurface model in Figure 4.1-6a, the normal-incidence rays can be computed to derive the zero-offset traveltime section in Figure 4.1-6b. Only five CMP locations are shown for clarity. At locations 2 and 4, there are two distinct arrivals, while at location 3 , there are three distinct arrivals. By filling in the intermediate raypaths, the bow tie character of the syncline can be constructed on the time section. Complete the procedure by tracing the traveltime trajectory in Figure 4.1-6b.
Two field data examples containing synclinal and anticlinal structures are shown in Figures 4.1-7 and 4.1-8. In Figure 4.1-7, note that the synclinal feature broadens and the anticlinal feature narrows as a result of migration. In Figure 4.1-8, the bow ties associated with two small synclinal besins A A AAA and B B BBB grow larger in depth. After migration, the bowties are untied and the synclines are delineated.

Kirchhoff Migration

Claerbout (1985) uses the harbor example in Figure 4.19 to describe the physical principles of migration. Assume that a storm barrier exists at some distance z 3 z 3 z_(3)z_{3}z3 from the beach and that there is a gap in the barrier. Inagine a calm afternoon breeze that comes from the ocean as a plane incident wave. The wavefront is parallel to the storm barrier. As we walk along the beach line, we see a wavefront different from a plane wave. The gap on the storm barrier has acted as a secondary source and generated the semicircular wavefront that is propagating toward the beach.
If we did not know about the storm barrier and the gap, we might want to lay out a recelver cable along the beach to record the approaching waves. This experiment
(a)
(b)
FIG. 4.1-8. A portion of a CMP stack (a) before and (b) after migration. Migration unties the bowties and turns them into synclines below A A AAA and B B BBB.
is illustrated in Figure 4.1-10 with the recorded time section. Physicists call the gap on the barrier a pont aperture. It is somewhat similar to a, pont source, since both generate circular wavefronts. However, the amplitudes on the wavefront that propagate outward from a point source are isotropic, while those from a. point aperture are angle-dependent. The point aperture on the barrier acts as a Huygens' secondary source.
From the beach experiment, we find that Huygens' secondary source responds to a plane incident. wave and generates a semicircular wavefront in the ' x z x z x-zx-zxz plane. The response in the x t x t x-tx-txt plane is the diffaction hyperbola shown in Figure 4.1-11.
Imagine that the subsurface consists of points along each reflecting horizon that behave much as the gap on the storm barrier. From Figure 4.1-12, these points act as Huygens' secondary sources and produce hyperbolic traveltime trajectories. Moreover, as the sources (the points on the reflecting interface) get closer to each other, superposition of the hyperbolas produces the response of the actual reflecting interface (Figure 4,1-13). In terms of the harbor example, this is like assuming that the barrier is wiped out by a storm so that the primary incident plane wave reaches the beach without modification. The diffraction hyperbolas, which are caused by sharp discontinuities at both ends of the reflector in Figure 4.1-13, remain. These hyperbolas are equivalent to diffactions seen at fault boundaries on stacked sections.
In summary, we find that reflectors in the subsurface can be visualized as being made up of many points that act as Huygens' secondary sources. We also find that the zero-offset section consists of a superposition of the many hyperbolic traveltime responses. Moreover, when there are discontinuities (faults) along the reflector, diffraction hyperbolas often stand out.
Ocean
FIG. 4.1-9. The gap in the barrier acts as Huygeas' secondary source, causing the circular wavefronts that approach the beach line. (Adapted from Claerbout, 1985.)
FIG. 4.1-10. Waves recorded along the beach generated by Huygens' secondary source (the gap in the barrier in Figure 4.1-9) have a hyperbolic traveltime trajectory.
FIG. 4.1-11. A point that represents a Huygens' secondary source (a) produces a diffraction byperbola on the zero-offiset time section (b). The vertical axis in this section is two-way time, while the vertical axis in the time section in Figure 4.1-10 is one-way time.
FIG. 4.1-12. Superposition of the zero-offset responses (b) of a discrete number of Huygens' secondary sources as in (a).
FIG. 4.1-13. Superposition of the zero-offset responses (b) of a continuum of Huygens' secondary sourcts as in (a).

Diffraction Summation

Huygens' secondary source signature is a semicircle in the x z x z x-zx-zxz plane and a hyperbola in the x t x t x-tx-txt plane, This characterization of point sources in the subsurface leads to two practical migration schemes. Figure 4.114a shows a zero-offset section that consists of a single arrival at a single trace. This event migrates to a semicircle (Figure 4.1-14b). From Figure 4.1-14, note that the zero-offset section recorded over a constant-velocity earth model consisting of a semicircular reflecting interface contains a single blip of energy at a single trace as in Figure 4.1-14a. Since this recorded section consists of an impulse, the migrated section in Figure 4.1-14b can be called the migration impulse response. An alternate scheme for migration results from the observation that a zero-offset section consisting of a single diffraction hyperbola migrates to a single point (Figure 4.1-15b).
The first method of migration is based on the superposition of semicircles, while the second method is based on the summation of amplitudes along hyperbolic paths. The first method was used before the age of digital computers. The second method, which is known as the diffraction summation method, was the first computer implementation of migration.
The migration scheme based on the semicircle superposition consists of mapping the amplitude at a sample in the input x t x t x-tx-txt plane of the unmigrated time section onto a semicircle in the output x z x z x-zx-zxz plane. The migrated section is formed as a result of the superposition of the many semicircles.
The migration scheme based on diffraction summation consists of searching the input data in the x t x t x-tx-txt plane for energy that, would have resulted if a diffracting source (Huygens' secondary source) were located at a particular point in the output x z x z x-zx-zxz plane. This search is carried out by summing the amplitudes in the x t x t x-tx-txt plane along the diffraction curve that corresponds to Huygens' secondary source at each point in the x z x z x-zx-zxz plane. The result of this summation then is mapped onto the corresponding point in the x z x z x-zx-zxz plane. As noted early in this section, within the context of time migration, however, the summation result actually is mapped onto the x τ x τ x-taux-\tauxτ plane, where τ τ tau\tauτ is the event time in the migrated position.
The curvature of the hyperbolic trajectory for amplitude summation is governed by the velocity function. The equation for this trajectory can be derived from the geometry of Fjgure 4.1-15. A formal derivation also is provided in Section D.2. Assuming a horizontally layered velocity-depth model, the velocity function used to compute the traveltime trajectory is the rms velocity at the apex of the hyperbola at time τ τ tau\tauτ (Section 3.1).
(a)
(b)
FIG. 4.1-14. Principles of migration based on semicircle superposition. (a) Zero-ofset section (trace interval, 25 m 25 m 25m25 \mathbf{~ m}25 m; constant velocity, 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s ), (b) migration.
(B)
(b)
FIG. 4.1-15. Principles of migration based on diffraction summation. (a) Zero-offset section (trace interval, 25 m 25 m 25m25 \mathrm{~m}25 m; constant velocity, 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s ), (b) migration. The amplitude at input trace location B B BBB along the flank of the travoltime hyperbola is mapped onto output trace location A A AAA at the apex of the hyperbola by equation (4-4)
From the triangle C O A C O A COAC O ACOA in Figure 4.1-15a, we note that
t 2 = τ 2 + 4 x 2 v r m s 2 t 2 = τ 2 + 4 x 2 v r m s 2 t^(2)=tau^(2)+(4x^(2))/(v_(rms)^(2))t^{2}=\tau^{2}+\frac{4 x^{2}}{v_{r m s}^{2}}t2=τ2+4x2vrms2
Having computed the input time t t ttt, the amplitude at input location B B BBB is placed on the output section at location A A AAA, corresponding to the output time τ τ tau\tauτ at the apex of the hyperbola.
From Section 3.1, refection traveltimes in a layered earth approximate small-spread hyperbolas. This may seem to impose a serious restriction on the aperture width the lateral extent of the diffraction hyperbola, in the summation process. However, the small-spread approximation is valid even at large distances from the apex, and the errors associated with it are insignificant a.t late times. In practice, this approximation is not usually an issue.

Amplitude and Phase Factors

Now consider several factors associated with the amplitude and phase behavior of the waveform along the diffraction hyperbola. From Figure 4.1-9, given the alternative of standing at location A A AAA or B B BBB, we intuitively think that it is safer to stand at location B B BBB. This is because the wave amplitude at location A A AAA, which is on the z z zzz-axis, is stronger than the wave amplitude at location B B BBB, which is at an oblique angle from the z z zzz-axis. As mentioned earlier, this is one difference between a point source with uniform amplitude response at all angles and the point aperture that produces a wavefront with angle-dependent amplitudes. This angle dependence of amplitudes, which is described by the obliquity factor, should be considered before summation. To correct for the obliquity factor, the amplitude at location B B BBB in Figure 4.1-15a is scaled by the cosine of the angle between B C B C BCB CBC and C A C A CAC ACA before it is placed at output location A A AAA.
Another factor is the spherical divergence of wave amplitudes. Again, from Figure 4.1-9, given the alternative of standing at location B B BBB or C C CCC, we prefer to stand at location C C CCC. The reason for this is that the wave amplitude along the wavefront at location C C CCC, which is farther from the point aperture source, is weaker than the wave amplitude at location B B BBB. Wave energy decays as ( 1 / r 2 ) 1 / r 2 (1//r^(2))\left(1 / r^{2}\right)(1/r2), where r r rrr is the distance from the source to the wavefront, while amplitudes decay as ( 1 / r ) ( 1 / r ) (1//r)(1 / r)(1/r). Thus, amplitudes must be scaled by factor ( 1 / r ) ( 1 / r ) (1//r)(1 / r)(1/r) before summation for wave propagation in three dimensions.
Finally, there is a third factor that involves the inherent property of Huygens' secondary source waveform. This factor is difficult to explain from a physical viewpoint. Nevertheless, it is obvious from Figure 4.113 that Huygens' secondary sources must respond as a wavelet along the hyperbolic paths with a unique phase and frequency characteristic. Otherwise, there would be no amplitude cancelation when they are close to one another. The waveform that results from the summation must be restored in both phase and amplitude.
In summary, we must consider the following three factors before diffraction summation:
(a) The oblqquaty factor or the directivity factor, which describes the angle dependence of amplitudes and is given by the cosine of the angle between the direction of propagation and the vertical axis z z zzz (Figure 4.1-15).
(b) The spherical spreading factor, which is proportional to 1 / U r 1 / U r sqrt(1//Ur)\sqrt{1 / U r}1/Ur for 2 D 2 D 2-D2-D2D wave propagation, and ( 1 / v r ) ( 1 / v r ) (1//vr)(1 / v r)(1/vr) for 3 D 3 D 3-D3-\mathrm{D}3D wave propagation.
(c) The wavelet shaping factor, which is designed with a 45-degree constant phase spectrum and an amplitude spectrum proportional to the square root of the frequency for 2-D migration. For 3-D migration, the phase shift is 90 degrees and the amplitude is proportional to frequency.

Kirchhoff Summation

The diffraction summation that incorporates the obliq uity, spherical spreading and wavelet shaping factors is called the Kirchhoff summation, and the migration method based on this summation is called the Kirchhoff migration. To perform this method, multiply the input data by the obliquity and spherical spreading factors. Then apply the filter with the above specifications and sum along the hyperbolic path that is defined by equation (4-4). Place the result on the migrated section at time τ τ tau\tauτ corresponding to the apex of the hyperbola. In practice, the order of the filter application, specified by factor (c), and summation can be interchanged without sacrificing accuracy because the summation is a linear process and the filter is independent of time and space.
The velocity used in equation (4-4) is taken as the rms velocity, which can be allowed to vary laterally. However, lateral variation in velocity distorts the hyperbolic nature of the diffraction pattern and somehow must be considered. The value for the rms velocity typically is that of the output time sample; that is, the apex time τ τ tau\tauτ of the hyperbola.
What was determined from a physical point of view in the preceding discussion can be rigorously described by the integral solution to the scalar wave equation. Schneider (1978), Berryhill (1979) and Berkhout (1980) are excellent references for the mathematical treatment of the Kirchhoff migration method. The integral solution of the scalar wave equation yields three terms; the far-field term which is proportional to ( 1 / r ) ( 1 / r ) (1//r)(1 / r)(1/r), and two other terms which are proportional to ( 1 / r 2 ) 1 / r 2 (1//r^(2))\left(1 / r^{2}\right)(1/r2). Hence,
it is the far-field term that makes the most contribution to the summation that is used in practical implementation of Kirchhoff migration. The output image P out ( x 0 , z = v τ / 2 , t = 0 ) P out  x 0 , z = v τ / 2 , t = 0 P_("out ")(x_(0),z=v tau//2,t=0)P_{\text {out }}\left(\mathbf{x}_{0}, z=v \tau / 2, t=0\right)Pout (x0,z=vτ/2,t=0) at a subsurface location ( x 0 , z ) x 0 , z (x_(0),z)\left(x_{0}, z\right)(x0,z) using only the far-field term is computed from the 2-D zero-offset wavefield P 8 n ( x , z = 0 , t ) P 8 n ( x , z = 0 , t ) P_(8n)(x,z=0,t)P_{8 n}(x, z=0, t)P8n(x,z=0,t), which is measured at the surface ( z = 0 ) ( z = 0 ) (z=0)(z=0)(z=0), by the following summation over a spatial aperture
P out = Δ x 2 π r [ cos θ v r m s T ρ ( t ) P n ] P out  = Δ x 2 π r cos θ v r m s T ρ ( t ) P n P_("out ")=(Delta x)/(2pi)sum_(r)[(cos theta)/(sqrt(v_(rms)T))rho(t)**P_(n)]P_{\text {out }}=\frac{\Delta x}{2 \pi} \sum_{\mathbf{r}}\left[\frac{\cos \theta}{\sqrt{v_{\mathrm{rms}} T}} \rho(t) * P_{\mathrm{n}}\right]Pout =Δx2πr[cosθvrmsTρ(t)Pn]
where v r m s v r m s v_(rms)v_{r m s}vrms is the rms velocity at the output point ( x 0 , z ) x 0 , z (x_(0),z)\left(x_{0}, z\right)(x0,z) and r = ( x x 0 ) 2 + z 2 r = x x 0 2 + z 2 r=sqrt((x-x_(0))^(2)+z^(2))r=\sqrt{\left(x-x_{0}\right)^{2}+z^{2}}r=(xx0)2+z2, which is the distance between the input ( x , z = 0 ) ( x , z = 0 ) (x,z=0)(x, z=0)(x,z=0) and the output ( x 0 , z ) x 0 , z (x_(0),z)\left(x_{0}, z\right)(x0,z) points. The asterisk denotes convolution of the rho filter ρ ( t ) ρ ( t ) rho(t)\rho(t)ρ(t) with the input wavefield P i n P i n P_(in)P_{i n}Pin.
The rho filter ρ ( t ) ρ ( t ) rho(t)\rho(t)ρ(t) corresponds to the time derivative of the measured wavefield, which yields the 90 degree phase shift and adjustment of the amplitude spectrum by the ramp function ω ω omega\omegaω of frequency (Table A-1 of Appendix A). For 2-D migration, the halfderivative of the wavefield is used. This is equivalent to the 45-degree phase shift and adjustment of the amplitude spectrum by a function of frequency defined as ω ω sqrtomega\sqrt{\omega}ω. Since the rho filter is independent of the spatial variables, it actually can be applied to the output of the summation in equation (4-5). Finally, the far-field term in equation (4-5) is proportional to the cosine of the angle of propagation (the directivity term or the obliquity factor) and is inversely proportional to v r v r vrv rvr (the spherical spreading term) in three dimensions. In two dimensions, the spherical spreading term is v r v r sqrt(vr)\sqrt{v r}vr.
Equation (4-5) can be used to compute the wavefield at any depth z z zzz. The ouput image P out P out  P_("out ")P_{\text {out }}Pout  is computed at ( x 0 , z = v τ / 2 , t = 0 ) x 0 , z = v τ / 2 , t = 0 {:x_(0),z=v tau//2,t=0)\left.x_{0}, z=v \tau / 2, t=0\right)x0,z=vτ/2,t=0) using the input wavefield P z n P z n P_(zn)P_{z n}Pzn at ( x , z = 0 , t r / v ) ( x , z = 0 , t r / v ) (x,z=0,t-r//v)(x, z=0, t-r / v)(x,z=0,tr/v). To obtain the migrated section at an output time τ τ tau\tauτ, equation (4-5) must be evaluated at z = v τ / 2 z = v τ / 2 z=v tau//2z=v \tau / 2z=vτ/2 and the imaging principle must be invoked by mapping amplitudes of the resulting wavefield at t = 0 t = 0 t=0t=0t=0 onto the migrated section at output time τ τ tau\tauτ. The complete migrated section is obtained by performing the summation in equation (4-5) and setting t = 0 t = 0 t=0t=0t=0 for each output location. The range of the summation is called the migration aperture.

Finite-Difference Migration

To describe the physical basis of finite-difference migration, recall the harbor example of Figure 4.1-9. Instead of taking the section recorded along the beach, which contains the diffraction hyperbola, then collapsing it to get the migrated section in Figure 4.1-15, consider the following alternative procedure. Again, start with the wavefield recorded along the beach (Figure 4.1-16a). Assume that the barrier is 1250 m 1250 m 1250m1250 \mathrm{~m}1250 m from the beach. Now move the recording cable into the water, 250 m 250 m 250m250 \mathrm{~m}250 m from the beach. Start recording at the instant the plane wave hits the barrier. The recorded section is shown in Figure 4.116b. Move the cable 500 m 500 m 500m500 \mathrm{~m}500 m from the beach and record the section in Figure 4.1-16c, followed by a recording 750 m 750 m 750m750 \mathrm{~m}750 m from the beach to obtain the section in Figure 4.1-16d. Finally, 1000 m 1000 m 1000m1000 \mathrm{~m}1000 m from the beach, record the section shown in Figure 4.1-16e.
Note that each recording yields a hyperbola in which the apex moves closer to zero time. The actual extent of the recording cable is denoted by the solid line on top of each frame. Had we recorded at the barrier ( 1250 m 1250 m 1250m1250 \mathrm{~m}1250 m from the beach), the apex of the hyperbola would be positioned at t = 0 t = 0 t=0t=0t=0.
In Kirchhoff migration, the diffraction hyperbola is collapsed by summing the amplitudes, then placing them at the apex. The alternative approach implied by the result of the experiment shown in Figure 4.116 is to use the hyperbola recorded a distance away from the beach to construct the hyperbola that would be recorded at another distance closer to the source of the diffraction hyperbola. The process is stopped when the hyperbola collapses to its apex. In the harbor experiment, this collapse occurs when the receiver cable coincides with the barrier, or, equivalently, when t = 0 t = 0 t=0t=0t=0. As stated in the introductory section, this is called the amaging pruciple.

Downward Continuation

The harbor experiment described above can be simulated in the computer. Pretend that moving the receiver cable from the beach into the water closer to the barrier is like moving the receiver cable from the surface down into the earth closer to the reflectors. Think of the gap on the barrier as equivalent to a point diffractor on a reflecting interface causing the diffraction hyperbola (Figure 4.1-17a). Start with the wavefield recorded at the surface and move the receivers down to depth levels at finite intervals. Downward continuation of the upcoming waveficld at the surface, therefore, can be considered equivalent to lowering the receivers into the earth.
The computer-simulated wavefields at these different depths are shown in Figure 4.1-17. By applying the imaging principle at each depth, the entire wavefield is imaged. The final output from this process is the migrated section. The last section (panel f f fff ) at 1250 m 1250 m 1250m1250 \mathrm{~m}1250 m has only one arrival at t = 0 t = 0 t=0t=0t=0. The recording cable is on the storm barrier and the arrival from the gap occurs at t = 0 t = 0 t=0t=0t=0. As the cable moved into the ocean and
FIG. 4.1-16. Moving the receiver cable in the harbor experiment (Figure 4.1-9) from the beach into the water at discrete intervals paraliel to the beach line. Numbers on top indicate the distance of the recelver cable from the beach line.
FIG. 4.1-17. Computer simulation of the experiment illustrated in Figure 4.1-16. Here, we downward continue the receivers at discrete depth intervals. The numbers on top indicate the distance of the receiver cable from the surface, z = 0 z = 0 z=0z=0z=0.
recorded closer to the barrier, the recorded diffraction hyperbola arrived earlier, and became shorter and more compressed. It collapsed to a point when the receivers coincided with the storm barrier over which the source point forms a gap.
There is one important difference between the physical experiment in Figure 4,1-16 and the computersimulated downward-continuation experiment in Figure 4.1-17. The receiver cable is the same at each step in Figure 4.1-16, whereas the effective cable length gets shorter and shorter toward the source (the gap in the barrier) in Figure 4.1-17. This is because we started by recording the wavefield at the surface (Figure 4.1-16a) with a finite cable length. The recorded information is confined to within the two raypaths depicted on the section in Figure 4.1-17a. As the cable moves closer to the source, the effective receiver cable containing the information is confined to smaller and smaller lengths. Although receivers are lowered vertically, energy moves down along raypaths it originaliy took on the way up.
To relate these recordings at different depths (Figure 4.1-17), we superimpose them as shown in Figure 4.1-18a. Moreover, the recordings can be shifted so that the apexes of the hyperbolas coincide and are positioned at a time that is equivalent to the distance from the surface to the diffractor as shown in Figure 4.1-18b. This is called tame retardation.
Reconsider the results from the computer simuiation of the harbor experiment in Figure 4.1-17. Suppose we stopped recording at a depth of 1000 m 1000 m 1000m1000 \mathrm{~m}1000 m before
(a)
(b)
FIG. 4.1-18. (a) Superposition of the time sections in Figure 4 1-17; (b) removing the translational effect by retardation to place the energy at the apex of the hyperbola obtaned intially along the beach line.
the barrier. The original hyperbola in Figure 4.1-17a was partially collapsed at this depth (Figure 4.1-17e). Therefore, downward continuing to a depth short of the true depth of the source causes undemigration. Diffractions and dipping events also are undermigrated if incorrectly low velocities are used for migration.
Assume that the recording continues and passes beyond barrier position z 3 z 3 z_(3)z_{3}z3 (Figure 4.1-9). We infer that the focused energy on the section at this depth (Figure 4.1-17f) would propagate through the focal point and turn into hyperbolas that are the mirror images of those in Figures 4.1-17a through 4.1-17e. We have downward continued more than necessary. This yields overmigration, which also is caused by incorrectly high velocities. From these observations, note that downward continuing to a wrong depth is like downward continuing with the wrong velocity (Doherty and Claerbout, 1974).
Another important issue to consider is how often the extrapolated wavefield should be computed. When going from one frame to another in Figure 4.1-17, what should the depth step size be? This is discussed in detail later in Section 4.3 .

Differencing Schemes

Finite-difference migration algorithms are based on differential solutions to the scalar wave equation that are used to downward continue the input wavefield recorded at the surface. A simple numerical example illustrates the finite-difference method of solving differential equations (Clacrbout, 1985). Assume that you have $ 100 $ 100 $100\$ 100$100 today. Given an annual inflation rate of 10 percent, for the same buying power next year, you need $ 110 $ 110 $110\$ 110$110. A computer algorithm can determine the face value of the present $ 100 $ 100 $100\$ 100$100 in future years. Table 4 3 4 3 43\mathbf{4 3}43 shows the results of extrapolation from one year to the next.
Given the present value, 100, find future values in the data column. The following equation solves for the unknown x x xxx :
( 1.0 ) × x + ( 1.1 ) × ( 100 ) = 0 ( 1.0 ) × x + ( 1.1 ) × ( 100 ) = 0 (1.0)xx x+(-1.1)xx(100)=0(1.0) \times x+(-1.1) \times(100)=0(1.0)×x+(1.1)×(100)=0
which yields x = 110 x = 110 x=110x=110x=110. We used a two-point operator and aligned it with the data column as indicated in Table 4-3. Similarly, we have
( 1.0 ) × x + ( 1.1 ) × ( 110 ) = 0 , ( 1.0 ) × x + ( 1.1 ) × ( 110 ) = 0 (1.0)xx x+(-1.1)xx(110)=0", "(1.0) \times x+(-1.1) \times(110)=0 \text {, }(1.0)×x+(1.1)×(110)=0
which yjelds x = 121 x = 121 x=121x=121x=121. By using the new value for x x xxx, we obtain
( 1.0 ) × x + ( 1.1 ) × ( 121 ) = 0 , ( 1.0 ) × x + ( 1.1 ) × ( 121 ) = 0 (1.0)xx x+(-1.1)xx(121)=0", "(1.0) \times x+(-1.1) \times(121)=0 \text {, }(1.0)×x+(1.1)×(121)=0
which yields x = 133 x = 133 x=133x=133x=133, and so on. By moving the operator down in the time direction as shown in Table 4-3, we extrapolate the data column into the future.
Table 4-3. Simple extrapolation of a data vector in time.
Operator Data Time Step
-1.1 100 0
1.0 x x xxx 1
-1.1 100 0
1.0 110 1
x x xxx 2
100 0
-1.1 110 1
1.0 121 2
x x xxx 3
Operator Data Time Step -1.1 100 0 1.0 x 1 -1.1 100 0 1.0 110 1 x 2 100 0 -1.1 110 1 1.0 121 2 x 3| Operator | Data | Time Step | | :---: | :---: | :---: | | -1.1 | 100 | 0 | | 1.0 | $x$ | 1 | | | | | | -1.1 | 100 | 0 | | 1.0 | 110 | 1 | | | $x$ | 2 | | | 100 | 0 | | -1.1 | 110 | 1 | | 1.0 | 121 | 2 | | | $x$ | 3 |
Equation (4-6a) is generalized as
( 1.0 ) × P ( t + 1 ) + ( 1.1 ) × P ( t ) = 0 , ( 4 7 a ) ( 1.0 ) × P ( t + 1 ) + ( 1.1 ) × P ( t ) = 0 , ( 4 7 a ) (1.0)xx P(t+1)+(-1.1)xx P(t)=0,quad(4-7a)(1.0) \times P(t+1)+(-1.1) \times P(t)=0, \quad(4-7 a)(1.0)×P(t+1)+(1.1)×P(t)=0,(47a)
which is rewritten in the form
P ( t + 1 ) P ( t ) ( 0.1 ) × P ( t ) P ( t + 1 ) P ( t ) ( 0.1 ) × P ( t ) P(t+1)-P(t)-(0.1)xx P(t)P(t+1)-P(t)-(0.1) \times P(t)P(t+1)P(t)(0.1)×P(t)
where t t ttt is the time variable and P P PPP is the quantity being extrapolated. Instead of defining the time interval as one unit, we can define it as an arbitrary increment of time Δ t Δ t Delta t\Delta tΔt. Also, assume that the inflation rate is a a aaa. Equation (4-7b) then takes the more general form
P ( t + Δ t ) P ( t ) = a P ( t ) P ( t + Δ t ) P ( t ) = a P ( t ) P(t+Delta t)-P(t)=aP(t)P(t+\Delta t)-P(t)=a P(t)P(t+Δt)P(t)=aP(t)
Alternatively, we could use the average of the present and future values on the right side of this equation:
P ( t + Δ t ) P ( t ) = a 2 [ P ( t + Δ t ) + P ( t ) ] P ( t + Δ t ) P ( t ) = a 2 [ P ( t + Δ t ) + P ( t ) ] P(t+Delta t)-P(t)=(a)/(2)[P(t+Delta t)+P(t)]P(t+\Delta t)-P(t)=\frac{a}{2}[P(t+\Delta t)+P(t)]P(t+Δt)P(t)=a2[P(t+Δt)+P(t)]
Equations (4-8a) and (4-8b) now can be put into the form of equation (4-6a) us
P ( t + Δ t ) + ( 1 a ) P ( t ) = 0 , P ( t + Δ t ) + ( 1 a ) P ( t ) = 0 , P(t+Delta t)+(-1-a)P(t)=0,P(t+\Delta t)+(-1-a) P(t)=0,P(t+Δt)+(1a)P(t)=0,
and
( 1 a 2 ) P ( t + Δ t ) + ( 1 a 2 ) P ( t ) = 0 , ( 4 9 b ) 1 a 2 P ( t + Δ t ) + 1 a 2 P ( t ) = 0 , ( 4 9 b ) (1-(a)/(2))P(t+Delta t)+(-1-(a)/(2))P(t)=0,quad(4-9b)\left(1-\frac{a}{2}\right) P(t+\Delta t)+\left(-1-\frac{a}{2}\right) P(t)=0, \quad(4-9 b)(1a2)P(t+Δt)+(1a2)P(t)=0,(49b)
By using either equation (4-9a) or equation (4-9b), we compute the future values of P ( t ) P ( t ) P(t)P(t)P(t) from a given initial value as shown in Table 4-4.
The operator in which the coefficient of the future value P ( t + Δ t ) P ( t + Δ t ) P(t+Delta t)P(t+\Delta t)P(t+Δt) is unity is called the explect operator. Stability of the finite-difference solution the problem
Table 4-4. Application of two-point implicit and explicit operators to extrapolate data P P PPP from t t ttt to t + Δ t t + Δ t t+Delta tt+\Delta tt+Δt.
Explicit
Operator
Explicit Operator| Explicit | | :---: | | Operator |
Implicit
Operator
Implicit Operator| Implicit | | :---: | | Operator |
Data
Column
Data Column| Data | | :---: | | Column |
1 a 1 a -1-a-1-a1a 1 a / 2 1 a / 2 -1-a//2-1-a / 21a/2 P ( t ) P ( t ) P(t)P(t)P(t)
1 1 a / 2 1 a / 2 1-a//21-a / 21a/2 P ( t + Δ t ) P ( t + Δ t ) P(t+Delta t)P(t+\Delta t)P(t+Δt)
"Explicit Operator" "Implicit Operator" "Data Column" -1-a -1-a//2 P(t) 1 1-a//2 P(t+Delta t)| Explicit <br> Operator | Implicit <br> Operator | Data <br> Column | | :---: | :---: | :---: | | $-1-a$ | $-1-a / 2$ | $P(t)$ | | 1 | $1-a / 2$ | $P(t+\Delta t)$ |
of wave amplitudes growing from one extrapolation step to another, can be an issue with this type of operator (Section D.6) An mplect operator produces stable results because of averaging on the right side of equation (4-9b), known as the Crank-Nicolson scheme. For the differential equations used in finite-difference migration algorithms, such as the parabolic equation described in Section D. 3, scalar a becomes a matrix coefficient, Implicit schemes require inversion of this matrix. However, no inversion is needed with explicit schemes, since future values can be written explicitly in terms of only past values.
Equation (4-9a) is rewritten by redefining scalar a a aaa ts a Δ t Δ t Delta t\Delta tΔt to obtain
P ( t + Δ t ) P ( t ) Δ t = a P ( t ) P ( t + Δ t ) P ( t ) Δ t = a P ( t ) (P(t+Delta t)-P(t))/(Delta t)=aP(t)\frac{P(t+\Delta t)-P(t)}{\Delta t}=a P(t)P(t+Δt)P(t)Δt=aP(t)
The left side of equation (4-10) is the discrete representation of the continuous derivative of P P PPP with respect to time, d P / d t d P / d t dP//dtd P / d tdP/dt. Therefore, equation (4-10) is the finztedefference equation that corresponds to the defferential equation
d P d t = a P ( t ) d P d t = a P ( t ) (dP)/(dt)=aP(t)\frac{d P}{d t}=a P(t)dPdt=aP(t)
We have derived the differential equation that describes the inflation of money (equation 4-11). Now consider the analysis in reverse order. We start with the differential equation (4-11), and write the corresponding difference equation (4-10), which is the equation that is solved in the computer. This equation is written in either the explicit (equation 4-9a) or implicit (equation 4-9b) form to extrapolate the present value of P P PPP to the future.
This example illustrates how finite-difference schemes can solve differential equations in the computer. The scalar wave equation can be treated in a similar, but more complicated manner. Complications arise because it is a partial differential equation that contains the second derivatives of the wavefield with respect to depth, time, and spatial axes. Setting up the computer algorithm is more involved and is not discussed here. Clacrbout ( 1976 , 1985 ) ( 1976 , 1985 ) (1976,1985)(1976,1985)(1976,1985) provides details of various aspects of the finite-difference migration methods.

Rational Approximations for Implicit Schemes

The scalar wave equation is a two-way wave equation in depth that describes propogation of both upcoming and downgoing waves. If we consider the resulting wavefield from the exploding reflectors model as the upcoming waves, then we are really interested in o one-way wave equation to doumuand continue the upcomeng waves. In fact, we normally use some rational approximation to the one-way wave equation in finite-difference implementations.
To get the actual differential equation to be used in downward extrapolation of the upcoming waves, and therefore to perform a finite-difference migration, the general strategy is as follows:
(a) Start with the two-way scalar wave equation:
2 P x 2 + 2 P z 2 1 v 2 ( x , z ) 2 P t 2 = 0 2 P x 2 + 2 P z 2 1 v 2 ( x , z ) 2 P t 2 = 0 (del^(2)P)/(delx^(2))+(del^(2)P)/(delz^(2))-(1)/(v^(2)(x,z))(del^(2)P)/(delt^(2))=0\frac{\partial^{2} P}{\partial x^{2}}+\frac{\partial^{2} P}{\partial z^{2}}-\frac{1}{v^{2}(x, z)} \frac{\partial^{2} P}{\partial t^{2}}=02Px2+2Pz21v2(x,z)2Pt2=0
where x x xxx and z z zzz are the space variables, t t ttt is the time variable, v v vvv is the velocity of wave propagation, and P ( x , z , t ) P ( x , z , t ) P(x,z,t)P(x, z, t)P(x,z,t) is the pressure wavefield.
(b) Assume constant velocity and perform 3-D Fourier transform of the pressure wavefield. This is equivalent to substituting the plane-wave solution exp ( i k x x + i k z z i ω t ) exp i k x x + i k z z i ω t exp(ik_(x)x+ik_(z)z-i omega t)\exp \left(i k_{x} x+i k_{z} z-i \omega t\right)exp(ikxx+ikzziωt) to equation (4-12). The substitution yields the dispersion relation between the transform variables
k z = ω 2 v 2 k x 2 k z = ω 2 v 2 k x 2 k_(z)=∓sqrt((omega^(2))/(v^(2))-k_(x)^(2))k_{z}=\mp \sqrt{\frac{\omega^{2}}{v^{2}}-k_{x}^{2}}kz=ω2v2kx2
where k x k x k_(x)k_{x}kx and k z k z k_(z)k_{z}kz are the wavenumbers in the x x xxx and z z zzz directions, and ω ω omega\omegaω is the angular temporal frequency.
(c) We are interested in upcoming waves, hence we only need one of the two solutions. We also want to invoke the exploding reflector model by replacing v v vvv by v / 2 v / 2 v//2v / 2v/2 to obtain the following paramal dispersion relation
k z = 2 ω v 1 ( v k w 2 ω ) 2 k z = 2 ω v 1 v k w 2 ω 2 k_(z)=(2omega)/(v)sqrt(1-((vk_(w))/(2omega))^(2))k_{z}=\frac{2 \omega}{v} \sqrt{1-\left(\frac{v k_{w}}{2 \omega}\right)^{2}}kz=2ωv1(vkw2ω)2
where the horizontal waventmber k w k w k_(w)k_{w}kw has been normalized with respect to 2 ω / v 2 ω / v 2omega//v2 \omega / v2ω/v.
(d) Make a rational approximation to the square-root expression in equation (4-13b) so as to derive a differential equation (Sections D. 3 and D.4). This
approximation imposes a dip limitation to the differential equation. One approxination to the dispersion relation given by equation (4-13b) is obtained by Taylor expansion of the square root and retaining the first two terms in the series (Section D.3)
k z = 2 ω v [ 1 1 2 ( v k x 2 ω ) 2 ] k z = 2 ω v 1 1 2 v k x 2 ω 2 k_(z)=(2omega)/(v)[1-(1)/(2)((vk_(x))/(2omega))^(2)]k_{z}=\frac{2 \omega}{v}\left[1-\frac{1}{2}\left(\frac{v k_{x}}{2 \omega}\right)^{2}\right]kz=2ωv[112(vkx2ω)2]
This dispersion equation is known as the 15-degree approximation and is the basis for the first fintedifference time migration algorithm developed by Claerbout and Doherty (1972). Aibeit no longer in use, we shall review the 15-degree finite-difference algorithm for its historical significance.
(c) Operate on the pressure wavefield P ( k x , k z , ω ) P k x , k z , ω P(k_(x),k_(z),omega)P\left(k_{x}, k_{z}, \omega\right)P(kx,kz,ω) with the approximate form of the dispersion relation given by equation (4-14a), and inverse Fourier transform in the z z zzz direction to get the differential form of the approximate one-way wave equation.
z P ( k z , z , ω ) = i 2 ω v [ 1 1 2 ( v k x 2 ω ) 2 ] P ( k x , z , ω ) . z P k z , z , ω = i 2 ω v 1 1 2 v k x 2 ω 2 P k x , z , ω . (del)/(del z)P(k_(z),z,omega)=-i(2omega)/(v)[1-(1)/(2)((vk_(x))/(2omega))^(2)]P(k_(x),z,omega).\frac{\partial}{\partial z} P\left(k_{z}, z, \omega\right)=-i \frac{2 \omega}{v}\left[1-\frac{1}{2}\left(\frac{v k_{x}}{2 \omega}\right)^{2}\right] P\left(k_{x}, z, \omega\right) .zP(kz,z,ω)=i2ωv[112(vkx2ω)2]P(kx,z,ω).
(f) Recall from Figure 4.1-17 that, after each downward-continuation step, we retard the wavefield by translating it in time so that after migration, events appear in their correct depth lacations. The time retardation is done by applying a linear phase shift to the pressure wavefield P P PPP
Q = P exp ( i ω τ ) Q = P exp ( i ω τ ) Q=P exp(-i omega tau)Q=P \exp (-i \omega \tau)Q=Pexp(iωτ)
where the retarded time is
τ = 0 z d z v ¯ ( z ) τ = 0 z d z v ¯ ( z ) tau=int_(0)^(z)(dz)/(( bar(v))(z))\tau=\int_{0}^{z} \frac{d z}{\bar{v}(z)}τ=0zdzv¯(z)
and Q Q QQQ is the retarded wavefield. The velocity v ¯ ( z ) v ¯ ( z ) bar(v)(z)\bar{v}(z)v¯(z) is the horizontally averaged v ( x , z ) v ( x , z ) v(x,z)v(x, z)v(x,z). Substitute equation (4-15a) into (4-14b) to obtain the differential equation associated with the 15-degrec finitedifference algorithm in two parts
2 Q z t = v 4 2 Q x 2 2 Q z t = v 4 2 Q x 2 (del^(2)Q)/(del z del t)=(v)/(4)(del^(2)Q)/(delx^(2))\frac{\partial^{2} Q}{\partial z \partial t}=\frac{v}{4} \frac{\partial^{2} Q}{\partial x^{2}}2Qzt=v42Qx2
and
Q z = 2 [ 1 v ¯ ( z ) 1 v ( x , z ) ] Q t Q z = 2 1 v ¯ ( z ) 1 v ( x , z ) Q t (del Q)/(del z)=2[(1)/(( bar(v))(z))-(1)/(v(x,z))](del Q)/(del t)\frac{\partial Q}{\partial z}=2\left[\frac{1}{\bar{v}(z)}-\frac{1}{v(x, z)}\right] \frac{\partial Q}{\partial t}Qz=2[1v¯(z)1v(x,z)]Qt
where Q Q QQQ is the retarded wavefield. Derivation of equations ( 4 16 a , b ) ( 4 16 a , b ) (4-16 a,b)(4-16 a, b)(416a,b) is based on the assumption that velocity varies vertically. Nevertheless, in practice, the velocity function in equations (4 16 a , b ) 16 a , b ) 16 a,b)16 a, b)16a,b) can be varied laterally, provided the variation is smooth. Equation (4-16a) accounts for col- lapsing diffaction energy to the apex of the traveltime curve only. Hence, it is referred to as the diffraction term. When lateral velocity variations are significant, the diffraction curve is somewhat like a skewed hyperbola with its apex shifted laterally away from the difiraction source. This lateral shift is accounted for by the thm-lens term given by equation (4-16b) (Section D.3). If the lateral velocity variations are significant, then the thinlens term is not negligible. Migration algorithrns that implement both the diffraction and thin-lens terms represented by equations (4-16a,b) generally are two-step schemes that alternately solve these two terms. To propagate one depth step, first apply the difraction term on wavefield Q Q QQQ. The thin-lens term then is applied to the output from the diffraction calculation. A migration method that includes the effects of the thin-lens term is called depth migration, since the output section is in depth. Depth migration is warranted if there are strong lateral variations in velocity; in this case, the coefficient of the thin-lens term cannot be negligible. If we assume that velocity varies only in the vertical direction, then v ¯ ( z ) = v ( x , z ) v ¯ ( z ) = v ( x , z ) bar(v)(z)=v(x,z)\bar{v}(z)=v(x, z)v¯(z)=v(x,z). This makes the thinlens term of equation (4-16b) vanish, and we are left with the diffraction term of equation (4-16a). A migration method that implements the diffraction term (equation 4-16a), only, is known as tame megration, the output of which is in time τ τ tau\tauτ of cquation (4-15b). When recast in terms of the τ τ tau\tauτ variable, equation (4-16a) takes the form
2 Q τ t = v 2 8 2 Q x 2 2 Q τ t = v 2 8 2 Q x 2 (del^(2)Q)/(del tau del t)=(v^(2))/(8)(del^(2)Q)/(delx^(2))\frac{\partial^{2} Q}{\partial \tau \partial t}=\frac{v^{2}}{8} \frac{\partial^{2} Q}{\partial x^{2}}2Qτt=v282Qx2
This is the parabolic equation for time migration.
(g) Finally, write down the difference forms of the differential operators either in implicit form to be used in finite-difference solution of the parabolic equation (4-17) for migration.
Boundary and initial conditions are needed to solve the differential equations. The initial condition for migration is the recorded wavefield at the surface z = 0 z = 0 z=0z=0z=0. Also, in migration we assume that the wavefield is zero after a maximum observation time, typically the end time of the recorded trace. Then there are the side boundaries, beyond which assumptions must be made about the form of the wavefield.
In the ( x , z , t ) ( x , z , t ) (x,z,t)(x, z, t)(x,z,t) coordinates, the seismic section is represented by the x t x t x-tx-txt plane, while the migrated section (earth) is represented by the x z x z x-zx-zxz plane. Finitedifference migration, as discussed here, extrapolates the x t x t x-tx-txt plane in finite increments of z z zzz and outputs the wavefield at t = 0 t = 0 t=0t=0t=0 at each step (Figure 4.1-19).
FIG. 4.1-19. The seismic section represented by the x t x t x-tx-txt plane at the surface z = 0 z = 0 z=0z=0z=0 is downard continued to obtain the time sections at discrete depth levels. The direction of extrapolation is indicated by tho thick arrow. The migrated section is represented by the x z x z x-zx-zxz plane at t = 0 t = 0 t=0t=0t=0.
There are two ways to downward continue the wavefield recorded at the surface in the computer (Figure 4.1-20). Starting with the wavefield at the surface z = 0 z = 0 z=0z=0z=0 represented by the vectors in x s 1 , s 2 , s 3 , x s 1 , s 2 , s 3 , x-s_(1),s_(2),s_(3),dotsx-s_{1}, s_{2}, s_{3}, \ldotsxs1,s2,s3,, which are perpendicular to the page, we can compute the wavefield at different depth levels using the order of the computation shown in Figure 4.1-20a. Assume zero value for the bottom of the extrapolated wavefield at each depth step. So, for example, using s 7 , s 8 s 7 , s 8 s_(7),s_(8)s_{7}, s_{8}s7,s8, and 0 , compute the wavcfield at position 1 . Then use s 6 , s 7 s 6 , s 7 s_(6),s_(7)s_{6}, s_{7}s6,s7, and the wavefield already computed at position 1 , c o m 1 , c o m 1,com-1, \mathrm{com}-1,com pute that at position 2, and so on. Notice that, in this scheme, we compute the wavefield at all times for one depth step, then compute the wavefield at all times for the next depth step, followed by the next depth step, and so on. Hence, this is called the z z zzz-outer computational scheme.
The alternate scheme involves a different order of computation (Figure 4.1-20b). First, compute the wavefield at one time for all depths, then using those al. ready computed values, compute the wavefield at the next shallower time for all depths, and so on. Hence this is called the t t ttt-outer computational scheme.
In both schemes, the output migrated section is obteined by collecting the diagonal clements. Depending on the depth step size, which can be conveniently defined as the number of time samples, one collects one or more samples at each depth level. In the example shown
(a)
(b)
FIG. 4.1-20. Two algorithmic schemes to downward contonue wavefields in the computer: (a) z z zzz-outer, and (b) t t ttt outer. The midpoint axis is perpendicular to the plane of the paper. In both schemes, the CMP-stacked data are represented by the s s sss-column at z = 0 z = 0 z=0z=0z=0 (Claerbout, 1976).
in Figure 4.1-20, there are two samples from each depth step collected into the migrated section.

Reverse Time Migration

Another migration method, known as reverse time migration (Baysal et al., 1983), extrapolates an initially zero x x x x x-xx-xxx plane backward in time, bringing in the seismic data P ( x , z = 0 , t ) P ( x , z = 0 , t ) P(x,z=0,t)P(x, z=0, t)P(x,z=0,t) as a boundary condition z = 0 z = 0 z=0z=0z=0 at each time step to compute snapshots of the x z x z x-zx-zxz plane at different times. At time t = 0 t = 0 t=0t=0t=0, this x z x z x-zx-zxz plane contains the migration result P ( x , z , t = 0 ) P ( x , z , t = 0 ) P(x,z,t=0)P(x, z, t=0)P(x,z,t=0) (Figure 4.121).
The algorithmic structure for the reverse time migration is illustrated schematically in Figure 4.1-22. Start with the x t x t x-tx-txt section at the surface, z = 0 z = 0 z=0z=0z=0. Also, consider an x z x z x-zx-zxz frame at t max t max  t_("max ")t_{\text {max }}tmax . This frame is blank except for the first row which is equal to the bottom row of the x t x t x-tx-txt section at t max t max t_(max)t_{\max }tmax. Extrapolate this snapshat at t = t max t = t max t=t_(max)t=t_{\max }t=tmax to t = t max Δ t t = t max Δ t t=t_(max)-Delta tt=t_{\max }-\Delta tt=tmaxΔt by using the phase-shift operator exp ( i ω Δ t ) exp ( i ω Δ t ) exp(i omega Delta t)\exp (i \omega \Delta t)exp(iωΔt). This yields a new snapshot of the x z x z x-zx-\boldsymbol{z}xz frame at t = t max Δ t t = t max Δ t t=t_(max)-Delta tt=t_{\max }-\Delta tt=tmaxΔt. The first row of numbers in this frame is identical to the row in the x t x t x-tx-txt plane - the original unnigrated section, at t = t max Δ t t = t max Δ t t=t_(max)-Delta tt=t_{\max }-\Delta tt=tmaxΔt. Hence, replace the first row in the snapshot at t = t max Δ t t = t max Δ t t=t_(max)-Delta tt=t_{\max }-\Delta tt=tmaxΔt with the row of the x t x t x-tx-txt section at t = t max Δ t t = t max  Δ t t=t_("max ")-Delta tt=t_{\text {max }}-\Delta tt=tmax Δt and contime the extrapolation back in time. The last snapshot is at t = 0 t = 0 t=0t=0t=0 that represents the final migrated section.
FIG. 4.1-21. Reverse time migration: Start with an all-zero x z x z x-zx-zxz plane at the bottom of the data cube and extrapolate backward in time toward t = 0 t = 0 t=0t=0t=0 to compute snapshots of the x z x z x-zx-zxz plane at different times. These snspshots of the subsurface are indicated by the horizontal planes; the direction of extrapolation - reverse in time, is indicated by the thick arrow. At each time level, include the boundary value ( τ τ tau\tauτ slice at z = 0 z = 0 z=0z=0z=0, indicated by the dotted lines) into the x z x z x-zx-zxz plane from the seismic section. The migrated section is the x z x z x-zx-zxz plane at t = 0 t = 0 t=0t=0t=0 (the top horizontal plane).

Frequency-Space Implicit Schemes

As discussed in Section 4.3, in practice the 15-degree finite-difference migration can handle dips up to 35 degrees with sufficient accuracy. A steep-dip approximation to equation (4-13b) is achiered by continued fractions expansion (Section D.4) as
k z = 2 ω v [ 1 v 2 k x 2 8 ω 2 1 1 v 2 k x 2 16 ω 2 ] k z = 2 ω v 1 v 2 k x 2 8 ω 2 1 1 v 2 k x 2 16 ω 2 k_(z)=(2omega)/(v)[1-(v^(2)k_(x)^(2))/(8omega^(2))(1)/(1-(v^(2)k_(x)^(2))/(16omega^(2)))]k_{z}=\frac{2 \omega}{v}\left[1-\frac{v^{2} k_{x}^{2}}{8 \omega^{2}} \frac{1}{1-\frac{v^{2} k_{x}^{2}}{16 \omega^{2}}}\right]kz=2ωv[1v2kx28ω211v2kx216ω2]
This dispersion equation is known as the 45-degree approximation and is the besis of the most common implementation of steep-dip implicit finite-difference schemes (Kjartansson, 1979).
Refer to the steps described earlier and replace the Taylor expansion given by equation (4-14a) with the continted fractions expansion given by equation (4-18). Follow the subsequent steps to derive the corresponding differential equation associated with the 45-degree diffaction term (Section D.4):
i v 4 ω 3 Q z x 2 2 Q x 2 + ı 4 ω v Q z = 0 i v 4 ω 3 Q z x 2 2 Q x 2 + ı 4 ω v Q z = 0 i(v)/(4omega)(del^(3)Q)/(del z delx^(2))-(del^(2)Q)/(delx^(2))+ı(4omega)/(v)(del Q)/(del z)=0i \frac{v}{4 \omega} \frac{\partial^{3} Q}{\partial z \partial x^{2}}-\frac{\partial^{2} Q}{\partial x^{2}}+\imath \frac{4 \omega}{v} \frac{\partial Q}{\partial z}=0iv4ω3Qzx22Qx2+ı4ωvQz=0
FIG. 4.1-22. An algorithmic description of reverse time migration.
where Q ( x , z , ω ) Q ( x , z , ω ) Q(x,z,omega)Q(x, z, \omega)Q(x,z,ω) is the retarded wavefield in the frequency-space domain.
When recast for time migration, equation (4-19a) becomes (Section D.4):
i 1 2 ω 3 Q τ x 2 2 Q x 2 + i 8 ω ν 2 Q τ = 0 i 1 2 ω 3 Q τ x 2 2 Q x 2 + i 8 ω ν 2 Q τ = 0 i(1)/(2omega)(del^(3)Q)/(del tau delx^(2))-(del^(2)Q)/(delx^(2))+i(8omega)/(nu^(2))(del Q)/(del tau)=0i \frac{1}{2 \omega} \frac{\partial^{3} Q}{\partial \tau \partial x^{2}}-\frac{\partial^{2} Q}{\partial x^{2}}+i \frac{8 \omega}{\nu^{2}} \frac{\partial Q}{\partial \tau}=0i12ω3Qτx22Qx2+i8ων2Qτ=0
where τ τ tau\tauτ is the time variable associated with the migrated data.
Note that dropping the first term in equation (419a) and inverse Fourier transforming in time yields the 15-degree diffraction equation (4-16a). Similarly, dropping the first term in equation (4-19b) yileds the 15degree equation (4-17) for time migration.
As for the 15-degree equation, the thin-lens equation (4-16b) also applies for the 45-degree equation. When implemented in the frequency-space domain, the thin-lens term is represented by the phase-shift operator of equation (4-15a). Again, the final step in the procedure is to write down the difference forms of the differential operators in implicit form to be used in finite-difference solution of the 45-degree equation (419) for migration. Kjartansson (1979) provides an implicit scheme in which the extrapolation is in z z zzz. Nevertheless, as for the 15 -degree equation (4-17), it is trivial to adapt his scheme for time migration with the extrap-
FIG. 4.1-23. An algorithmic description of frequency-space migration
olation in τ τ tau\tauτ of equation (4-15b). The phaseshift operator of equation (4-15a) is velocity-dependent when implemented for depth migration, and it is velocityindependent when implemented for time migration.
The 45-degree approximation given by equation (419b) actually is fairly accurate in practice up to 60 degrees. As described in Section D.4, the basic 45-degree equation (4-19b) also can be adapted to obtain extrapolation schemes for imaging steeper dips up to 90 degrees. Nevertheless, a penalty is paid for steep-dip accuracy in terms of dispersive noise incurred by implicit schemes (Section 4.3).
Steep-dip finite-difference algorithms may be more conveniently implemented in the frequency-space domain than in the time-space domain. A general framework for implementing such algorithms involve a loop over the depth step z z zzz, and a loop over the frequency ω ω omega\omegaω (Figure 4.1-23). For each depth step:
(a) Apply the shift term (equation 4-15a).
(b) Apply the diffraction term (equation 4-19) by performing implicit extrapolation of each of the frequency components of the warefield.
(c) Sum over the frequencies to invoke the imaging principle which is equivalent to setting t = 0 t = 0 t=0t=0t=0.
(d) Repeat the computation for all the depth steps to complete the imaging.

Frequency-Space Explicit Schemes

Start with the paraxial dispersion relation given by equation (4-13b) adapted to the exploding reflectors model. Operate on the pressure wavefield P P PPP and inverse Fourier transform in z z zzz to obtain the differential equation
z P ( k x , z , ω ) = i k z P ( k x , z , ω ) z P k x , z , ω = i k z P k x , z , ω (del)/(del z)P(k_(x),z,omega)=-ik_(z)P(k_(x),z,omega)\frac{\partial}{\partial z} P\left(k_{x}, z, \omega\right)=-i k_{z} P\left(k_{x}, z, \omega\right)zP(kx,z,ω)=ikzP(kx,z,ω)
whose solution can be used to extrapolate the wavefield at the surface down in depth
P ( k z , z , ω ) = P ( k x , 0 , ω ) exp ( i k z z ) . P k z , z , ω = P k x , 0 , ω exp i k z z . P(k_(z),z,omega)=P(k_(x),0,omega)exp(-ik_(z)z).P\left(k_{z}, z, \omega\right)=P\left(k_{x}, 0, \omega\right) \exp \left(-i k_{z} z\right) .P(kz,z,ω)=P(kx,0,ω)exp(ikzz).
For a discrete depth step Δ z Δ z Delta z\Delta zΔz, equation (4-21) takes the form
P ( z + Δ z ) = P ( z ) exp ( i k z Δ z ) P ( z + Δ z ) = P ( z ) exp i k z Δ z P(z+Delta z)=P(z)exp(-ik_(z)Delta z)P(z+\Delta z)=P(z) \exp \left(-i k_{z} \Delta z\right)P(z+Δz)=P(z)exp(ikzΔz)
where, for convenience, the variables k x k x k_(x)k_{x}kx and ω ω omega\omegaω have been omitted from P P PPP.
When designing extrapolation operators, whatever the differencing scheme, the objective must be to ensure that the phose and amplitude of the actual operator closely resembles those of the desired operator exp ( i k z Δ z ) exp i k z Δ z exp(-ik_(z)Delta z)\exp \left(-i k_{z} \Delta z\right)exp(ikzΔz).
Discretize the one-way wave equation (4-20) and apply differencing approximation using an explicit scheme such as
P ( z + Δ z ) = P ( z ) ( 1 i k z Δ z ) P ( z + Δ z ) = P ( z ) 1 i k z Δ z P(z+Delta z)=P(z)(1-ik_(z)Delta z)P(z+\Delta z)=P(z)\left(1-i k_{z} \Delta z\right)P(z+Δz)=P(z)(1ikzΔz)
and an implicit scheme (Section D.6):
P ( z + Δ z ) = P ( z ) [ 1 i k z Δ z / 2 1 + i k z Δ z / 2 ] P ( z + Δ z ) = P ( z ) 1 i k z Δ z / 2 1 + i k z Δ z / 2 P(z+Delta z)=P(z)[(1-ik_(z)Delta z//2)/(1+ik_(z)Delta z//2)]P(z+\Delta z)=P(z)\left[\frac{1-i k_{z} \Delta z / 2}{1+i k_{z} \Delta z / 2}\right]P(z+Δz)=P(z)[1ikzΔz/21+ikzΔz/2]
The explicit extrapolation operator ( 1 k z Δ z ) 1 k z Δ z (1-k_(z)Delta z)\left(1-k_{z} \Delta z\right)(1kzΔz) of equation (4-22b) actually is the first two terms of the Taylor expansion of the exact operator exp ( ı k z Δ z ) exp ı k z Δ z exp(-ık_(z)Delta z)\exp \left(-\imath k_{z} \Delta z\right)exp(ıkzΔz) of equation (4-22a). Table 4-5 provides the amplitude and phase of the exact, explicit and implicit operators used in equations ( 4 22 a , b , c 4 22 a , b , c 4-22 a,b,c4-22 a, b, c422a,b,c ) for wavefield exptrapolation in depth.
A desired property of an extrapolation operator is that it must be stable - its amplitude should be less or equal to unity. The implicit operator defined by equation ( 4 22 c ) ( 4 22 c ) (4-22 c)(4-22 c)(422c) is stable, while the explicit operator defined by equation (4-22b) causes amplitudes of the extrapolated wavefield grow with depth (Section D.6). In fact, the larger the depth step Δ z Δ z Delta z\Delta zΔz, the more unstable are the results of extrapolation. Another desired property of an extrapolation operator is that it should yield the least phase error. The inherently stable nature of implicit schemes has been the compelling reason for their use in practice. Recent developments in the design of stable explicit schemes, however, now have made them widely accepted (Holberg, 1988; Hale, 1991; Soubaras, 1992).
In principle, the exact extrapolation operator in equation (4-22a) can be inverse Fourier transformed to
Table 4-5. Amplitude and phase of the exact, explicit and implicit extrapolation operators used in equations (4-22a,b,c). See Section D. 6 for details.
Operator Amplitude Phase
Exact 1 k z Δ z k z Δ z k_(z)Delta zk_{z} \Delta zkzΔz
exp ( i k z Δ z ) exp i k z Δ z exp(-ik_(z)Delta z)\exp \left(-i k_{z} \Delta z\right)exp(ikzΔz) 1
Explicit tan 1 ( k z Δ z ) tan 1 k z Δ z tan^(-1)(k_(z)Delta z)\tan ^{-1}\left(k_{z} \Delta z\right)tan1(kzΔz)
1 ı k z Δ z 1 ı k z Δ z 1-ık_(z)Delta z1-\imath k_{z} \Delta z1ıkzΔz 1 + ( k z Δ z ) 2 1 + k z Δ z 2 sqrt(1+(k_(z)Delta z)^(2))\sqrt{1+\left(k_{z} \Delta z\right)^{2}}1+(kzΔz)2
Implicit tan 1 [ k z Δ z 1 ( k z Δ z / 2 ) 2 ] tan 1 k z Δ z 1 k z Δ z / 2 2 tan^(-1)[(k_(z)Delta z)/(1-(k_(z)Delta z//2)^(2))]\tan ^{-1}\left[\frac{k_{z} \Delta z}{1-\left(k_{z} \Delta z / 2\right)^{2}}\right]tan1[kzΔz1(kzΔz/2)2]
Operator Amplitude Phase Exact 1 k_(z)Delta z exp(-ik_(z)Delta z) 1 Explicit tan^(-1)(k_(z)Delta z) 1-ık_(z)Delta z sqrt(1+(k_(z)Delta z)^(2)) Implicit tan^(-1)[(k_(z)Delta z)/(1-(k_(z)Delta z//2)^(2))]| Operator | Amplitude | Phase | | :---: | :---: | :---: | | Exact | 1 | $k_{z} \Delta z$ | | $\exp \left(-i k_{z} \Delta z\right)$ | 1 | | | Explicit | | $\tan ^{-1}\left(k_{z} \Delta z\right)$ | | $1-\imath k_{z} \Delta z$ | $\sqrt{1+\left(k_{z} \Delta z\right)^{2}}$ | | | Implicit | | $\tan ^{-1}\left[\frac{k_{z} \Delta z}{1-\left(k_{z} \Delta z / 2\right)^{2}}\right]$ |
frequency-space ( ω x ) ( ω x ) (omega-x)(\omega-x)(ωx) domain and applied to P ( z ) P ( z ) P(z)P(z)P(z) in aл explucit manner. Each output sample of P ( z + Δ z ) P ( z + Δ z ) P(z+Delta z)P(z+\Delta z)P(z+Δz) at some τ τ tau\tauτ location for a frequency ω ω omega\omegaω and velocity v v vvv is computed independently by convolving an explicit filter operator of a specified length centered at the output location x x xxx with the input data array P ( z ) P ( z ) P(z)P(z)P(z) in the x x xxx direction. In contrast, implicit schemes require solving a set of linear equations to obtain the output samples of P ( z + Δ z ) P ( z + Δ z ) P(z+Delta z)P(z+\Delta z)P(z+Δz) - computationally more intensive than convolution. Efficiency is an advantage of the explicit schemes over the implicit schemes.
Another attractive property of stable explicit schemes is their extension to 3-D extrapolation that preserves circular symmetry - a feature that is relatively more difficult to attain with implicit schemes (Section 7.3).
Whether an explicit filter is computed by inverse transforming the exact filter exp ( i k z Δ z ) exp i k z Δ z exp(-ik_(z)Delta z)\exp \left(-i k_{z} \Delta z\right)exp(ikzΔz) of equation (4-22a) to the frequency-space domain or by Taylor expansion as in equation (4-22b), the problem is that neither approach yields a stable filter operator. A stable explicit extrapolation filter in the frequency-space domain can be designed using a constrained least-squares technique (Holberg, 1988), or by a modified Taylor series expansion of the exact extrapolation filter exp ( i k z Δ z ) exp i k z Δ z exp(-ik_(z)Delta z)\exp \left(-i k_{z} \Delta z\right)exp(ikzΔz) (Hale, 1991). Another method of explicit operator design based on on an alternative stability criterion is presented by Soubaras (1992).
By substituting for k z k z k_(z)k_{z}kz from equation (4-13b), the exact extrapolation filter exp ( ı k z Δ z ) exp ı k z Δ z exp(-ık_(z)Delta z)\exp \left(-\imath k_{z} \Delta z\right)exp(ıkzΔz) of equation (422a) is expressed in the frequency-wavenumber domain as
D ( k x ) = exp { i 2 ω v 1 ( v k x 2 ω ) 2 Δ z } D k x = exp i 2 ω v 1 v k x 2 ω 2 Δ z D(k_(x))=exp{-i(2omega)/(v)sqrt(1-((vk_(x))/(2omega))^(2))Delta z}D\left(k_{x}\right)=\exp \left\{-i \frac{2 \omega}{v} \sqrt{1-\left(\frac{v k_{x}}{2 \omega}\right)^{2}} \Delta z\right\}D(kx)=exp{i2ωv1(vkx2ω)2Δz}
The objective is to find, for a specific frequency ω ω omega\omegaω and velocity v v vvv, a symmetric explicit filter with complex coefficients h ( x ) h ( x ) h(x)h(x)h(x) in the frequency-space domain such that, when Fourier transformed to the frequencywavenumber domain, the difference between the actual transform H ( k x ) H k x H(k_(x))H\left(k_{x}\right)H(kx) and the desired transform D ( k x ) D k x D(k_(x))D\left(k_{x}\right)D(kx) of equation (4-23) is minimum, subject to the stability constraint that the amplitude of H ( k z ) H k z H(k_(z))H\left(k_{z}\right)H(kz) is never greater than unity within the propagation region k x ( 2 ω / v ) k x ( 2 ω / v ) k_(x) <= (2omega//v)k_{x} \leq(2 \omega / v)kx(2ω/v). Details of the method of modified Taylor expansion based on this design criterion by Hale (1991) are described in Section D. 5 .
As for the implicit schemes (Figure 4.1-23), a migration algorithm based on an explicit extrapolation filter design involves a loop over the depth step z z zzz and a loop over frequency w w www. For each depth step:
(a) Convolve the explicit extrapolation filter h ( x ) h ( x ) h(x)h(x)h(x) with each of the frequency components of the wavefield.
(b) Sum over the frequencies to invoke the imaging principle which is equivalent to setting t = 0 t = 0 t=0t=0t=0.
(c) Repeat the computation for all the depth steps to complete the imaging.
The length of the filter coefficients h ( x ) h ( x ) h(x)h(x)h(x) determines the dip accuracy of the explicit operator. The larger the number of filter coefficients 2 N + 1 2 N + 1 2N+12 N+12N+1, the steeper the dip accuracy. In practice, extrapolation filter lengths 7, 11 , and 25 are often associated with 30 , 50 30 , 50 30-,5030-, 5030,50, and 70 70 70-70-70 degree dip accuracies. Phase error of the extrapolation operator at steep dips may be reduced by increasing the number of coefficients. Also, lateral velocity variations can be accommodated by varying the velocity at each x x xxx location of the filter coefficient.

Frequency-Wavenumber Migration

Froquency-wavcnumber ( f k ) ( f k ) (f-k)(f-k)(fk) migration is not as easily explained as the Kirchhoff or finite-difference migration from a physical point of view. Chun and Jacewitz (1981) provide practical insight into the principles of f k f k f-kf-kfk migration.
In Section 1.2, we learned that dipping events in the t x t x t-xt-xtx domain map onto the f k f k f-kf-kfk domain along radial lines. The steeper the dip, the closer the radial line is to the wavenumber axis. Figure 4.1-24 shows dipping events before and after migration in the t x t x t-xt-xtx and f k f k f-kf-kfk domains. The Nyquist wavenumber is 20 cycles / k m / k m //km/ \mathrm{km}/km and the bandwidth is given by the corner frequencies 6,12 36 , 48 H z 36 , 48 H z -36,48Hz-36,48 \mathrm{~Hz}36,48 Hz for the passband region of the spectrum. (See Figure 1,1-26 for the definition of corner frequencies.) The red is associated with the flat part of the passband region and the blue is associated with the taper zone. Note that migration rotates the radial lines

FIG. 4.1-25. Migration in the f k f k f-kf-kfk domain. (Migration in the t x t x t-xt-xtx domain is illustrated in Figure 4.1-1.) (a) A dip. ping reflector is represented by a radial line O B O B OBO BOB in the f k f k f-kf-kfk plane. (b) After migration, the radial line O B O B OBO BOB maps onto another radial line O B O B OB^(')O B^{\prime}OB, while B B BBB maps onto B B B^(')B^{\prime}B. The horizontal wavenumber is invariant under migration. For comparison, the f k f k f-kf-kfk response of the dipping event before migration (a) has been superimposed on the f k f k f-kf-kfk response after migration (b). (Adapted from Chun and Jacewitz, 1981.)
in the 2-D amplitude spectrum outward and away from the frequency axis. The steepest event represented by radial line A A AAA maps onto radial line B B BBB after migration. The feather-like energy especially prominent in the left quadrant of the f k f k f-kf-kfk spectrum is associated with the flanks of the diffraction hyperbolas in the t x t x t-xt-xtx domain. The energy associated with the left flanks which are dipping opposite to the dipping reflections maps onto the left quadrant of the f k f k f-kf-kfk plane. And the energy associated with the right flanks of the diffraction hyperbolas that are dipping in the same direction as that of the dipping reflections maps onto the right quadrant of the f k f k f-kf-kfk plane and is superimposed on the energy associated with the dipping reflections themselves.
Migration of a dipping event in the f k f k f-kf-kfk domain is sketched in Figure 4.1-25. Note that this figure is the f f f-f-f k k kkk equivalent of Figure 4.1-1. In both figures, we assume velocity equal to 1 . The vertical axis in Figure 4.1-25 represents the temporal frequency ω ω omega\omegaω for the event in its unmigrated position B B BBB, and the vertical wavenumber k z k z k_(z)k_{z}kz for the event in its migrated position B B B^(')B^{\prime}B.
Migration in the frequency-wavenumber domain inpolves mapping the lines of constant frequency A B A B ABA BAB in the ω k x ω k x omega-k_(x)\omega-k_{x}ωkx plane to circles A B A B AB^(')A B^{\prime}AB in the k z k x k z k x k_(z)-k_(x)k_{z}-k_{x}kzkx plane. Therefore, migration maps point B B BBB vertically onto point B B B^(')B^{\prime}B. Note that in this process, the horizontal wavenumber k x k x k_(x)k_{x}kx does not change as a result of mapping. When this mapping is completed, the dipping event O B O B OBO BOB is mapped along O B O B OB^(')O B^{\prime}OB after migration; thus, the dip angle θ ¯ θ ¯ bar(theta)\bar{\theta}θ¯ after migration is greater than the dip angle θ θ theta\thetaθ before migration. For comparison, these two radial lines are shown on the same plane k z k x k z k x k_(z)-k_(x)k_{z}-k_{x}kzkx
We now examine the diffraction hyperbola and its collapse to the apex after migration in the f k f k f-kf-kfk domain. A diffraction hyperbola is represented by an inverted triangular area in the frequency domain as shown in Figure 4.1-26. The Nyquist wayenumber is 40 cycles / k m / k m //km/ \mathrm{km}/km and the bandwidth is given by the corner frequencies 6 12 36 , 48 H z 12 36 , 48 H z 12-36,48Hz12-36,48 \mathrm{~Hz}1236,48 Hz for the passband region of the spectrum. As for the dipping events model in Figure 4.1-24, the red is associated with the flat part of the passband region and the blue is associated with the taper zone. The two edges in the right and left quadrant of the f k f k f-kf-kfk plane correspond to the asymptotes of the flanks of the diffraction hyperbola, the base of the inverted triangle corresponds to the high-frequency end of the passband and the tip of the triangle in the proximity of the origin of the f k f k f-kf-kfk plane corresponds to the low-frequency end of the passband. Migration turns the triangular area into a circular shape as shown in Figure 4.1-26.
The f k f k f-kf-kfk analysis of the diffraction hyperbola shown in Figure 4.1-20 is based on the representation of the hyperbola as a series of discrete dipping segments. Figure 4.1-27 depicts a diffraction hyperbola in the t x t x t-xt-xtx and f k f k f-kf-kfk domains. We imagine that the hyperbola is made up of a series of dipping segments, such as A , B , C , D A , B , C , D A,B,C,DA, B, C, DA,B,C,D and E E EEE. The zero-dip segment A A AAA is at the apex, while the steepest dip segment E E EEE is along the asymptotes. In the f k f k f-kf-kfk domain, the zero-dip segment A A AAA maps along the frequency axis, while the dipping segments B , C B , C B,CB, CB,C and D D DDD map along the radial lines, increasingly further away from the frequency axis. Finally, the asymptotic tail E E EEE maps along the radial line that represents the boundary between the propagation and the evanescent region. The evanescent region corresponds
F1G. 4.1-27. A hyperbola on the t x t x t-xt-xtx plane maps onto an inverted triangular area on the f k f k f-kf-kfk plane. (See text for details.)
to the energy that is located at or greater than 90 degrees from the vertical. The opposite side of the hyperbola maps onto the second quadrant (negative k x k x k_(x)k_{x}kx ) in the f k f k f-kf-kfk domain. In the continuous case, a diffraction hyperbola is represented by a series of continuous radial lines that constitute an inverted triangular area in the f k f k f-kf-kfk domain (Figure 4.1-26).
A curious fact emerges from the f k f k f-kf-kfk spectrum of the migrated section in Figure 4.1-26. We expect migration to collapse the diffraction hyperbola to a point at the apex. The spectrum of this migrated section really should be more like that in Figure 4.1-28 - a rectangle. Why is there a difference between this spectrum and the spectrum after migration in Figure 4.1-26?
If you start with a point and model it, you get the diffraction hyperbola in Figure 4.1-28. However, in reality we deal with a diffraction hyperbola as shown in Figure 4.1-26. The hyperbolas do not look different in the t x t x t-xt-xtx domain, but note the difference in their f k f k f-kf-kfk spectra. The f k f k f-kf-kfk spectrum of the real-life diffraction, which is always subjected to bandpass filtering (Figure 4.1 26 4.1 26 4.1-264.1-264.126 ), is missing the energy above the 48 H z 48 H z 48-Hz48-\mathrm{Hz}48Hz line that is present in the f k f k f-kf-kfk spectrum of the modeled diffraction curve (Figure 4.1-28). These missing high frequencies cause the difference between the spectra after migration.

Phase-Shift Migration

Theory of the frequency-wavenumber ( f k ) ( f k ) (f-k)(f-k)(fk) migration techniques is left to Section D.7. For now, we briefly review the f k f k f-kf-kfk migration algorithms as follows: (a) Just as any other migration algorithm, start with the two-way scalar wave equation (4-12),
(b) Assume constant velocity and perform 3-D Fourier transform and obtain the dispersion relation between the transform variables (equation 4-13a).
(c) Then, adapt the dispersion relation to the exploding reflectors model by halving the velocity for the upcoming waves (equation 4.13 b 4.13 b 4.13b4.13 \mathrm{~b}4.13 b ).
(d) Operate on the pressure wavefield P P PPP and inverse transform in z z zzz to obtain the differential equation (4-20).
(e) Obtain the solution given by equation (4-21).
The discrete form of this solution given by equation (4-22) is the basis for phase-shift migration in which velocity can be varied at each depth step in the vertical direction.
The phase-shift method involves the following steps:
(a) Start with the stacked section - an approximation to the zero-offset section P ( x , z = 0 , t ) P ( x , z = 0 , t ) P(x,z=0,t)P(x, z=0, t)P(x,z=0,t), and perform 2-D Fourier transform to get P ( k x , z = 0 , ω ) P k x , z = 0 , ω P(k_(x),z=0,omega)P\left(k_{x}, z=0, \omega\right)P(kx,z=0,ω).
(b) By using equation (4-22), for each frequency ω ω omega\omegaω, extrapolate the transformed wavefield P ( k x , z , ω ) P k x , z , ω P(k_(x),z,omega)P\left(k_{x}, z, \omega\right)P(kx,z,ω) at depth z z zzz with a phase-shift operator exp ( i k z Δ z ) exp i k z Δ z exp(-ik_(z)Delta z)\exp \left(-i k_{z} \Delta z\right)exp(ikzΔz) to get the wavefield P ( k x , z + Δ z , ω ) P k x , z + Δ z , ω P(k_(x),z+Delta z,omega)P\left(k_{x}, z+\Delta z, \omega\right)P(kx,z+Δz,ω) at depth z + Δ z z + Δ z z+Delta zz+\Delta zz+Δz. At each z z zzz step, a new extrapolation operator with the velocity defined for that z z zzz value is computed.
(c) As for any other migration, invoke the imaging principle t = 0 t = 0 t=0t=0t=0 at each extrapolation step to obtain the migrated section P ( k x , z , t = 0 ) P k x , z , t = 0 P(k_(x),z,t=0)P\left(k_{x}, z, t=0\right)P(kx,z,t=0) in the
4.1-28. (a) A diffraction hyperbola modeled from an impulse in the t x t x t-xt-xtx domain, (b) the f k f k f-kf-kfk spectrum of (a), (c) migration of (a), (d) the f k f k f-kf-kfk spectrum of (c); (e) bandpass-filtered version of (a), (f) the f k f k f-kf-kfk spectrum of (e), (g) migration of (e), and (h) the f k f k f-kf-kfk spectrum of ( g ) ( g ) (g)(\mathrm{g})(g).
transform domain. The imaging condition t = 0 t = 0 t=0t=0t=0 is met by summing over all frequency components of the extrapolated wavefield at each depth step. This is easily shown from the integral representing the inverse Fourier transform of the extrapolated wavefield (equation D-84).
(d) Repeat steps (b) and (c) for downward continuation and imaging, respectively, for all depth steps to get the migrated section in the transform domain P ( k x , z , t = 0 ) P k x , z , t = 0 P(k_(x),z,t=0)P\left(k_{x}, z, t=0\right)P(kx,z,t=0).
(e) Final stcp involves inverse transforming in the x x xxx direction to get the migrated section P ( x , z , t = 0 ) P ( x , z , t = 0 ) P(x,z,t=0)P(x, z, t=0)P(x,z,t=0).
Figure 4.1-29 shows a flowchart of the phase-shift mithod.
The phase-shift method (Gazdag, 1978) can only handle vertically varying velocities. A way to accommo date lateral velocity variations judged to be acceptable for time migration is to first stretch the CMP-stacked section in the time direction so as to nake it correspond to a velocity field v ¯ ( z ) v ¯ ( z ) bar(v)(z)\bar{v}(z)v¯(z) that only varies verticelly. This velocity field is obtained by averaging the original velocity field associated with the unstretched CMP-stacked section in the x x xxx direction. Following the stretching operation, the stacked section is migrated using the velocity function v ¯ ( z ) v ¯ ( z ) bar(v)(z)\bar{v}(z)v¯(z) in the standard phase-shift migration schenc. Finally, the migrated section is unstretched.
Gazdag and Squazzero (1984) extended the phaseshift method to handle lateral velocity variations. To achieve this, first the input wavefield is extrapolated by the phase-shift method using a multiple number of laterally constant velocity functions and a series of reference wavefields are created. The imaged wavefield then is computed by interpolation from the reference wavefields. This migration method is known as phase-shiftplus-interpolation. An alternative extension of phaseshift migration to handle lateral velocity variations is presented by Kosloff and Kessler (1987).

Stolt Migration

If the medium velocity is constant, migration can be expressed as a direct mapping (Stolt, 1978) from temporal frequency ω ω omega\omegaω to vertical wavenumber k z k z k_(z)k_{z}kz (Figure 4.1-25). Figure 4.1-30 is a flowchart of the Stolt algorithm; the mathematical details are left to Section D.7. The equation for Stolt mapping is
P ( k x , k z , t = 0 ) = [ v 2 k z k x 2 + k z 2 ] P [ k x , 0 , ω = v 2 k y 2 + k z 2 ] , P k x , k z , t = 0 = v 2 k z k x 2 + k z 2 P k x , 0 , ω = v 2 k y 2 + k z 2 , {:[P(k_(x),k_(z),t=0)=[(v)/(2)(k_(z))/(sqrt(k_(x)^(2)+k_(z)^(2)))]],[P[k_(x),0,omega=(v)/(2)sqrt(k_(y)^(2)+k_(z)^(2))]","]:}\begin{aligned} P\left(k_{x}, k_{z}, t=0\right)= & {\left[\frac{v}{2} \frac{k_{z}}{\sqrt{k_{x}^{2}+k_{z}^{2}}}\right] } \\ & P\left[k_{x}, 0, \omega=\frac{v}{2} \sqrt{k_{y}^{2}+k_{z}^{2}}\right], \end{aligned}P(kx,kz,t=0)=[v2kzkx2+kz2]P[kx,0,ω=v2ky2+kz2],
FIG. 4.1-29. Flowchart for Gazdag's phase-shift method of migration.
P ( x , z = 0 , t ) 2 D F F T + 1 P ( k x , z = 0 , ω ) Map ω to k z Apply the scaling factor P ( k x , k z , t = 0 ) 2-D FFT P ( x , z , t = 0 ) P ( x , z = 0 , t ) 2 D F F T + 1 P k x , z = 0 , ω  Map  ω  to  k z  Apply the scaling factor  P k x , k z , t = 0  2-D FFT  P ( x , z , t = 0 ) {:[P(x","z=0","t)],[darr],[2-DFFT^(+1)],[P(k_(x),z=0,omega)],[darr],[" Map "omega" to "k_(z)],[darr],[" Apply the scaling factor "],[darr],[P(k_(x),k_(z),t=0)],[darr],[" 2-D FFT "],[P(x","z","t=0)]:}\begin{gathered} P(x, z=0, t) \\ \downarrow \\ 2-\mathrm{D} \mathrm{FFT}^{+1} \\ P\left(k_{x}, z=0, \omega\right) \\ \downarrow \\ \text { Map } \omega \text { to } k_{z} \\ \downarrow \\ \text { Apply the scaling factor } \\ \downarrow \\ P\left(k_{x}, k_{z}, t=0\right) \\ \downarrow \\ \text { 2-D FFT } \\ P(x, z, t=0) \end{gathered}P(x,z=0,t)2DFFT+1P(kx,z=0,ω) Map ω to kz Apply the scaling factor P(kx,kz,t=0) 2-D FFT P(x,z,t=0)
FIG. 4.1-30. Flowchart for Stolt's constant-velocity migration method in the f k f k f-kf-kfk domain.
where P ( k x , z = 0 , ω ) P k x , z = 0 , ω P(k_(x),z=0,omega)P\left(k_{x}, z=0, \omega\right)P(kx,z=0,ω) is the zero-offset section and P ( k z , k z , t = 0 ) P k z , k z , t = 0 P(k_(z),k_(z),t=0)P\left(k_{z}, k_{z}, t=0\right)P(kz,kz,t=0) is the migrated section in the frequencywavenumber domain.
Note that Stolt migration involves, first, mapping from ω ω omega\omegaω to k z k z k_(z)k_{z}kz for a specific k x k x k_(x)k_{x}kx by using the dispersion relation of equation (4-13a) recast as
ω = v 2 k x 2 + k z 2 ω = v 2 k x 2 + k z 2 omega=(v)/(2)sqrt(k_(x)^(2)+k_(z)^(2))\omega=\frac{v}{2} \sqrt{k_{x}^{2}+k_{z}^{2}}ω=v2kx2+kz2
The output of mapping is then scaled by the quantity S S SSS
S = v 2 k z k z 2 + k z 2 S = v 2 k z k z 2 + k z 2 S=(v)/(2)(k_(z))/(sqrt(k_(z)^(2)+k_(z)^(2)))S=\frac{v}{2} \frac{k_{z}}{\sqrt{k_{z}^{2}+k_{z}^{2}}}S=v2kzkz2+kz2
Stolt's algorithm for constant velocity thus involves the following steps:
(a) Start with the input wavefield P ( x , z = 0 , t ) P ( x , z = 0 , t ) P(x,z=0,t)P(x, z=0, t)P(x,z=0,t) approximated by the CMP stack, and apply 2-D Fourier transform to get P ( k x , z = 0 , ω ) P k x , z = 0 , ω P(k_(x),z=0,omega)P\left(k_{x}, z=0, \omega\right)P(kx,z=0,ω).
(b) Map the wavefield from w w www to k 2 k 2 k_(2)k_{2}k2 using the dispersion relation given by equation (4-24b).
(c) Apply the scaling factor S S SSS of equation (4-24c) as part of the mapping procedure (Section D.7).
(d) Invoke the imaging principle by setting t = 0 t = 0 t=0t=0t=0 and obtain P ( k s , k z , t = 0 ) P k s , k z , t = 0 P(k_(s),k_(z),t=0)P\left(k_{s}, k_{z}, t=0\right)P(ks,kz,t=0).
(e) Finally, apply 2-D inverse transform to get the migrated section P ( x , z , t = 0 ) P ( x , z , t = 0 ) P(x,z,t=0)P(x, z, t=0)P(x,z,t=0).
It may be questionable as to whether the constantvelocity Stolt method has value on its own as a practical migration algorithu. Nevertheless, Stolt's method can be used efficiently to perform a constant-velocity migration as the first step in a residual migration scheme (Section 4.5). Additionally, the method constitutes an essential procedural step for migration velocity analysis as described in Section 5.4.
Stolt extended his method to handle velocity veriations (Section D.7). For the variable-velocity case, Stolt's extension consists of
(a) modifying the input wavefield to make it appear as if it were the response of a constant-velocity earth,
(b) applying the constant-velocity algorithm outlined in Figure 4.1-30, and
(c) reversing the original modification of the input wavefield.
This modification essentially is a type of stretching of the time axis (Section D. I) to make the reflection times approximately equivalent to those recorded for a constant-velocity earth. The nature of stretching is described by the stretch factor W W WWW. The const ant-velocity case is equivalent to W = 1 W = 1 W=1W=1W=1.
Note that the phase-shift and Stolt migration outputs normally are displayed in two-way vertical zerooffset time τ = 2 z / v τ = 2 z / v tau=2z//v\tau=2 z / vτ=2z/v, as are the outputs from the finite-difference and Kirch of migrations. In practice, mapping in the f k f k f-kf-kfk domain really is from ω k x ω k x omega-k_(x)\omega-k_{x}ωkx to ω r k x ω r k x omega_(r)-k_(x)\omega_{r}-k_{x}ωrkx rather than to k z k x k z k x k_(z)-k_(x)k_{z}-k_{x}kzkx, where ω r ω r omega_(r)\omega_{r}ωr is the Fourier dual of τ τ tau\tauτ and is simply k z k z k_(z)k_{z}kz of equation (4-13b) scaled by v / 2 v / 2 v//2v / 2v/2 (Section D.3):
ω τ = ω 1 ( v k x 2 ω ) 2 ω τ = ω 1 v k x 2 ω 2 omega_(tau)=omegasqrt(1-((vk_(x))/(2omega))^(2))\omega_{\tau}=\omega \sqrt{1-\left(\frac{v k_{x}}{2 \omega}\right)^{2}}ωτ=ω1(vkx2ω)2
One important concept must be pointed out from equation (4-25). Note that for a constant k x , ω r < ω k x , ω r < ω k_(x),omega_(r) < omegak_{x}, \omega_{r}<\omegakx,ωr<ω; thus, magation shifts the bandudth to lower frequencues. This is analogous to the conclusion derived in relation to the NMO correction, since the latter also causes data stretching to Iower frequencies (Section 3.1). The implication from equation (4-25) is demonstrated by the dipping events model in Figure 4.1-24. While the bandwidth of the zero-dip event is retained after migration, the bandwidth of the event, with steepest dip has shifted from approximately 40 H z 40 H z 40Hz40 \mathrm{~Hz}40 Hz to 36 H z 36 H z 36Hz36 \mathrm{~Hz}36 Hz at the high-frequency end of the spectrum. In fact, the shift in bandwidth is dip-dependent; events with different dips which have the same bandwidth before migration will have different bandwidths after migration.

Summary of Domains of Migration Algorithms

Migration algorithms described in this section are based on the assumption that the input stacked section represents a zero-offset acoustic waveficld. As such, these algorithms are all based on the scalar wave equation (4-12). Table 4-6 provides a list of the migration algorithms described in this section with the associated design and application domains. While there exist several other migration algorithms, those listed in Table 4-6 are the most widely used in practice.
Also included in Table 4-6 are the types of velocity fields and dips each migration algorithm can accommodate. It is clear that each algorithm is limited by either the type of velocity variations or dip ranges. Therefore, each has an appropriate usage in practice depending on field data and velocity characteristics (Section 4.0). Note that the lateral velocity variations implied by the velocity fields in Table 4-6 are mild to moderate and are within the bounds of time migration. Additionally, the choice of migration algorithm depends on whether your objective is imaging or migration velocity analysis. While imaging is the subject of this chapter, migration velocity analysis is discussed in Chapter 5.
Table 4-6. Domains of migration algorithms.
Algurithm Domain
Dips and
Velocities
Dips and Velocities| Dips and | | :--- | | Velocities |
Kirchhoff
Summation
Kirchhoff Summation| Kirchhoff | | :--- | | Summation |
t x t x t-xt-xtx
time-space
t-x time-space| $t-x$ | | :---: | | time-space |
up to 90 deg
rms v ( x , τ ) v ( x , τ ) v(x,tau)v(x, \tau)v(x,τ)
up to 90 deg rms v(x,tau)| up to 90 deg | | :--- | | rms $v(x, \tau)$ |
Finite-Difference
15-deg Implicit
Finite-Difference 15-deg Implicit| Finite-Difference | | :--- | | 15-deg Implicit |
t x t x t-xt-xtx
time-space
t-x time-space| $t-x$ | | :---: | | time-space |
up to 35 deg
int v ( x , r ) v ( x , r ) v(x,r)v(x, r)v(x,r)
up to 35 deg int v(x,r)| up to 35 deg | | :--- | | int $v(x, r)$ |
Finite-Difference
45 -deg Implicit
Finite-Difference 45 -deg Implicit| Finite-Difference | | :--- | | 45 -deg Implicit |
ω x ω x omega-x\omega-xωx
frequency-space
omega-x frequency-space| $\omega-x$ | | :---: | | frequency-space |
up to 65 deg
int v ( x , τ ) v ( x , τ ) v(x,tau)v(x, \tau)v(x,τ)
up to 65 deg int v(x,tau)| up to 65 deg | | :--- | | int $v(x, \tau)$ |
Finite-Difference
70-deg Explicit
Finite-Difference 70-deg Explicit| Finite-Difference | | :--- | | 70-deg Explicit |
ω x ω x omega-x\omega-xωx
frequency-space
omega-x frequency-space| $\omega-x$ | | :--- | | frequency-space |
up to 80 deg
int v ( x , τ ) v ( x , τ ) v(x,tau)v(x, \tau)v(x,τ)
up to 80 deg int v(x,tau)| up to 80 deg | | :--- | | int $v(x, \tau)$ |
Phase-Shift
ω k x ω k x omega-k_(x)\omega-k_{x}ωkx
freq-wavenumber
omega-k_(x) freq-wavenumber| $\omega-k_{x}$ | | :---: | | freq-wavenumber |
up to 90 deg
int v ( τ ) v ( τ ) v(tau)v(\tau)v(τ)
up to 90 deg int v(tau)| up to 90 deg | | :--- | | int $v(\tau)$ |
Stolt Method
with Stretch
Stolt Method with Stretch| Stolt Method | | :--- | | with Stretch |
ω k x ω k x omega-k_(x)\omega-k_{x}ωkx
freq-wavenumber
omega-k_(x) freq-wavenumber| $\omega-k_{x}$ | | :---: | | freq-wavenumber |
up to 90 deg
rms v ( x , τ ) v ( x , τ ) v(x,tau)v(x, \tau)v(x,τ)
up to 90 deg rms v(x,tau)| up to 90 deg | | :--- | | rms $v(x, \tau)$ |
Algurithm Domain "Dips and Velocities" "Kirchhoff Summation" "t-x time-space" "up to 90 deg rms v(x,tau)" "Finite-Difference 15-deg Implicit" "t-x time-space" "up to 35 deg int v(x,r)" "Finite-Difference 45 -deg Implicit" "omega-x frequency-space" "up to 65 deg int v(x,tau)" "Finite-Difference 70-deg Explicit" "omega-x frequency-space" "up to 80 deg int v(x,tau)" Phase-Shift "omega-k_(x) freq-wavenumber" "up to 90 deg int v(tau)" "Stolt Method with Stretch" "omega-k_(x) freq-wavenumber" "up to 90 deg rms v(x,tau)"| Algurithm | Domain | Dips and <br> Velocities | | :---: | :---: | :---: | | Kirchhoff <br> Summation | $t-x$ <br> time-space | up to 90 deg <br> rms $v(x, \tau)$ | | Finite-Difference <br> 15-deg Implicit | $t-x$ <br> time-space | up to 35 deg <br> int $v(x, r)$ | | Finite-Difference <br> 45 -deg Implicit | $\omega-x$ <br> frequency-space | up to 65 deg <br> int $v(x, \tau)$ | | Finite-Difference <br> 70-deg Explicit | $\omega-x$ <br> frequency-space | up to 80 deg <br> int $v(x, \tau)$ | | Phase-Shift | $\omega-k_{x}$ <br> freq-wavenumber | up to 90 deg <br> int $v(\tau)$ | | Stolt Method <br> with Stretch | $\omega-k_{x}$ <br> freq-wavenumber | up to 90 deg <br> rms $v(x, \tau)$ |

4.2 KIRCHHOFF MIGRATION IN PRACTICE

In this and the following three sections, the parameters that affect performance of Kirchhoff summation, finitedifference, and f k f k f-kf-kfk migration methods are discussed. In Kirchhoff migration, the important parameters are the aperture width used in summation and the meximum dip to migrate. In finite-difference and phase-shift migrations, the depth step size needs to be selected properly. The stretch factor is important in Stolt migration. The responses of these methods to velocity errors also are examined. All practical aspects are discussed using synthetic models of two zero-offset sections -- a model of dipping-events and a model of a diffraction hyperbola. Real data examples also are used to evaluate the choice of optimum parameters.
In Sections 4.2, 4.3, 4.4, and 4.5, migration results of different algorithms using various parameters are compared with a desired migration. In all cases, this desired migration was obtained using the phaseshift method with appropriate parameters and velocities. This does not imply that the phase-shift method always provides a desirable output; it only means that the data examples in this section were chosen so that the phase-shift algorithm is appropriate. The choice of the phase-shift method was a compromise; it handles dips of up to 90 degrees and velocities that can only vary vertically.
Before a migration algorithm is used on field dato, its impulse response must be tester. A band-limited impulse response is generated by using an input that contains an isolated wavelet on one trace only To also limit the spatial bandwidth, this trace is replicated on either side with the wavelet amplitude halved. The ideal migration algorithm should produce an impulse response that has the shape of a semicircle. Kirchhoff migration produces the section shown in Figure 4.2-1d. The impulse response indicates that Kirchhoff migration can accurately handle dips up to 90 degrees. The dip on a migration impulse response is measured as the angle θ θ theta\thetaθ between the vertical and a specified radial direction. Note that migration can be limited to smaller dips (Figure 4.2-1).

Aperture Width

From the previous section, we know that Kirchhoff migration involves a summation of amplitudes along diffraction hyperbolas. Given the rms velocity at a particular time sample of a particular input trace, a hyperbolic traveltime trajectory associated with a fictitious diffractor is overlaid on the input section with its apex at that time sample. In theory, a diffraction hyperbola extends to infinite time and distance. In practice, we have to deal with a truncated hyperbolic summation path. The spatial extent that the actual summation path spans, called the migration aperture, is measured in terms of the number of traces the hyperbolic path spans.
FIG. 4.2-1. Migration can be confined to a range of dipe present on a seismic section. The impulse response for the dip-limited migration operator is a truncated semicircle. Dip angle θ θ theta\thetaθ is measured from the vertical axis.
(a)
(b)
(c)
FIG. 4.2-2. Summation paths for Kirchhoff migration in a medium with (a) low velocity (2000 m/s), (b) high velocity ( 4000 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s ), and (c) vertically varying velocity. Migration aperture is small for low velocities and large for high velocities.
The curvature of the diffraction hyperbola is governed by the velocity function. Figure 4.2 2 a 4.2 2 a 4.2-2a4.2-2 \mathrm{a}4.22a shows a number of low-velocity diffraction hyperbolas, while Figure 4.2-2b shows a number of high-velocity hyperbolas. A low-velocity hyperbola has a narrower aperture when compared to a high-velocity hyperbola. This agrees with our intuition - high velocity means more migration. In practice, we deal with a velocity function that at least varies with depth. The diffraction hyperbolas can have different curvatures depending on the velocity value at a given time sample (Figure 4.2-2c). Because of the vertical variation in velocity, aperture width generally is time variant. For the usual case in which velocity increases with depth, migration of the shallow part of the section requires a narrow aperture, while migration of the deep portion requires a wider aperture (Figure 4.2-2c). This implies that, given the same dip, deep events migrate farther than shallow events.
Figure 4.2-3 shows a zero-offset diffraction hyperbola ( 8 m s / 8 m s / 8ms//8 \mathrm{~ms} /8 ms/ trace dip along the asymptotes) and migrations using four different aperture widths. The smaller the aperture, the less capable the migration is in collapsing the diffraction hyperbola. In this case, use of an aperture width that is equal to the width of the input section (half aperture, 256 traces) yields the best result.
Figure 4.2-4 shows a synthetic zero-offset section that consists of a number of dipping events ranging from 0 to 45 degrees in increments of 5 degrees. Aperture width is related closely to the horizontal displacement d x d x d_(x)d_{x}dx that takes place in migration as defined by equation (4-1). The number of traces an event migrates is n z = d x / Δ x n z = d x / Δ x n_(z)=d_(x)//Delta xn_{z}=d_{x} / \Delta xnz=dx/Δx, where Δ x Δ x Delta x\Delta xΔx is the CMP interval. Therefore, the aperture width that is required is 2 n x + 1 2 n x + 1 2n_(x)+12 n_{x}+12nx+1. Figure 4.2 4 also shows Kirchhoff migrations of the dipping events using four different aperture widths. Small-aperture migration eliminates steeply dipping events on the output section. Increasing the aperture width allows proper migration of the steeply dipping events. From this we see that using too small an aperture width causes a dip filtering action during migration, because a small aperture excludes the steeper flanks of the diffraction hyperbola from the summation.
For any given event position in time t t ttt before migration, the optimal value for the aperture width is defined by twice the maximum horizontal displacement in migration for the steepest dip of interest in the input section. In this case, the horizontal displacement associated with the 45-degree dipping event is computed by substituting the values for v = 3500 m / s , Δ x = 25 m v = 3500 m / s , Δ x = 25 m v=3500m//s,Delta x=25mv=3500 \mathrm{~m} / \mathrm{s}, \Delta x=25 \mathrm{~m}v=3500 m/s,Δx=25 m, Δ t / Δ x = 12 m s / Δ t / Δ x = 12 m s / Delta t//Delta x=12ms//\Delta t / \Delta x=12 \mathrm{~ms} /Δt/Δx=12 ms/ trace, where t = 2 s t = 2 s t=2st=2 \mathrm{~s}t=2 s in equation (4-1). The value for the borizontal displacement is 118 traces, giving an aperture width of 237 traces. Typically, we consider somewhat larger values to allow for velocity errors.
A good way to determine aperture width is to generate diffraction hyperbolas as shown in Figure 4.2-2c using the regionally averaged, vertically varying velocity. Clearly, the larger the aperture width, the more traces are used in the summation. For the dipping events in Figure 4.2-4, the optimal value of the halfaperture width is 150 traces; increasing the width to 300 traces resulted in no further improvement.
FIG. 4.2-3. Tests for aperture width in Kirchhof migration: (a) a zero-ofiset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration using the phase-shift method; Kurchhof migration using (c) 35-trace, (d) 70-trace, (e) 150-trace, and (f) 256-trace half-aperture width.
FIG. 4.2-4. Tests for aperture width in Kirchhoff migration: (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration using the phase-shift method; Kirchhoff migration using (c) 35-trace, (d) 70-trace, (e) 150-trace, and (f) 256-trace half-aperture width.
FIG. 4.2-5. Tests for aperture width in Kirchhoff migration: Insufficient aperture width causes removal of steeply dipping events.
FIG. 4.2-6. Tests for aperture width in Kirchhoff migration: Insufficient aperture width causes spurious horizontal events in deep, noisy part of a stacked section.
(a)
(b)
120 traces
(d)
FIG. 4.2-7. Tests for aperture width in Kirchhoff migration: Input to migration is a section (a) that contains band-limited random noise uncorrelated from trace to trace. Note the spurious horizontal events in the deeper part of the section after migration using small aperture ( 60 traces); these gradually disappear at increasingly larger apertures.
A test of aperture width on the CMP stacked data example is shown in Figure 4.2-5. The small-aperture migration causes smearing in the deeper part of the section. This smearing effect destroys the dipping events and produces spurious horizontally dominant events. Smearing is reduced gradually with increasing aperture.
Figure 4.2-6 is the deeper portion of a stacked section with migrations using different aperture sizes. The smesring effert is much more noticeahle at small sperture. The main difference between the stacked sections in Figures 4.2-5 and 4.2-6 is that the latter, being deeper in time, contains a large amount of noise. This smearing phenomenon was not noticed in the noise-free synthetic model in Figure 4.2-4. We now soe that choice of aperture width is more critical than we originally thought. In particular, a small aperture changes the noise characteristics of the section.
Why do we see horizontally dominant smearing with small-aperture migration? To answer this, we must do a simple experiment with a section that contains only random noise and the velocity function used in migration incresses in time (Figure 4.2-7a). We see two interesting phenomena on the migrated sections using three different apertures. First, in all thres cases there is more smearing of noise in the deeper par of the data, where the velocities generally are higher than in the shallower part. Second, there is relatively more smearing in the small-aperture migration compared with others at a given time in the section. Moreover, this smearing is characterized by horizontally dominant spurious events, especially in the deeper part of the section. Note that even with a large aperture, some smearing still is present in the deepest part of the section in Figure 4.2-7d. As indicated in Figure 4.2-2b, because summation stops at the bottom of the section, the effective aperture ( C D ) ( C D ) (CD)(C D)(CD) at late times is much smaller than that used in other parts of the section ( A B ) ( A B ) (AB)(A B)(AB). Remember that summation using very small aperture includes only the apex portion of the diffraction hyperbola, where dips are nesuly flat. Therefore, the small aperture with a dip filtering
action passes flat or nearly flat events those horizontal wavenumber components that are zero or nearly zero.
In conclusion, the following assessinents are made concerning the choice of aperture width.
(a) Excessively small aperture width causes destruction of steeply dipping events and rapidly varying amplitude changes.
(b) Excessively small aperture width organizes random noise, especially in the deeper part of the section, as horizontally dominant spurious events.
(c) Excessively large aperture means more computer time. More importantly, large apertures can dograde the migration quelity in poor signal-to-noise ratio conditions. Use of large aperture will cause random noise at late times to creep into the good shallow data. Aperture width always is a compromise with noise.
(d) Sometimes it is better to use a smaller aperture than would theoretically be required to avoid the adverse effect of noise on the migrated event. Noise considerations may even require a timo-dependent aperture width.
(e) It is recommended that the aperture width be kcpt constant in migrating all lines from a particular survey so that an overall uniformity in amplitude characteristics on the migrated sections is maintained.
In practice, a regional velocity function and the steepest dip in a survey area are used to compute the optimal aperture width that can be used over the entire set of data from the area (equation 4-1).

Maximum Dip to Migrate

During migration, we can specify the maximum dip we want migrated in the section. This may be useful when we need to suppress the steeply dipping coherent noise. Figure 4.2-8 shows migrations of the dipping events with four different maximum allowable dips. For a. 4 m s / t r a c e d i p 4 m s / t r a c e d i p 4ms//tracedip4 \mathrm{~ms} / \mathrm{trace} \mathrm{dip}4 ms/tracedip limit, events with dips greater than this value are suppressed. Similarly, for an 8 m s / 8 m s / 8ms//8 \mathrm{~ms} /8 ms/ trace dip value, events with dips greater than this value are suppressed. When the dip value is 12 m s / 12 m s / 12ms//12 \mathrm{~ms} /12 ms/ trace, no suppression occurs, since all events in the input section have dips less than this value. Limiting the dip parameter is a way to reduce computational cost, since it is related to aperture width (equation 4-1), which determines the cost.
From Figure 4.2-1, note that the Kirchhoff migration impulse response can be limited to various max- imum dips. The smaller the maximum allowable dip, the smaller the aperture. This combination of maximum aperture width and maximum dip limit determines the actual effective aperture width used in migration. In particular, diffraction hyperbolas along which summation is done are truncated bcyond the spccified maximum dip limit.
A field data example of testing the maximum dip parameter is shown in Figure 4,2-9. Some steep dips are lost on the section that corresponds to the 2 m s / 2 m s / 2ms//2 \mathrm{~ms} /2 ms/ trace maximum allowable dip. The 8 m s / 8 m s / 8ms//8 \mathrm{~ms} /8 ms/ trace dip appears to be optimum. The maximum dip parameter must be chosen carefully so that the steep dips of interest in the input section are preserved. Finally, dip value can be changed spatially and in time; however, practical implementation can be cumbersome.

Velocity Errors

We now examine the response of Kirchhoff migration to velocity errors. Figure 4.2-10 shows the diffraction hyperbola and migrations using the 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s medium velocity, and 5, 10, and 20 percent lower velocities. With increasingly lower velocities, the diffraction hyperbola is collapsed less and less taking the shape of a frown it is undermigrated.
Figure 4.2-11 shows the same diffraction hyperbola and migrations using the 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s medium velocity, and 5,10 , and 20 percent higher velocities. With increasingly higher velocities, the the diffraction hyperbola is inverted more and more taking the shape of a smile it is overmigrated.
The under-and overmigration effects resulting from the use of erroneously low or high velocities on the dipping events model are seen in Figures 4.2-12 and 4.213, respectively. Label the correct position of the event with the steepest dip from the desired migration on the results of migrations with different velocities and note the event mispositioning caused by erroneously low and high velocities. Compare with the desired migration and also note that the steeper the dip the more the underand overmigration effect. Sensitivity of migration to velocity errors can be measured quantitatively via equations 4-1 and 4-2.
From the migrated sections in Figure 4.2-14, note that the bow tie becomes increasingly less resolved at lower velocities; this indicates undermigration.
Figure 4.2-15 shows a CMP-stacked section and the desired migration. The steep left flank of the salt dome has been imaged with acceptable accuracy. The accuracy of the imaging of the slightly overturned right
(text contznues on p. 520)
FIG. 4.2-8. Tests for maximum dip to migrate in Kirchhoff migration: (a) & zero-offet section that contans a diffraction hyperboia with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration; Kirchhoff migration using (c) 4-ms/trace, (d) 8-ms/trace, (e) 12 m s / m s / ms//\mathrm{ms} /ms/ trace, and (f) 24 m s / 24 m s / 24ms//24 \mathrm{~ms} /24 ms/ trace maximum dip.
Stack

Desired Migration

FIG. 4.2-9. Tests for maximum dip to migrate in Kirchhoff migration: A low value for maximum dip to migrate can be hazardous. All dips of interest must be preserved during migration.
FIG. 4.2-10. Tests for velocity errors in Kirchhoff migration; (a) a zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration; Kirchhoff migration using (c) the medium velocity of 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s, (d) 5 percent lower, (e) 10 percent lower, and (f) 20 percent lower velocity.
FIG. 4.2-11. Tests for velocity errors in Kirchhoff migration: (a) a zero-offet section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration; Kirchhof migration using (c) the medium velocity of 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s, (d) 5 percent higher, (e) 10 percent higher, and (f) 20 percent higher velocity.
FIG. 4.2-12. Tests for velocity errors in Kirchhoff migration: (a) a zero-offet section that contains dipping events wii 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocty, (b) desired migration; Kirchhof migration using (c) the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s, (d) 5 percent lowe (e) 10 percent lower, and (f) 20 percent lower velocity.
FIG. 4.2-13. Tests for velocity errors in Kurchhoff migration: (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; Kirchhoff migration using (c) the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s, (d) 5 percent higher, (e) 10 percent higher, and (f) 20 percent higher velocity.

Stack

Desired Migration

PIG. 4.2-14. Tests for velocity errors in Kirchhoff migration: Undermigration manifested as inadequate handli bowtie is caused by the use of velocities lower than those considered to be medium velocities.
FIG. 4.2-15. (a) A CMP-stacked section, and (b) migration using the phase-shift method. Event A A AAA is the water-bottom multiple, and Event B B BBB is the peg-leg multiple associated with the top-salt boundary. These multiples are respectively denoted by Events C C CCC and D D DDD on the migrated section.
FIG. 4.2-16. Tests for velocity errors in Kirchhof migration using, from top to bottom, 100, 95, 90, and 80 percent of rms velocities. The input stacked section is shown in Figure 4.2-15a and the desired migration using the phase-shift method is shown in Figure 4 2-15b.
FIG. 4.2-17. Tests for velocity errors in Kirchhoff migration using, from top to bottom, 100, 105, 110, and 120 percent of rms velocities. The input stacked section is shown in Figure 42 2-15a and the desired migration using the phase-shift method is shown in Figure 4.2-15b.
Hank can only be inferred by the lateral positioning of the gently dipping reflections in the vicinity of the salt flank.
Figure 4.2-16 shows results of Kirchhoff migration of the stacked section in Figure 4.2-15 using velocities lower than what may be optimum for imaging. While the undermigration of the left flank of the salt dome is not so evident, the steeply dipping reflection off the right flank intersects the gently dipping reflections associated with the surrounding strata, thus providing a clue for undermigration.
Figure 4.2-17 shows results of Kirchhoff migration of the stacked section in Figure 4.2-15 using velocities higher than what may be optimum for imaging. While overmigration effects may be marginal on the section with a small velocity error ( 105 percent of optimum velocities), migration with higher velocity errors (110 and 120 percent of optimum velocities) shows signs of overmigration in the form of crossing events along the left flank of the salt diapir. Under- and overmigration effects caused by large velocity errors often are detectable; nevertheless, small velocity errors can cause subtle effects making it difficult to judge whether there is under- or overmigration. Uncertainties in migration velocities inevitably cause uncertainties in the interpretation made from migrated sections or volumes of data. For instance, the shape of the salt diapir inferred from the results shown in Figures 4.2-16 and 4.2-17 varies significantly depending on the percent velocity errors.

4.3 FINITE-DIFFERENCE MIGRATION IN PRACTICE

As described in Section 4.1, finite-difference migration is implemented using implicit and explicit schemes. In this section, we shall include in our discussion the 15degree finite-difference algorithm because of its historical significance. Nevertheless, we shall primarily discuss practical aspects of the steep-dip implicit and explicit schemes in the frequency-space domain. Specifically, we shall deal with the impulse responses, depth step size and response to velocity errors in implicit and explicit schemes.
The first finite-difference migration algorithm that was introduced to the seismic industry was based on the parabolic approximation to the scalar wave equation (Clserbout and Doherty, 1972). The algorithm was implemented in the time-space domain and designed using an implicit scheme. The parabolic approximation theoretically limits the algorithm to handling dips up to 15 degrees (Section D.3). Nevertheless, in practice, it can handle dips up to 35 degrees with sufficient accuracy due to the bandlimited nature of seismic data. Steeper dips, in principle, can be migrated by a cascaded application of the 15-degree algorithm (Larner and Beasley, 1990)
Finite-difference migration of stacked data currently is performed using steep-dip algorithms based on the continued fractions expansion to the scalar wave equation. This approximation provides a theoretical dip accuracy up to 4 5 4 5 45\mathbf{4 5}45 degrees. The basic 45 -degree scheme can be improved to handle steeper dips up to 80 degrees with reasonable accuracy (Section D.4). The 45degree finite-difference algorithm commonly is imple mented using an implicit scheme in the frequency-space domain.
First, as we did for the Kirchhoff migration, we examine the impulse response of the 15-degree implicit scheme. The shape of the impulse response of a desired migration algorithm with no dip limitation is a semicircle. The shape of the impulse response of the 15-degree equation is, in theury, an ellipse (Claerbout, 1985) as seen in Figure 4.3-1. The nature of the dispersive noise pattern inside the ellipse is discussed in the next section on depth step size. Isolated noise spikes in field data can introduce such noise patterns on migrated sections.
The parts of the responses above the small circles in Figure 4.3-1 correspond to the evanescent energy, while the parts below the circles correspond to the propagating energy (Claerbout, 1985). The parts below the circles are the useful part of the response. The evanescent
FIG. 4.3-1. Desired impulse response of a 90-degree migration algorithm is a semicircle (top), while the impulse response of the 15 -degree migration algorithm is an ellipse (bottom). The propagation zone is defined by the portion of the ellipse below the small circles, and the evanescent zone is defined by the portions above the small circles. For comparison, the desired response has been superimposed on the impulse response of the 15 -degree equation.
(a)
(b)
(c)
FIG. 4.3-2. (a) CMP stack, (b) desired migration by phase-shift method, (c) 15-degree finite-difference migration. The finite-difference migration based on the parabolic equation has the inherent property of undermigrating the steep flank of the diffraction and the steeply dipping event. See Figure 4.3-3 for a sketch of the migration results.
energy travels horizontally and is characterized by imaginary wavenumbers k z k z k_(z)k_{z}kz, which occur when the quantity in the square root in equation (4-13b) becomes negative. This means that the evanscent region corresponds to horizontal wavenumbers k x > 2 ω / v k x > 2 ω / v k_(x) > 2omega//vk_{x}>2 \omega / vkx>2ω/v. For negative k z k z k_(z)k_{z}kz, the exact extrapolator exp ( i k 2 z ) exp i k 2 z exp(-ik_(2)z)\exp \left(-i k_{2} z\right)exp(ik2z) is no longer a wave propagator; instead, it causes waves to decay rapidly in depth. Thus, evanescent energy is not expected to be present in recorded wavefields. The impulse response of the 15-degree finite-difference algorithm, however, suggests propagation in the region of evanescence. This is not desirable; the parts of the elliptical wavefront above the small circles should be removed. Use of a depth step size that is greater than the input sampling rate tends to suppress the response in the evanescent region. Excessively large depth steps, however, cause truncation of the wavefront further into the propagating zone below the small circles in Figure 4.3-1.
The impulse response (Figure 4.3-1) is used to estimate the muximum dip that the implicit finitedifference algorithm can handle without serious amplitude distortions or phase errors. This is done by super- imposing the desired semicircular response and measuring the angle between the indicated lines. Note from the measured angle in Figure 4.3-1 that the 15-degree implicit scheme can be used to migrate dips up to approximately 35 degrees with sufficient accuracy. This is primarily because errors associated with finite-difference approximations used in particular implementations of the 15-degree equation usually are adjusted to cancel some of the theoretical error asonciated with the 15degree differential equation.
The dip-limited nature of the parabolic equation causes undermigration of steeply dipping events and steep flanks of diffractions. This is demonstrated by the field data example in Figure 4.3-2. The two prominent features, diffraction D and dipping event B, are located as shown in Figure 4.3-3 before and after migration.

Depth Step Size

Finite-difference migration involves dnwnward continuation of the wavefield at the surface, such as a stacked
FIG. 4.3-3. A sketch of the diffraction D D DDD and steeply dipping event before ( B ) ( B ) (B)(B)(B) and after ( A ) ( A ) (A)(A)(A) desired migration from the sections in Figure 4.3-2. The diffraction and the dipping event after finite-difference migration using the parabolic equation are denoted by F D D F D D FD-DF D-DFDD and F D B F D B FD-BF D-BFDB, respectively.
section, and invoking the imaging principle so as to create an image of the subsurface at t = 0 t = 0 t=0t=0t=0. The downward continuation takes place in the computer at discrete depth intervals (Section 4.1). Depth step size governs performance of finite-difference migration. Inappropriate specification of this parameter can cause artifacts in the migrated section. We want to choose an optimum depth step size that is large for computational savings, yet yields a tolerable error in positioning the events after migration.
Figure 4.3-4 shows the constant-velocity diffraction hyperbola and the 15-degree implicit finite-difference migrations using four different depth steps. Large depth steps cause severe undermigration as well as kinks along the flank of the diffraction curve (especially apparent in the 60- and 80-ms cases). At smaller depth steps, such as the 20 - and 40 -ms cases, more energy collapses to the apex, but the 15-degree scheme fails to achieve a complete focusing of the energy at the apex of the hyperbola. Note also the dispersive noise that trails the unfocused energy. The dip-limited nature of the 15 -degree algorithm, however, causes undermigration whatever the depth step size (Figure 4.3-5).
Undermigration of the diffaction energy along the steep flanks of the hyperbola is caused by the parabolic approximation to the scalar wave equation. The dispersive noise that accompanies the undermigrated energy is an effect of approximating differential operators with difference operators. The accuracy of this approximation decreases at large frequencies and wavenumbers (Claerbout, 1985). Thus, the dispersive noise becomes tess with smaller trace spacing and sampling in depth and time. For example, the difference operator of equation (4-10) becomes an increasingly better approximation to the differential operator of equation (4-11) as Δ t Δ t Delta t\Delta tΔt is made smedler. To emphasize more strongly the presence of the dispersive noise, migrated sections in Figures 4.3-4 and 4.3-5 have been displayed with the same display gain level as the input section. The dispersion normally is much less pronounced on field data.
Figure 4.3-6 shows the dipping events model and the 15-degree implicit finite-difference migration results using four different depth step sizes. We can make the following inferences:
(a) Increasing depth step size causes more and more undermigration at increasingly steep dips.
(b) The waveform along reflectors is dispersed at steep dips and large depth steps.
(c) Kinks occur along reflectors at discrete intervals that correspond to the depth step size. Kinks are more pronounced at increasingly steeper dips.
The first inference results from the parabolic approximation, the second from differencing approximations, and the third from gradual undermigration toward the base of each depth step. The kinks are good for diagnostics; their presence indicates that the depth step size that is used is too coarse for the dips present in the data. In that case, smaller depth step size should be used; then the kinks disappear altogether (Figure 4.37). Nevertheless, kinks that characterize undermigration can be eliminated by a local adjustment of migration velocities or interpolation between the wavefields at the adjacent depth steps.
It is apparent from Figure 4.3-6 that migration with 20-ms depth step, which corresponds to one-half of the typical dominant period of recorded seismic waves, has the least dispersion with the least undermigration
optimum accuracy in event positioning. Further decreasing depth step size does not improve migration significantly (Figure 4.3-7). The 15-degree implicit scheme causes precursive dispersion at large depth steps greater than 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms (Figure 4.3-6) and postcursive dispersion at small depth steps less than 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms (Figure 4.3-7). Hence, taking smailer depth steps does not necessarily mean a
b
FIG. 4.3-4. Tests for extrapolation depth step size in 15degree finite-difference migration: (a) a zero-offset section that contains a diffaction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration; 15-degree finite-difference migration using (c) 20 m s 20 m s 20-ms20-\mathrm{ms}20ms (d) 40 m s 40 m s 40-ms40-\mathrm{ms}40ms, (e) 60 m s 60 m s 60-ms60-\mathrm{ms}60ms, and (f) 80 m s 80 m s 80-ms80-\mathrm{ms}80ms depth step.
b
C
e
FIG. 4.3-5. Tests for extrapolation depth step size in 15degree finite-dufference migration: (a) a zero-offset section that contains a diffrection hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration; 15-degree finite-difference migration using (c) 4-ms (d) 8 m s 1 8 m s 1 8-ms_(1)8-\mathrm{ms}_{1}8ms1 (e) 12 m s 12 m s 12-ms12-\mathrm{ms}12ms, and (f) 16 -ms depth step.
FIG. 4.3-6. Tests for extrapolation depth step size in 15degree finite-difference migration: (a) a zero-offet section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; 15-degree finite-difference migration using (c) 20 m s 20 m s 20-ms20-\mathrm{ms}20ms (d) 40 m s 2 40 m s 2 40-ms_(2)40-\mathrm{ms}_{2}40ms2 (e) 60 m s 60 m s 60-ms60-\mathrm{ms}60ms, and (f) 80 m s 80 m s 80-ms80-\mathrm{ms}80ms depth step.
FIG. 4.3-7. Tests for extrapolation depth step size in 15degree finite-difference migration: (a) a zero-offet section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; 15-degree finite-difference migration using (c) 4-ms (d) 8 -ms, (e) 12 -ms, and (f) 16-ms depth step.
better quality migration free of the artifacts that occur with the finite-difference method.
Figures 4.3-8 and 4.3-9 show the migrations of the stacked section in Figure 4.3-2a with five different depth steps using the 15 -degree implicit scheme. Note that as the depth step size is increased, the dipping event off the flank of the salt djapir is more undermigrated and the diffraction off the tip of the diapir is less collapsed. Dispersion along the diffraction hyperbola is apparent at larger depth steps (Figure 4.3-9). Again, this phenomenon is caused by the differencing approximations to the differential operators used in the design of a finite-difference algorithm.

Velocity Errors

Figure 4.3-10 shows the diffraction hyperbola and its migration using the 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s medium velocity and 5 , 10 , and 20 percent lower velocities. When velocities lower than medium velocity are used, the diffraction hyperbola gets undermigrated by the 15-degree algorithm more than it would be by an algorithm with no dip limitation (compare with Figure 4.2-10).
Figure 4.3-11 shows the diffraction hyperbola and its migration using the 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s medium velocity and 5, 10, and 20 percent higher velocities. When velocities higher than medium velocity are used, the diffraction hyperbola gets overmigrated less by the 15 -degree algorithm than it would be by an algorithm with no dip limitation (compare with Figure 4.2-11). Moreover, note the increase in dispersive noise as a result of overmigration.
Figure 4.3-12 is the dipping events model with migrations using the 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s medium velocity, and 5 , 10, and 20 percent lower velocities. For comparison, label the correct position of the event with the steepest dip from the desired migration on the results of migration with different velocities. As in any other migration method, velocity errors cause events to be mispositioned at increasingly steeper dips. The undermigration effect of lower velocities is reinforced by the inherently undermigrating nature of the 15-degree algorithm. As a result, dipping events are undermigrated more by the 15-degree algorithm in contrast than by an algorithm with no dip limitation (compare with Figure 4.2-12).
Figure 4.3 13 4.3 13 4.3-134.3-134.313 is the dipping events model with migrations using the 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s medium velocity, and 5 , 10, and 20 percent higher velocities. For comparison, again, label the the correct position of the event with the steepest dip from the desired migration on the results of migration with different velocities. The overmigration effect of higher velocities is counteracted by the inherently undermigrating nature of the 15-degree algorithm. As a result, dipping events are not overmigrated by the 15 -degree algorithm as much as they would be by an algorithm with no dip limitation (compare with Figure 4.2-13).
Velocity error test results on field data using the 15-degree implicit scheme are shown in Figures 4.3-14 and 4.3-15. Figure 4.3-16 is a sketch of the under- and overmigration effects. As noted above with the dipping events model (Figures 4.3-12 and 4.3-13), when using velocities greater than medium velocities, overmigration is not as pronounced with the 15 -degree finite-difference migration as it is with a 90 -degree algorithm, such as the Kirchhoff or phase-shift method. On the other hand, when using velocities lower than medium velocities, the undermigration effect is more pronounced with the 15degree finite-difference migration in comparison with a 90-degree algorithm (compare Figure 4.3-16 with Figure 4.5-13).
At first, it may appear to be sensible to compensate for the undermigration caused by a low-dip algorithm by adjusting migration velocities. For example, the best match between the desired migration and the 15-degree finite-difference results for the dipping event in Figure 4.3-16 occurs when 10 percent higher velocities are used in the finite-difference migration. While for one dip this adjustment may be acceptable, for another dip it may not be. Therefore, deficiencies of a migration algorithm should not be compensated for by makng modifications to the velocity field for magration.

Cascaded Migration

To compensate for the inherent undermigration by the 15-degree finite-difference migration, Larner and Beasley (1990) proposed performing migration using the 15-degree equation, repeatedly the input to the next migration stage being the output from the previous stage. Such cascaded application of the 15-degree migration is demonstrated in Figure 4.3-17. Migration of the constant-velocity diffraction hyperbola using the 15-degree equation only once yields the familiar result of unfocused energy accompanied with dispersive noise (Figure 4.3-17c). A cascaded application of the 15-degree equation produces improved focusing of the energy at the apex of the hyperbola. The more the number of stages in the cascaded migration the more the improvement in focusing the energy (Figures 4.3-17d,e,f).
An interesting theoretical observation is that cascaded migration using a dip-limited algorithm, such as the 15 -degree finite-difference scheme, actually requires a depth step size that is greater than the optimal depth size for a single-stage application of the algorithm. In
b
FIG. 4.3-8. Tests for extrapolation depth step size in 15-degree fnite-difference migration: (a) Desixed migration using the phase-shift method, (b) 4-ms depth step, and (c) 20-ms depth step. The input CMP stack is shown in Figure 4.3-2a.
b C
FIG. 4.3-9. Tests for extrapolation depth step size in 15-degree finite-difference migration: (a) 40-ms depth step, (b) 60-ms depth step, and (c) 80 -ms depth step. The input CMP stack is shown in Figure 4.3-2a and the desired migration is shown in Figure 4.3-2b.
d
e
FIG. 4.a-10. Tests for velocity errors in 15-degree finitedifference migration: (a) a zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s velocity, (b) desired migration; 15-degree finite-difference migration using (c) the medium velocity of 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s, (d) 5 percent lower, (e) 10 percent lower, and (f) 20 percent lower velocity. Depth step stze is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms. s
a
b
d
e
FIG. 4.3-11. Tests for velocity errors in 15-degree finitedifference migration: (a) a zero-ofset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration; 15-degree finite-difference migration using (c) the medium velocity of 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s, (d) 5 percent higher, (e) 10 percent higher, and (f) 20 percent higher velocity. Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms.
FIG. 4.3-12. Tests for velocity exrors in 15-degree finitedifference migration: (a) a zero-offet section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; 15-degree finite-difference migration using (c) the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s, (d) 5 percent lower, (e) 10 percent lower, and (f) 20 percent lower velocity. Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms.
b
FIG. 4.3-13. Tests for velocity errors in 15-degree fintedifference migration: (a) a zero-ofset section that contains dipping events with 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s velocity, (b) desired migration; 15-degree finite-difference migration using (c) the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s, (d) 5 percent higher, (e) 10 percent higher, and (f) 20 percent higher velocity. Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms.
FIG. 4.3-14. Tests for velocity errors in 15-degree finite-difference migration using (a) 95 percent, (b) 90 percent, and (c) 80 percent of rms velocities. The input stacked section is shown in Figure 4.3-2a and the desired migration using the phase-shift method is shown in Figure 4.3-2b. Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms.
FIG. 4.3-15. Tests for velocity errors in 15-degree finite-difference migration using (a) 105 percent, (b) 110 percent, and (c) 120 percent of rms velocities. The input stacked section is shown in Figure 4.3-2a and the desired migration using the phase-shift method is shown in Figure 4.3-2b. Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms.
FIG. 4.3-16. The undermigration and overmigration effects from Figures 4.3-14 and 4.3-15. B = B = B=B=B= dipping event before and A = A = A=A=A= dipping event after desired migration, D = D = D=D=D= diffraction before and D = D = D^(')=D^{\prime}=D= diffraction after 15-degree finitedifference migrations, and L = L = L=L=L= percent lower velocities, and H = H = H=H=H= percent higher velocities.
fact, the more the number of stages in the cascade, the coarser the depth step size to achieve better focusing of the energy (Figure 4.3-17).
Cascaded migration of the constant-velocity zerooffset section that contains dipping events is shown in Figure 4.3-18. Again, the 15-degree finite-difference migration yields the familiar result of undermigrated steeply dipping events accompanied by the dispersive noise. When applied in a cascaded manner, the algorithm positions the steeply dipping events more accurately. With a sufficient number of cascades (Figure 4.3 18 f ) 18 f {: 18f^('))\left.18 f^{\prime}\right)18f), the 15-degree algorithm can actually position the events as accurately as a 90 -degree algorithm applied only once (Figure 4.3-18b). For comparison, the event with the steepest dip (AB) is labeled on the desired migration (Figure 4.3-18b) and the cascaded migration (Figure 4.3-18f).
Unfortunately, the encouraging results from cascaded migration using the 15-degree algorithrn shown in Figures 4.3-17 and 4.3-18 are only attainable for a constant-velocity medium. In case of a medium with vertically varying velocity, the cascaded application of the 15-degree algorithm causes overmigration (Figure
4.3-19). While this observation can be verified by theory, the situation can also be remedied by a cleverly implemented form of cascaded migration with a constant velocity used in each stage (Larner and Beasley, 1990).
Actually, it turns out that cascaded migration theory dictates constant velocity to be used in each stage. If a variable velocity is used, then a 90 -degree algorithm such as the phase-shift method is required in lieu of a dip-limited algorithm for each stage. While the cascaded application of a dip-limited finite-difference algorithm with a variable velocity causes overmigration (Figure 4.3-19c), the cascaded application of the phase-shift algorithm with no dip limit yields an accurate image (Figure 4.3-20e).
Since the advancements made in practical implementation of steep-dip implicit and explicit finitedifference schemes, practical use of cascaded migration, however, has been limited.

Reverse Time Migration

In Section 4.1, a. migration algorithm based on extrapolation back in time while using the stacked section to be the boundary condition at z = 0 z = 0 z=0z=0z=0 was discussed. The impulse response of this algorithm, which is known as reverse tine migration, is shown in Figure 4.3-21. Note that the algorithm can handle dips up to 90 degrees with the accuracy of phase-shift migration. The important consideration is that the extrapolation step Δ t Δ t Delta t\Delta tΔt in reverse time migration must be taken quite small, usually a fraction of the input temporal sampling interval. This then makes the algorithm computationally intensive.
Figure 4.3-22 shows a portion of a CMP-stacked section and its reverse time migration. The steep flanks of the salt diapirs have been imaged accurately, enabling. delineation of the geometry of the top-salt boundary with confidence. Reverse time migration, albeit its simple and elegant, implementation (Section 4.1), has not been used widely in practice. Again, this is primarily because it requires very small extrapolation step in time, which increases the computational cost of the algorithm.

4.4 FREQUENCY-SPACE MIGRATION IN PRACTICE

The basis of the steep-dip implicit algorithms is the dispersion relation of equation (4-18). Finite-difference schemes with steep-dip accuracy are implemented conveniently in the frequency-space donain. An important
(a)
(b)
(c)
(d)
(e)
FIG. 4.3-17. (a) A zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration using the phase-shift method, (c) 15-degree finite-difference migration using a depth step of 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms; cascaded application of the 15-degree migration using (d) 4 cascades with 80-ms depth step, (e) 10 cascades with 200 -ms depth step, and (f) 20 cascades with 400 m s 400 m s 400-ms400-\mathrm{ms}400ms depth step.
(a)
(b)
(c)
(d)
(e)
(t)
FIG. 4.3-18. (a) A zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration using the phase-shift method, (c) 15-degree finite-difference migration using a depth step of 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms; cascaded application of the 15-degree migration using (d) 4 cascades with 80 m s 80 m s 80-ms80-\mathrm{ms}80ms depth step, (e) 10 cascades with 200 m s 200 m s 200-ms200-\mathrm{ms}200ms depth step, and (f) 20 cascades with 400 -ms depth step. For comparison, event A B A B ABA BAB with the steepest dip is labeled on the desired migration (b) and the cascaded migration (f).
(a)
(d)
(b)
(e)
(c)
(f)
FIG. 4.3-19. (a) A zero-offset section that contains three diffaction hyperbolas with a vertically varymg velocity, (b) 15degree finite-difference migration using a depth step of 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms; the output from the last stage of cascaded application of the 15-degree migration using (c) 4 cascades with 80-ms depth step, (d) 10 cascades with 200 -ms depth step, (e) 20 cascades with 400 m s 400 m s 400-ms400-m s400ms depth step, and (f) desired migration using the phase-shift method.
(a)
(d)
(b)
(e)
(c)
(f)
FIG. 4.3-20. (a) A zero-offset section that contains three diffraction hyperbolas with a vertically varying velocity; four-stage cascaded migration using the phase shift-method with 80-ms depth step: (b) first-stage, (c) second stage, (d) third stage, (e) fourth stage, and (f) desired migration using the phase-shift method only once with 20-ms depth step. Compare the fourth stage (e) with the output of the four-stage casceded migration using a dip-limited algorithm as in Figure 4.3-19c.
FIG, 4.3-21. Impulse response of a reverse time migration algorithm.
advantage of the implicit method is its exceptional ability to handle velocity variations, whether vertical or leteral. Its accuracy for the lateral velocity problem results from the fact that the time shift associated with the thin-lens term (equation 4-16b) can be implemented exactly in the frequency domain. For these reasons, the algorithm is most appropriate for depth migration to image targets beneath complex structures (Chapter 8 ).
The frequency-space, sometimes referred to as ω x ω x omega-x\omega-xωx or f x f x f-xf-xfx, migration also has the important operational advantage that each frequency can be processed separately. This property can reduce computer memory requirements significantly and, thus, decrease inputoutput operations for large data sets. Also, in frequencyspace migration, some accuracy features can be conveniently implemented. For example, wave extrapolation can be limited to a specified signal bandwidth. Each frequency component can, in principle, be downward continued using an optimum depth step size that yields a minimum acceptable phase error, leading to a minimum amount of dispersive noise on the migrated section.

Steep-Dip Implicit Methods

Figure 4.4-1 shows the impulse responses of a series of implicit frequency-space finite-difference schemes with different degrees of dip accuracy. Whether it is implemented in the time-space domain (Figure 4.3-1) or frequency-space domain (Figure 4.4-1), the 15-degree algorithm yields an elliptic impulse response. The 45degree algorithm yields an impulse response in the shape of a heart.
The 15-degree equation is derived from the Taylor expansion of the dispersion relation (equation 414a). The 45-degre equation is based on the continued fractions expansion (equation 4-18), which allows wider angle approximations. Kjartansson (1979) implemented the 45-degree equation for migration of stacked data.
The 45-degree equation (4-18) can be upgraded to be accurate for dips up to 65 degrees by tuning some coefficients (Section D.4). Higher-order operators can be obtained by the successive application of a number of operators like the 45-degree operator (Ma, 1981) with a different set of coefficients (Lee and Suh, 1985). As shown in Figure 4.4-1, with increasing dip accuracy, the impulse responses of the algorithms approach the shape of a semicircle. However, branches in the impulse response associated with evanescent energy remain.
Fipure 4.4-2 shows migration of a constant-velocity diffraction hyperbola using the 65-, 80-, 87-, and 90degree implicit schenes (Section D.4). While the for cusing is better than that achieved by the 15 -degree implicit scheme (Figure 4.3-4c), note that the dispersive noise still persists in the image obtained from the 65-degree implicit scheme (Figure 4.4-2c). It is evident that the quality of focusing from the 80 -degree implicit scheme is superior (Figure 4.4-2d). The 87- and 90-degree schemes have caused overmigration of the diffraction hyperbola (Figures 4.4-2e,f).
The overmigration effect also can be observed on the results from the constant-velocity dipping events model in Figure 4.4-3. In fact, the dispersive noise that accompanies the steeply dipping events is present in all cases. The response of an implicit scheme is the product of a complicated interplay of various parameters (Section D.6) - depth step size, sampling intervals in space and time, dip angle, velocity and frequency. Dispersive noise, and under- or overmigration characteristics of implicit schemes depend on the specific implementation.
Figure 4.4-4 shows the stacked data migrated using three different approximations in frequency-space domain 15 , 45 15 , 45 -15,45-15,4515,45, and 65 degrees. Note that by higherdegree approximation, the collapse of the diffraction becomes complete, and the steeply dipping event is migrated more accurately. Compare these results with the desired migration in Figure 4.3-2b. Also note the similar results obtained from the 15-degree time-space ( t x ) ( t x ) (t-x)(t-x)(tx) algorithm (Figure 4.3-2c) and the 15-degree frequencyspace ( ω x ) ( ω x ) (omega-x)(\omega-x)(ωx) algorithm (Figure 4.4-4a).
Figure 4.4-5 shows a field data example of frequency-space implicit finite-difference migrations with different degrees of accuracy. Compare the results with the desired migration in Figure 4.2-15b and note that the 80-degree scheme probably produces the most preferred inage of the salt dome as compared to that from the 65 -degree scheme. The schemes with steeper dip accuracy (87- and 90-degree schemes), however, yield marginal improvenents over the 80 -degree scheme. Often the 65-degree scheme produces acceptable results, and the 80 -degree scheme, which requires twice the computational effort, is used occasionally in practice.
Desired Impulse Response
15 15 15^(@)15^{\circ}15
45 45 45^(@)45^{\circ}45
87 87 87^(@)87^{\circ}87
900
90 90 90^(@)90^{\circ}90
FIG. 4.4-1. Impulse responses of the frequency-space implicit schemes with various degrees of approximations to the one-way scalar wave equation. (See Section D. 4 for the theoretical basis of these responses)

Depth Step Size

Figure 4.4-6 shows the constant-velocity diffraction hyperbola and the steep-dip implicit 65-degree finitedifference migrations using four different depth steps. Large depth steps cause undermigration as well as kinks along the flank of the diffraction curve (especially apparent in 60 60 60-60-60 and 80 m s 80 m s 80-ms80-\mathrm{ms}80ms cases). The dispersive noise, typical of finite-difference schemes, persists to varying degrees irrespective of the depth step size. At smaller depth steps, more energy collapses to the apex (Figure 4.4-7f).
As in the case of the parabolic approximation (Figure 4.3-5), the dispersive noise that accompanies the undermigrated energy (Figures 4.4.6 and 4.4.7) is an effect of approximating differential operators with dif-
FIG. 4.4-2. (a) A zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration using the phase-shift method; frequency-space finite-diference migrations using (c) the 65-degree, (d) 80-degree, (e) 87-degree, and (f) 90-degree implicit scheme.
c
FIG. 4.4-3. (a) A zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration using the phase-shift method; frequency-space finite-difference migrations using (c) the 65-degree, (d) 80-degree, (e) 87-degree, and (f) 90-degree implicit scheme.
(a)
(b)
(c)
FIG. 4.4-4. Frequency-space finite-difference migrations of the CMP stack in Figure 4.3-2a using implicit finite-difference schemes based on (a) the 15-degree, (b) 45-degree, and (c) 65-degree approximation. Note the increasingly better imaging obtained using higher angle approximations. The desired migration is shown in Figure 4.3-2b.
ference operators. With reasonable depth steps ( 20 m s ) ( 20 m s ) (20ms)(20 \mathrm{~ms})(20 ms), the undermigration caused by the dip limitation of the 65-degree algorithm (Figure 4.4-7f) is less pronounced as compared to that of the 15-degree algorithm (Figure 4.3-4c). At large depth steps, the steep-dip accuracy is compromised, and the difference between the two algorithms becomes less distinguishable (compare Figures 4.4-6f and 4.3-4f).
The response of a finite-difference algorithm to a diffraction or a dipping event depends upon the type of differencing scheme and dip limitation. At large depth steps, the steep-dip algorithm undermigrates the diffraction hyperbola (Figure 4.4-6) as does the 15degree scheme (Figure 4.3-4). At small depth steps, the steep-dip algorithm causes slight overmigration of the diffraction hyperbola (Figure 4.4-7c,d), unlike the 15degree scheme which causes undermigration whatever the depth step size (Figure 4.3-5).
Figure 4.4-8 shows the constant-velocity dipping events model and the steep-dip implicit finite-difference migration results using four different depth step sizes. The response of the steep-dip implicit scheme is quite similar to that of the 15 -degree scheme. Specifically, in- creasing depth step size causes more and more undermigration at increasingly steep dips. The waveform along reflectors is dispersed at steep dips and large depth steps. Kinks occur along reflectors at discrete intervals that correspond to the depth step size. Note that the kinks are more pronounced at increasingly steeper dips.
It is apparent from Figure 4.4.9 that migration with 20 -ms depth step has the least dispersion with the least undermigration optimum accuracy in event positioning. Further decreasing depth step size actually causes overmigration as for the diffraction hyperbola (Figure 4.4-7).
The response of a finite-difference algorithm to dipping events depends again on the approximation made to the scalar wave equation. For instance, with small depth steps less than one-half the dominant period of the reflection events, the steep-dip implicit scheme causes overmigration of the reflection with the stoepest dip (Figure 4.4-9c). The 15-degreee implicit scheme, on the other hand, causes postcursive dispersion along the steeply dipping reflectors (Figure 4.3-7c). Hence, taking smaller depth steps does not necessarily mean a better quality migration free of the artifacts that ve-
FIG. 4.4-5. Frequency-space finite-difference migrations of the CMP stack in Figure 4.2-15a using, from top to bottom, the 65-degree, 80 -degree, 87 -degree, and 90 -degree implicit schemes. The desired migration usung the phase-shift method is shown in Figure 4 2-15b.
FIG. 4.4-6. Tests for extrapolation depth step size in 65 degree frequency-space implicit finite-difference migration: (a) a zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocty, (b) desired migration; 65-degree finite-difference migrations using (c) 32 m s 32 m s 32-ms32-\mathrm{ms}32ms, (d) 40 m s 40 m s 40-ms40-\mathrm{ms}40ms, (e) 60 m s 60 m s 60-ms60-\mathrm{ms}60ms, and (f) 80 m s 80 m s 80-ms80-\mathrm{ms}80ms depth step.
FIG. 4.4-7. Tests for extrapolation depth step size in 65 degree frequency-space implicit finite-difference migration: (a) a zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration; 65-degree finite-difference migrations using (c) 8-ms, (d) 12-ms, (e) 16-ms, and (f) 20 -ms depth step.
d
FIG. 4.4-8. Tests for extrapolation depth step size in 65degre frequency-space implicit finite-difference migration: (a) a zero-ofiset section that contains dipping events with 3500 π / s 3500 π / s 3500-pi//s3500-\pi / \mathrm{s}3500π/s velocity, (b) desired migration; 65 -degree finitedifference migrations using (c) 32 m s 32 m s 32-ms32-\mathrm{ms}32ms, (d) 40 m s 40 m s 40-ms40-\mathrm{ms}40ms, (e) 60 m s 60 m s 60-ms60-\mathrm{ms}60ms, and (f) 80 -ms depth step.
FIG. 4.4-9. Tests for extrapolation depth step size in 65degre frequency-space implicit finite-difference migration: (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; 65-degree fintedifference migrations using (c) 8-ms, (d) 12-ms, (e) 16-ms, and (f) 20-ms depth step.
cur with the finite-difference method. With large depth steps, both schemes cause undermigration accompanied by precursive dispersion along the dipping events (Figures 4.3-6 and 4.4-8).
Theoretically, the 65 -degree differential equation is more accurate than the 15 -degree differential equation. However, once discretized, the difference in performance between these two equations can be less (Diet and Lailly, 1984). A good finite-difference migration program uses differencing schemes that maintain the dip accuracy implied by the corresponding differential equation.
The main point to remember is that migration of steep dips generally requires a small depth step size, Practical considerations suggest that depth step size should be between one-half and one-full dominant period of the seismic data to be migrated (from 20 to 40 m s m s ms\mathrm{ms}ms ), depending on the steepness of the dips in the data.
A higher order approximation, such as the 65degree equation, provides a. smaller range of choice for optimum depth size as compared to the 15-degree equation. In particular, note that the optimum depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms for the dipping events model shown in Figures 4.4-8 and 4.49; any departure from this value causes either undermigration or overmigration. The results with the 20 m s 20 m s 20-ms20-\mathrm{ms}20ms depth step in Figures 4.3-4 and 4.4-9 convincingly show that the 65-degree algorithm can migrate steeper dips and collapse diffractions more accurately than the 15 -degree equation.
Figures 4.4-10 and 4.4-11 show migrations of the stacked section in Figure 4.2-15a with eight different depth steps using a steep-dip implicit scheme. Note that as the depth step size is increased, more undermigration occurs. Dispersion along the undermigrated event associated with the steep left flank of the salt dome is apparent at larger depth steps. A 20 m s 20 m s 20-ms20-\mathrm{ms}20ms depth step size, which is equivalent to the usual case of one-half the dominant period of seismic data, generally is an acceptable choice for most of the implicit finite-difference schemes.

Velocity Errors

We now examine the response of a steep-dip implicit algorithm to velocity errors. Figure 4.4-12 shows the constant-velocity diffraction hyperbola and its migrations using the medium velocity, and 5,10 , and 20 percent lower velocities. When velocities lower than medium velocity are used, the diffraction hyperbola is undermigrated (Figure 4.412d,e,f), but not as much as in the case of the 15-degree equation (Figure 4.3 10 d , e , f ) 10 d , e , f ) 10 d,e,f)10 d, e, f)10d,e,f). On the other hand, the diffraction hyperbola gets undermigrated by the steep-dip algorithm more than it would be by an algorithm with no dip limitation (compare with Figure 4.2-10).
Figure 4.4-13 shows the constant-velocity diffaction hyperbola and its migrations using the medium velocity, and 5,10 , and 20 percent higher velocities. When velocities higher than medium velocity are used, the diffraction hyperbola is overmigrated (Figure 4.413d,e,f), more so than with the 15-degree equation (Figure 4.3-1Id,e,f). On the other hand, the diffaction hyperbola gets overmigrated by the steep-dip algorithm less than it would be by an algorithm with no dip limitation (compare with Figure 4.2-11). Whatever the velocity used for migration, dispersive noise is present persistently in finite-difference results (Figures 4.4-12 and 4.4-13).
Figure 4.4-14 shows the constant-velocity dipping events model with migrations using the medium velocity, and velocities that are 5, 10, and 20 percent lower. For comparison, label the correct position of the event with the steepest dip from the desired migration on the results of migration with different velocities. As in any other migration method, velocity errors cause events to be increasingly more mispositioned at steeper dips. The undermigration effect of lower velocities is reinforced by the inherently undermigrating nature of the steep-dip algorithm, although not as much as in the case of the 15-degree algorithm (Figure 4.3-12). As a result, dipping events are more undermigrated by the steep-dip algorithm in contrast to an algorithm with no dip limitation (compare with Figure 4.2-12).
Figure 4.4-15 is the dipping events model with migrations using the 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s medium velocity, and 5 , 10, and 20 percent higher velocities. For comparison, again, label the correct position of the event with the steepest dip from the desired migration on the results of migration with different velucities. The overmigration effect of higher velocitjes is counteracted by the inherently undermigrating nature of the steep-dip algorithm, although not as much as in the case of the 15-degree algorithm (Figure 4.3-13). As a result, dipping events are not overmigrated by the steep-dip algorithm as much as they would be by an algorithm with no dip limitation (compare with Figure 4.2-13).
The nature of the precursive and postcursive dispersion along steeply dipping events in the output from finite-difference migration, theoretically depends on the type of differencing scheme used in approximating the differential operators associated with the scalar wave equation. In principle, an implicit finite-difference migration implemented in the frequency-space domain yields less dispersion compared to an implicit scheme implemented in the time-space domain. This is because the former requires differencing in x x xxx and z z zzz, while the
FIG. 4.4-10. Tests for extrapolation depth step size in 65-degre frequency-space implicit finite-difference migration using from top to bottom, 32-ms, 40-ms, 60-ms, and 80-ms depth steps. The input CMP stack is shown in Figure 4.2-15a, and the desired migration using the phase-shift method is shown in Figure 4 2-15b.
FIG. 4.4-11. Tests for extrapolation depth step size in 65-degree frequency-space implicit finite-difference migration usiug, from top to bottom, 8 m s , 12 m s , 16 m s 8 m s , 12 m s , 16 m s 8-ms,12-ms,16-ms8-\mathrm{ms}, 12-\mathrm{ms}, 16-\mathrm{ms}8ms,12ms,16ms, and 20 m s 20 m s 20-ms20-\mathrm{ms}20ms depth steps. The input CMP stack is shown in Figure 4.2-15a, and the desired migration using the phase-shift method is shown in Figure 4.2-15b.
c
FIG. 4.4-12. Tests for velocity errors in 65-degree frequency-space implicit finite-difference migration: (a) a zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration; 65-degree fintedifference migration using (c) the mediurn velocity of 2500 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s, (d) 5 percent lower, (e) 10 percent lower, and (f) 20 percent lower velocity. Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms.
d
e
FIG. 4.4-13. Tests for velocity errors in 65-degree frequency-space implicit finite-difference migration: (a) a zero-offset section that contains a diffaction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500 \mathrm{-m} / \mathrm{s}2500m/s velocity, (b) desired migration; 65 -degree finitedifference migration using (c) the medium velocty of 2500 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s, (d) 5 percent higher, (e) 10 percent higher, and (f) 20 percent higher velocity. Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms.
FIG. 4.4-14. Tests for velocity errors in 65-degree frequency-space implicit finite-difference migration: (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; 65-degree finitedifference migration using (c) the medium velocity of 3500 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s, (d) 5 percent lower, (e) 10 percent lower, and (f) 20 percent lower velocity, Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms,
c
e
FIG. 4.4-15. Tests for velocity errors in 65-degree frequency-space implicit finite-difference migration: (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; 65 -degree finitedifference migration using (c) the medium velocity of 3500 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s, (d) 5 percent higher, (e) 10 percent higher, and (f) 20 percent higher velocity. Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms
latter requires differencing in t t ttt in addition to x x xxx and z z zzz. In practice, however, dispersive noise contaminates migration results from implicit schemes almost without exception.
Velocity error tests on field data using the 65 65 65-65-65 degree implicit scheme are shown in Figures 4.4-16 and 4.417. With velocities erroneously too low, note the pronounced undermigration of the steep salt flank. With velocities erroneously too high, note the overmigration of the steep salt flank and the crossing of reflections at the vicinity of the crest of the salt structure.

Steep-Dip Explicit Methods

Although implicit schemes are always stable and naturally suitable to accommodate lateral velocity variations, they have been known to have some unfavorable aspects. Specifically, dispersive noise caused by the differencing approximations to differential operators does indeed deteriorate the quality of migration of real data (Figures 4.3-8, 4.3-9, 4.4-10, and 4.4-11). An equally important concern about implicit schemes is the fact that they never meet the expected theoretical dip accuracy. A 45-degree algorithm can actually provide only a 5degree accuracy for certain frequencies and velocities. Because of a complex interaction of temporal and spatial sampling rates, dip, velocity, and frequency, an optimun depth step size that yields minimum phase and amplitude errors for an entire data set is never easy to specify (Section D.6).
While implicit schemes are guaranteed to be stable whatever the depth step size, stability of explicit schemes requires a depth step that is sufficiently small (Section D.6). Putting aside the stability issue, explicit schemes implemented in the frequency-space domain (Section D.5) can alleviate some of these deficiencies of implicit schemes.
Refer to the impulse responses shown in Figure 4.418 and note that explicit schemes do not produce any visible dispersion along steep dips. Explicit schemes involve convolution of a symmetric complex filter in the frequency-space domain with the wavefield to perform extrapolation in depth. In contrast, implicit schemes can be computationally intensive for large volumes of data since they require solving complex tridiagonal equations associated with the differencing in the x x xxx direction.
Steep-dip accuracy in explicit schemes is attained by increasing the extrapolation filter length. The impulse responses shown in Figure 4.4-18 are associated with three different extrapolators - a 7-point filter with a 30 -degree accuracy, an 11-point filter with a 50-degree accuracy, and a 25 -point filter with a 70 -degree accuracy. Note that the explicit extrapolation filter cuts off beyond the specified dip limit. In contrast, the implicit extrapolation treats the evanescent energy as though it is part of the propagating energy (Figure 4,41).

Dip Limits of Extrapolation Filters

Figure 4.4-19 shows a zero-offset section that contains a diffraction hyperbola and its migrations using the 30 -, 50- and 70-degree explicit schemes. Also show is the desired migration using the phase-shift method. Note that the low-dip algorithm causes undermigration of the diffraction hyperbola, while the steep-dip algorithm focuses the energy at the apex better than a steep-dip implicit scheme with equivalent dip accuracy (Figure 4.4-7).
Explicit schemes are designed based on a specified cutoff wavenumber k x k x k_(x)k_{x}kx (Section D.5), beyond which the amplitude spectrum of the filter is set to zero. Figure 4.4-20 shows the f k f k f-kf-kfk spectra of the results of migration of the diffraction hyperbola as shown in Figure 4.419 using the three explicit extrapolators. Note that the lower the dip limit, the lower the cutoff wavenumber. The steep-dip algorithm with a 70 -degree dip limit is able to replicate the amplitude response characteristics of the desired migration using the phase-shift method. This of course is at the expense of using a long, complex convolutional filter.
Figure 4.4-21 shows a zero-ofset section that contains a set of dipping events and its migrations using the 30,50 and 70 -degree explicit schemes. Also shown is the desired migration using the phase-shift method. For comparison, label the the correct position of the event with the steepest dip from the desired migration on the results of migration with different velocities. The steep-dip algorithm positions the events nearly as good as the desired migration using the phase-shift method and better than a steep-dip implicit scheme with equivalent dip accuracy (Figure 4.4-9).
Figure 4.4-22 shows the f k f k f-kf-kfk spectra of the results of migration of the dipping events as shown in Figure 4.4-21 using the three explicit extrapolators. The extrapolation filter with the 30-degree dip limit has truncated the steeply dipping events at high wavenumbers k x k x k_(x)k_{x}kx. Except for very high wavenumbers, the extrapolation filter with the 70-degree dip limit is able to repiicate the amplitude response characteristics of the desired migration using the phase-shift method. Keep in mind that we achieve stability of explicit schemes at the expense of truncating the response at wavenumbers k x k x k_(x)k_{x}kx above a specified cutoff value (Section D.5).
FIG. 4.4-16. Tests for velocity errors in 65-degree frequency-space implicit finite-difference migration using interval velocities derived from, from top to bottom, 100 , 95 , 90 100 , 95 , 90 100,95,90100,95,90100,95,90, and 80 percent of rms velocities. The input stacked section is shown in Figure 4 2-15a, and the desired migration using the phase-shift method is shown in Figure 4.2-15b. Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms.
FIG. 4,4-17. Tests for velocity errors in 65 -degree frequency-space implicit finite-difference migration using interval velocities derived from, from top to bottom, 100 , 105 , 110 100 , 105 , 110 100,105,110100,105,110100,105,110, and 120 percent of r m s r m s rms\mathrm{rms}rms velocities. The input stacked section is shown in Figure 4.2-15a, and the desired migration using the phase-shift method is shown in Figure 42 15 b 42 15 b 42-15b42-15 \mathrm{~b}4215 b. Depth step size is 20 m s 20 m s 20ms20 \mathrm{~ms}20 ms.
FIG. 4.4-18. (a) Impulse response of a desired migration algorithm using the phase-shft method; impulse responses of (b) a 30 -degree, (c) 50 -degree, and (d) 70 -degree frequency-space explicit scheme for migration.
A field data example of a stacked section which has been migrated using the 30 -degree, 50 -degree and 70-degree extrapoaltion filters is shown in Figure 4.4-23. The steep flanks of the salt diapirs are clearly better imaged by the steep-dip extrapolation filter. For comparison, Figure 4.4-24 shows the desired migration using the phase-shift method. Although the length of the extrapolation filter for a steep-dip algorithm is much longer than that for a low-dip extrapolation filter, the benefit of using the former is indisputably demonstrated by the field data example shown in Figure 4.4-23.

Velocity Errors

Figure 4.4-25 shows migrations of a zero-offet section that contains a diffraction hyperbola using a frequencyspace explicit algorithm based on 30-degree, 50-degree and 70-degree extrapolation filters and a velocity that is 90 percent of the medium velocity. For comparison, desired migration using the phase-shift method with the medium velocity and 90 percent of the medium velocity are also shown in the same figure. Migration with an
FIG. 4.4-19. (a) A zero-offet section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration using the phase-shift method; migrations using frequency-space explicit schemes with (c) 30 -degree, (d) 50 degree, and (e) 70-degree accuracy.
FIG. 4.4-20. The f k f k f-kf-kfk spectra of the sections in Figure 4.4. 19: (a) A vero-offset section that contains a diffraction byperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration using the phase-shift method; migrations using frequency-space explicit schemes with (c) 30-degree, (d) 50-degree, and (e) 70-degree accuracy.
FIG. 4.4-21. (a) A zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration using. the phase-shift method; migrations using frequency-space explicit schemes with (c) 30-degree, (d) 50-degree, and (e) 70-degree accuracy.
erroneously low velocity yields the undermigrated form of the diffraction hyperbola as seen in Figure 4.4-25c. Note, however, the dip-limited explicit schemes appear to cause less undermigration compared to the phaseshift method with 90 -degree accuracy. This behavior is in contradiction to intuition the undermigration effect of an erroneously low velocity is reinforced by a dip-limited algorithm. In fact, this intuitive effect was demonstrated by the steep-dip implicit scheme (Figure 4.4-12).
The deceptive behavior of the explicit schemes that contradicts our intuition can be explained by the fact that these schemes filter out the energy at high wavenumbers (Figures 4.4-19 and 4.4-20). As a result,
FIG. 4.4-22. The f k f k f-kf-kfk spectra of the sections in Figure 4.4-21: (a) A zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration using the phase-shift method; migrations using frequency-space explicit schemes with (c) 30-degree, (d) 50-degree, and (e) 70-degree accuracy.
the steep limbs of the undermigrated diffraction hyperbola are truncated (Figure 4.4-25). This in turn makes the result of migration using lower velocity appear less undermigrated in case of an explicit scheme compared to the case of the phase-shift method with 90-degree accuracy. In fact, if we apply a wavenumber filter to reject the high wavenumbers from the output of phase-shift migration (Figure 4.4-25c), the result would resemble
FIG. 4.4-24. Migration of the CMP stack shown in Figure 4.3-22a using the phase-shift method.
b
,
d
FIG. 4.4-25. Tests for velocity errors in frequency-space explicit migration: (a) a zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired m i m i mi\mathrm{mi}mi gration using the phase-shift method, and (c) phase-shift migration using 10 percent lower velocity; migrations using 10 percent lower velocity and frequency-space explicit schemes with (d) 30-degree, (e) 50-degree, and (f) 70-degree accuracy.
the output of an explicit scheme (Figures 4.4-25d,e,f). Also note from Figure 4.4-25 that the low-dip explicit scheme manifests the effect of undermigration much less than the steep-dip explicit scheme. This is because the wavenumber filtering effect is more sovere for the low-dip explicit scheme (Figure 4.4-20).
Figure 4.4-26 shows migrations of a zero-offset section that contains a diffaction hyperbola using a
FIG. 4.4-26. Tests for velocity errors in frequency-space explicit migration: (a) a zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration using the phase-shift method, and (c) phase-shift migration using 10 percent lower velocity; migrations us. ing 10 percent higher velocity and frequency-space explicit schemes with (d) 30-degree, (e) 50-degree, and (f) 70-degree accuracy.
frequency-space explicit algorithm based on 30-degree, 50-degree and 70-degree extrapolation filters and a velocity that is 110 percent of the medium velocity. Again, for comparison, desired migration using the phase-shift method with the medium velocity and 110 percent of the medium velocity are also shown in the same figure.
FIG. 4.4-27. Tests for velocity errors in frequency-space explicit migration: (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s velocity, (b) desired migration using the phase-shift method, and (c) phase-shift migration using 10 percent lower velocity; migrations using 10 percent lower velocity and frequency-space explucit schemes with (d) 30-degree, (e) 50-degree, and (f) 70-degree accuracy.
FIG. 4.4-28. Tests for velocity errors in frequency-space explicit migration: (a) A zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration using the phase-shift method, and (c) phase-shift migration using 10 percent higher velocity; migrations using 10 percent higher velocity and frequeney-space explicit schemes with (d) 30-degree, (e) 50-degree, and (f) 70-degree accuracy.

a a aaa = = === = = === = = === = = === b

Migration with an erroneously high velocity yields the overmigrated form of the diffaction hyperbola as seen in Figure 4.4-26c. 4.4-26:
We make the following observations from Figure
(a) The dip-limited explicit schemes, much like the implicit schemes (Figure 4.4-13), cause less overnigration compared to the phase-shift method with 90-degree accuracy.
(b) The low-dip explicit scheme manifests the effect of overmigration much less than the steep-dip explicit scheme.
(c) The wavenumber filtering effect (Figure 4.4-20) further truncates the steep limbs of the overmigrated hyperbola.
The interplay of the three factors results in the response to velocity errors by the explicit schemes as shown in Figure 4.4-26.
Tests for velocity errors are repeated for a zerooffset section that contains a set of dipping events as shown in Figures 4.4-27 and 4.4-28. For comparison, label the correct position of the event with the steepest dip from the desired migration on the results of migration with different velocities. The residual diffractions off the end of the dipping reflectors on the migrated sections from the explicit schemes have been truncated by the wavenumber filtering effect of the extrapolation filters. This filtering effect is most prominent in the case of the explicit scheme with the low-dip limit and erroneously high velocity (Figure 4.4-28d).
Field data examples for tests of velocity errors for the explicit schemes are shown in Figures 4.429, 4.430, and 4.4-31. First, note the better imaging of the salt flanks by the steep-dip explicit scheme compared to the low-dip explicit scheme (Figure 4.4-29). The undermigration effect of erroneously low velocities (Figure 4.4-30) and the overmigration effect of erroneously high velocities (Figure 4.4-31) may be compared with the results of migration using optimum velocities (Figure 4.4-29).
We shall complete this section by reviewing the performance of Kirchhoff summation, finite difference frequency-space implicit, and frequency-space explicit schemes with various dip limits. Figure 4.4-32 shows the compilation of the results of migration of a zero-offset section that contains a diffraction hyperbola. For comparison, desired migration using the phase-shift method is included in the panel. The dip-limited nature of the implicit and explicit schemes is manifested by the incomplete focusing of the energy at the apex of the diffraction hyperbola (Figures 4.4-32c,g,h). The undermigration effect caused by the dip limitation is allevi- ated by using a steep-dip explicit scheme (Figure 4.432j). A steep-dip implicit scheme, on the other hand, can actually overshoot in the opposite direction and cause overmigration (Figure 4.4-32f). The differencing approximations are manifested by the dispersive noise (Figure 4.4-32c).
Figure 4.4-33 shows the compilation of the results of migration of a zero-offset section that contains a set of dipping events. Again, for comparison, desired migration using the phase-shift method is included in the panel. The dip-limited nature of the implicit and explicit schemes is manifested by the undermigration of the steeply dipping events (Figures 4.4-33c,g,h). This effect is alleviated by using a steep-dip explicit scheme (Figure 4.4-33j). A steep-dip implicit scheme, on the other hand, can actually overshoot in the opposite direction and cause overmigration (Figure 4.4-33f). The differencing approximations are manifested by the dispersive noise accompanying the steeply dipping events (Figure 4.4-33c,d,e,f).

4.5 FREQUENCY-WAVENUMBER MIGRATION IN PRACTICE

Two different methods of migration are implemented in the frequency-wavenumber domain. The Stolt method is exact for a constant-velocity medium, while the phaseshift method is exact for a medium with vertical velocity variations. The Stolt method can be extended to the case of a medium with lateral velocity variations judged to be acceptable for time migration. The phase-shift method also can be extended to handle lateral velocity variations. One extension, phase-shiftplus-interpolation scheme, accommodates lateral variations in velocity by interpolating between the results of migration using a group of vertically-varying velocity functions. Another extension, phase-shift-pluscorrection, applies an additional extrapolation operator at each depth step to account for differences between the laterally varying velocity field and vertically varying-only velocity function used for phase-shift migration. The phase-shift method also has been extended to image turning waves associated with salt overhang structures.

Maximum Dip to Migrate

The phase-shift method of migration (Section 4.1 and Section D.7) allows vertical variations in velocity and is accurate for up to dips of 90 degrees. Figure 4.5-1 shows the impulse response of the phase-shift algorithm.
FIG. 4.4-29. From top to bottom, desired mgration as in Figure 4.2-15b and frequency-space explicit migration with 30 degree, 50-degree, and 70-degree accuracy, and using interval velocities derived from 100 percent of the rms velocities. The input CMP stack is shown in Figure 4.2-15a.
FIG, 4.4-30. From top to bottom, desired migration as in Figure 4 2-15b and tests for velocity errors in frequency-space explicit migration with 30-degree, 50-degree, and 70 -degree accuracy, and using interval velocities derived from 90 perent of rms velocities. The input CMP stack is shown in Figure 4.2-15a.
FIG. 4.4-31. From top to bottom, desired migration as in Figure 42 15 b 42 15 b 42-15b42-15 \mathrm{~b}4215 b and tests for velocity errors in frequency-space explicit migration with 30-degree, 50-degree, and 70 -degree accuracy, and using interval velocities derived from 110 percent of rms velocities. The input CMP stack is shown in Figure 4.2-15a.
FIG. 4.4-32. Summary of the results of migration of a zero-offet section that contains a diffraction hyperbola with 2500 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s velocity as in (a): (b) Kirchhoff migration; frequency-space implicit finite-difference migration with (c) 65-degree, (d) 80-degree, (e) 87-degree, and (f) 90-degree accuracy; frequency-space explicit migration with (g) 30-degree, (h) 50-degree, and (i) 70-degree accuracy; and (j) frequency-wavenumber phase-shift migration.
FIG. 4.4-33. Summary of the results of migration of a zero-offset section that contains a set of dipping events with 3500 3500 3500-3500-3500 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s velocity as in (a): (b) Kirchhoff migration; frequency-space implicit finite-difference migration with (c) 65 -degree, (d) 80-degree, (e) 87-degree, and (f) 90-degree accuracy; frequency-spece explicit migration with (g) 30-degree, (h) 50-degree, and (i) 70-degree accuracy; and (j) frequency-wavenumber phase-shft migration.
FIG. 4.5-1. Impulse response of phase-shift migration has a semicircular shape.
FIG. 4.5-2. The impulse response of the f k f k f-kf-kfk migration operator has a truncated semicircular shape when a maximum dip limit is imposed. For comparison, the desired response shape has been superimposed on the f k f k f-kf-kfk responses.
Clearly, for a constant-velocity medium, this respone is equivalent to that of the Stolt migration. The impulse response shown in Figure 4.5-1 is considered to be the desired impulse response for 2-D zero-offiset migration, and as such, responses of all migration algorithms discussed in this chapter are benchmarked against it.
As with the Kirchhoff summation method, migration with the phase-shift method can be limited to smaller dips by truncating the semicircular wavefront (Figure 4.5-2). This dip filtering capability is useful in rejecting coherent noise from the stacked section while migrating the data. If migration is constrained to suall dip values, then the steeply dipping reflectors may be filtered out unintentionally. Edge effects also are pronounced when a very narrow range of dips is passed. Note the linear streaks on the impulse response with a dip limit of 2 m s / 2 m s / 2ms//2 \mathrm{~ms} /2 ms/ trace (Figure 4.5-2).
The dip-filtering action caused by imposing a dip limit on the impulse response also is visible on the re-
b
FIG. 4.5-3. Tests for maximum dip to migrate in phaseshift migration: (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; phase-shift migrations using (c) 2 -ms/trace, (d) 4-ms/trace, (e) 8 - m s / m s / ms//\mathrm{ms} /ms/ trace, and (f) 16-ms/trace maximum dip limit.
sults shown in Figure 4.5-3. Note that steep dips greater than the specified maximum dip to migrate have been annihilated. On the field data example shown in Figure 4.5-4, severe dip filtering action of the 2 m s / t r a c e 2 m s / t r a c e 2ms//trace2 \mathrm{~ms} / \mathrm{trace}2 ms/trace maximum dip has caused smearing and eliminated virtually all of the signal contained in the section.

Stack

Maximum Dip = 2 m s / = 2 m s / =2ms//=2 \mathrm{~ms} /=2 ms/ trace

Desired Migration

FIG. 4.5-4. Tests for maxmum dip to migrate in phase-shift migration: A A A\mathbf{A}A low value for maximum dip to migrate can be hazardous. All dips of interest must be preserved during migration.

Depth Step Size

Figure 4.5-5 shows a zero-offset section that contains a set of dipping events migrated with the phase-shift method using different depth step sizes. Since the phaseshift method is based on the dispersion relation given by equation (4-13b) of the exact one-way wave equation, we do not expect undermigration. However, we see discontinuities along the reflectors at intervals equal to the depth step size, which is similar to the finite-difference results (Figure 4.4-8). As with the finite-difference algorithms, the problem occurs along the steeper dips first; therefore, the steep dips require smaller depth steps (Figure 4.5-5)
Because of the band-limited nature of seismic data, very small depth steps are not needed. From Figure 4.5-5, note that migration with a 20 m s 20 m s 20-ms20-\mathrm{ms}20ms depth step produces a section witbout spurious kinks along the reflectors; this is comparable to the desired migration using a depth step equal to the temporal sampling interval.
FIG. 4.5-5. Tests for extrapolation depth step size in phaseshift migration: (a) a zero-offet section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; phase-shift migrations using (c) 20 m s 20 m s 20-ms20-\mathrm{ms}20ms (d) 40 m n 40 m n 40-mn40-\mathrm{mn}40mn, (e) 60 m s 60 m s 60-ms60-\mathrm{ms}60ms, and (f) 80 m s 80 m s 80-ms80-\mathrm{ms}80ms depth step.
Depth step size tests on feld data are shown in Figure 4.5-6. Unlike the finite-difference results (Figure 4.4-10), the phase-shift migration with different depth step sizes produces equally adequate results in terms of the positioning of events. The only problem with large depth steps is the kinks along the steep dips. In principle, as long as there is no aliasing in the z z zzz-direction, the depth step kinks can be eliminated by a local interpolation process. In practice, as for the implicit finitedifference methods, the depth step size used in migration with the phase shift method typically is taken between the half-and full-dominant period of the wavefield 20 to 40 m s 40 m s 40ms40 \mathrm{~ms}40 ms, depending on steepness of the dips present in the section.

Velocity Errors

We now examine the response of phase-shift migration to velocity errors. Figure 4.5 7 4.5 7 4.5-74.5-74.57 shows the diffraction hyperbola and phase-shift migrations using the 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s medium velocity, and 5, 10, and 20 percent lower velocities. The lower the velocity, the more the diffraction hyperbola is undermigrated. These results are used as a benchmark to evaluate the response of the other migration algorithms discussed in this chapter. Specifically, compare Figure 4.5-7 with Figures 4.2-10 (the case of Kirchhoff migration), 4.3-10 (the case of implicit finite-difference migration), 4.4-12 (the case of implicit frequency-space migration), and 4.4-25 (the case of explicit frequency-space migration), note how the various algorithms respond to velocity errors with significant differences.
Figure 4.5-8 shows the same diffraction hyperbola and phase-shift migrations using the 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s medium velocity, and 5, 10, and 20 percent higher velocities. The higher the velocity, the more the diffraction hyperbola is overmigrated. These results are used to benchmark the response to velocity errors by the other migration algorithms Figures 4.2-1I (the case of Kirch hoff migration), 4.3-11 (the case of implicit finite-difference migration), 4.4-13 (the case of implicit frequency-space migration), and 4.4-26 (the case of explicit frequencyspace migration).
The under- and overmigration effects caused by the use of erroneously low or high velocities on the dipping events model are seen in Figures 4.5-9 and 4.510 , respectively. Label the correct position of the event with the steepest dip from the desired migration on the results of migrations with different velocities, and note the event mispositioning caused by erroneously low and high velocities. Recall that sensitivity of migration to velocity errors can be measured quantitatively via equations 41 and 4-2. The test results shown in Figures 4.5-9 and 4.5-10 are used to benchmark the response to velocity errors by the other migration algorithms Figures 4.2-12 and 4.2-13 (the cases of Kirchhoff migration), 4.3-12 and 4.3-13 (the ceses of implicit
Stack

=>\Rightarrow Depth Step = 20 m s = 20 m s =20ms=20 \mathrm{~ms}=20 ms

Desired Migration

FIG. 4.5-6. Tests for extrapolation depth step size in phase-shift migration. Note the kinks along steep dips with large depth steps.
finite-difference migration), 4.4-14 and 4.4-15 (the cases of implicit frequency-space migration), and 4.4-27 and 4.4-28 (the cases of explicit frequency-space migration).
An aspect of phase-shift migration uniquely different from others is its exceptional quality of output. As noted from Figures 4.5-7, 4.5-8, 4.5-9, and 4.5-10, phase-shift migration produces no dispersive noise since it does not involve any differencing of differential operators. Instead, the entire design of extrapolation operator and application of migration are in the frquencywavenumber domain. The results do not stuffer from any dip limitation since the phase-shift method is based on an extrapolation filter that is exact for all dips up to 90 degrees (Figure 4.5-1). Of course, we must also remind ourselves of the fact that the phase shift method is limited to velocities that vary only in the vertical direction.
Figtures 4.5-11 and 4.5-12 are field data examples of phase-shift migration using erroneously low and high velocities, respectively. Figure 4.5-13 shows a sketch of the combined results of these migrations. Clearly, velocities that are too low cause undermigration of the steeply dipping event that defines the flank of the salt diapir and incomplete collapse of the diffraction off the tip of the salt diapir. Velocities that are too high cause overmigration as manifested by the crossing events at the vicinity of the crest of the salt diapir.
FIG. 4.5-7. Tests for velocity errors in phase-shift migration: (a) a zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration; phase-shuft mugration using (c) the medium velocity of 2500 r n / s r n / s rn//s\mathrm{rn} / \mathrm{s}rn/s, (d) 5 percent lower, (e) 10 percent lower, and (f) 20 percent lower velocity.
Figure 4.5-14 shows the results of phase-shift migration of the stacked section in Figure 4.2-15 using velocities lower than what may be optimum for imasing. The under-migration of the left flank of the salt, dome is not so evident. However, the steeply dipping reflection of the right flank intersects the gently dipping reflections associated with the surrounding strata an indication of undermigration.
FIG. 4.5-8. Tests for velocity errors in phase-shift migration: (a) a zero-offset section that contans a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration; phase-shift migration using (c) the medum velocity of 2500 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s, (d) 5 percent higher, (e) 10 percent higher, and (f) 20 percent higher velocity
Figure 4.5-15 shows results of phase-shift migration of the stacked section in Figure 4.2-15 using velocities higher than what may be optimum for imaging. Migration with erroneously high velocities (110 and 120 percent of optimum velocities) shows signs of overmigration in the form of crossing events along the left flank of the salt diapir.
d
FIG. 4.5-9. Tests for velocity errors in phase-shift migration: (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; phase-shift migration using (c) the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s, (d) 5 percent lower, (e) 10 percent lower, and (f) 20 percent lower velocity. s
FIG. 4.5-10. Tests for velocity errors in phase-shift migration: (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration; phase-shift migration using (c) the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s, (d) 5 percent higher, (e) 10 percent higher, and (f) 20 percent higher velocity.
FIG. 4.5-11. Teats for velocity errors in phase-shift migration using interval velocities derived from (a) 95 percent, (b) 90 percent, and (c) 80 percent of rms velocities. The input stacked section is shown in Figure 4.3-2a, and the desired migration using the phase-shift method is shown in Figure 4.3-2b.
FIG. 4.5-12. Tests for velocity errors in phase-shift migration using interval velocities derived from (a) 105 percent, (b) 110 percent, and (c) 120 percent of rms velocities. The input stacked section is shown in Figure 4.3-2a, and the desired migration using the phase-shift method is shown in Figure 4.3-2b.
FIG. 4.5-13. The combined results of migrations from Figures 4.5-11 and 4.5-12. B = B = B=B=B= dipping event before and A = A = A=A=A= dipping event after desired migration; D = D = D=D=D= diffraction, and L = L = L=L=L= percent lower velocities and H = H = H=H=H= percent higher velocities.

Stolt Stretch Factor

As discussed in Section 4.1, the generalized Stolt method of migration involves converting the time section to an approximately constant-velocity section, which then is migrated by the constant-velocity Stolt algorithm. This conversion is essentially stretching in the vertical (time) direction. Once the section is migrated in the stretched domain, it is converted back to the original time domain. The generalized Stolt method must be distinguished from the constant-velocity algorithm. The constant-velocity algorithm is accurate for dips up to 90 degrees for a constant-velocity medium. The generalized method approximately accounts for velocity variations by stretching the section.
Stretching is defined by the stretch factor W W WWW. In his original paper, Stolt (1978) discusses implementation of the W W WWW factor. Although W W WWW is a complicated function of velocity and stretch coordinate variables, it often is set to a scalar (Section D.7). The theoretical range of W W WWW is between 0 and 2 .
To understand the effects of the stretch factor, refer to the impulse responses in Figure 4.5-16, where a single, isolated wavelet on a single trace is migrated using various stretch factors. Here, W = 1 W = 1 W=1W=1W=1 corresponds to the exact constant-velocity Stolt algorithm. So, setting W < 1 W < 1 W < 1W<1W<1 compresses the impulse response inward along its steep flanks, while setting W > 1 W > 1 W > 1W>1W>1 opens it up. Thus, the value of W W WWW partially controls the aperture of the generalized Stolt algorithm. The farther W W WWW is from 1 , the more limited the aperture becomes. A value of W < 1 W < 1 W < 1W<1W<1 implies undermigration at steeper dips, while a value of W > 1 W > 1 W > 1W>1W>1 implies overmigration at steeper dips, if the medium velocity is constant.
Although not strictly implied by the impulse responses in Figure 4.5-16, when using a stretch factor different from 1, the Stolt algorithm tries to emulate a wavefront in a variable velocity medium (Stolt, 1978), while compromising on the ability to migrate steeper dips. Experience has proven that the Stolt migration with stretch produces acceptable results provided velocity variations are within limits of time migration.
Consider the zero-offet section and the migration results in Figure 4,5-17. Stretch factor W = 1 W = 1 W=1W=1W=1 produces the best migrated section because the zero-offset section was modeled using a constant-velocity value. For 0 < W < 1 0 < W < 1 0 < W < 10<\boldsymbol{W}<\boldsymbol{1}0<W<1, the algorithm produces an undermigrated section, while for 1 < W < 2 1 < W < 2 1 < W < 21<W<21<W<2, it produces an overmigrated section. These observations are in agreement with the impulse responses in Figure 4.5-16. The nearvertical streaks in the section with W = 1.95 W = 1.95 W=1.95W=1.95W=1.95 represent wraparound artifacts.
The generalized Stolt algorithm produces the best result when W = 1 W = 1 W=1W=1W=1, provided the medium velocity is constant. Since this is never the case, we should examine the algorithm for a vertically varying velocity medium. Figure 4.5-18 shows the impulse responses for different values of W W WWW. Velocity varies linearly from t = 0 t = 0 t=0t=0t=0 to t = 4 s t = 4 s t=4st=4 \mathrm{~s}t=4 s between 2000 and 4000 m / s 4000 m / s 4000m//s4000 \mathrm{~m} / \mathrm{s}4000 m/s. For different W W WWW values, the portions of the wavefronts that best match the desired migration using the phase-shift method are between the solid lines. For a vertically varying velocity medium, W = 1 W = 1 W=1W=1W=1 is no longer the desired factor. In Figure 4.5-18, accuracy over the widest range of dip angles with the Stolt method is attained when W = 0.6 W = 0.6 W=0.6W=0.6W=0.6. In general, the larger the velocity gradient, the farther the optimum W W WWW is from 1 . Strictly speaking, the optimum value for W W WWW is even different at different times.
In practice, wavefront plots, like those in Figure 4.5-18, can be generated using both the phase-shift and Stolt methods for a vertically varying regional velocity function. The W W WWW factor that yields the best fit at the largest angular aperture is used then to migrate the data with the Stolt method.
FIG. 4.5-14. Tests for velocity errors in phase-shift migration using interval velocities derived from 100 , 95 , 90 100 , 95 , 90 100,95,90100,95,90100,95,90, and 80 percent of r m s r m s rms\mathrm{rms}rms velocities (from top to bottom). The input stacked section is shown in Figure 4.2-15a, and the desired migration using the phase-shift method is shown in Figure 4.2-15b.
FIG. 4.5-15. Tests for velocity errors in phase-shit migration using interval velocities derived from 100, 105, 110, and 120 percent of rms velocities (from top to bottom). The input stacked section is shown in Figure 4,2-15a, and the desired migration using the phase-shift method is shown in Figure 42 15 b 42 15 b 42-15b42-15 \mathrm{~b}4215 b.
FIG. 4.5-16. Tests for the stretch factor in Stolt migration: By varying the stretch factor W W WWW, the impulse response of the exact 90-degree migration operator (semicircle) is modified. For comparison, the desired response has been superimposed on the Stolt migration impulse responses.
To circumvent the difficulty of defining an optimum stretch factor W W WWW, Beasley and Lynn (1992) suggested applying the coustant-velocity Stolt migration in a cascaded manner. The idea is based on a clever representation of a vertically varying velocity function by a set of constant velocities, which are then used to perform cascaded migration (Section 4.3). Since each migration stage is done by using a constant velocity, the stretch factor W W WWW is by default set to 1 . Of course, representation of a vertically varying velocity function by a set of constant velocities is only an approximation that can be valid for small vertical gradients.
Figures 4.5-19 and 4.5-20 show Stolt migrations of the CMP stack in Figure 4.3-2a using different values of the W W WWW factor. Migration velocities are varied only in the vertical direction. Figure 4.5-21 is a sketch of the migration results for the diffaction D D DDD off the tip of the salt diapir and steeply dipping event B B BBB off the flank of the salt diapir. The best match between the desired migration and the Stolt method with stretch is for W = 0.5 W = 0.5 W=0.5W=0.5W=0.5.

Wraparound

Wraparound is the effect of finite data length in time and space on a migration algorithm implemented in the Fourier transform domain. A migration algorithm implemented in the time-space domain does not suffer from wraparound effect. But a migration algorithm implemented in the frequency-space domain suffers from wraparound along the time axis. Similarly, a migration algorithm implemented in the frequency-wavenumber domain suffers from wraparound effects both along the time and space axes.
Figure 4.5-22 shows a zero-offset section that contains a diffraction hyperbola and its migration using frequency-wavenumber migration based on the phaseshift method. When plotted with a very high display gain, we observe the energy in the migrated section bouncing off the edges of the section both in the time and space directions.
A field data example of the wraparound effect on frequency-wavenumber migration is shown in Figure 4.5-23. This is the same section as in Figure 4.2-15b, except that it has been displayed using a very high gain. The energy above the water bottom is associated with the wraparound effect in the time and space directions. The wraparound noise actually exists within the image portion of the section, also. A way to reduce the wraparound effect is to pad the data with zeros along the axis of Fourier transformation. For frequency-space migration, data must be padded along the time axis; and for frequency-wavenumber migration, data must be padded along both the time and space axes.
A field data example of the wraparound effect on frequency-space migration is shown in Figure 4.5-24. This is the same section as in Figure 4.4-11d, exoept that it has been displayed using a very high gain. The energy above the water bottom is associated with the wraparound effect in the time direction.

Residual Migration

The constant-velocity Stolt algorithm has useful applications in residual migration as described here and migration velocity analysis as described in Chapter 5 . Consider a zero-offset section that contains a set of dipping events as shown in Figure 4.5-25a. The desired migration is obtained by using the medium velocity of v = 3500 m / s v = 3500 m / s v=3500m//sv=3500 \mathrm{~m} / \mathrm{s}v=3500 m/s as shown in Figure 4.5-25b. Suppose, instead, that you migrate using a velocity of 3000 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s. The resulting migrated section is shown in Figure 4.5 25 c 4.5 25 c 4.5-25c4.5-25 \mathrm{c}4.525c. Label the event with the steepest dip (AB) from the desired migration on the migrated section with v 1 = 3000 m / s v 1 = 3000 m / s v_(1)=3000m//sv_{1}=3000 \mathrm{~m} / \mathrm{s}v1=3000 m/s, and note the undermigration of the dipping events. By migrating the already migrated section using a velocity of v 2 = v 2 v 1 2 = 1802 m / s v 2 = v 2 v 1 2 = 1802 m / s v_(2)=v^(2)-v_(1)^(2)=1802m//sv_{2}=v^{2}-v_{1}^{2}=1802 \mathrm{~m} / \mathrm{s}v2=v2v12=1802 m/s (Section D.8), we get the section shown in Figure 4.5-25d. Note that this section obtained from the two-stage migration using velocities 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s and 1802 m / s 1802 m / s 1802m//s1802 \mathrm{~m} / \mathrm{s}1802 m/s is equivalent to the one-stage migration using a velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s. The second stage of the two-stage migration using a velocity of 1802 m / s 1802 m / s 1802m//s1802 \mathrm{~m} / \mathrm{s}1802 m/s is called residual migration (Rothman et al., 1985).

Constant-Velocity Zero-Offset Section

Frequency-Wavenumber Migrations

Stretch Factor = 1 = 1 =1=1=1

FIG. 4.5-17. Tests for the stretch factor in Stolt migration: W < 1 W < 1 W < 1W<1W<1 causes undermigration, and W > 1 W > 1 W > 1W>1W>1 causes overmigration. (Modeling courtesy Union Oil Company,)
So, what is the practical use of residual migration? It can improve upon the result of migration using a dip. limited finite-difference algorithm. Figure 4.5-26a shows a zero-offset section that consists of three point scatterers in a layered earth model with vertically varying velocity field. A 15-degree dip-limited finite-difference migration has difficulty collapsing these diffractions (Figure 4.5 26 b 4.5 26 b 4.5-26b4.5-26 \mathrm{~b}4.526 b ). Now, first migrate the zero-offset section with the constant-velocity Stolt algorithm using the lowest value, 2000 m / s 2000 m / s 2000m//s2000 \mathrm{~m} / \mathrm{s}2000 m/s, in the vertically varying velocity function. The result is shown in Figure 4.5-26d. Then, take this section and migrate it again (Figure 4.5-26e) using the appropriate residual velocity (Section D.8) and the 15-degree finite-difference algorithm. When compared with the single-stage finite-difference migration (Figure 4.5-26b), note the superior performance of the residual migration. Also compare this with the desired migration using the phase-shift method (Figure 4.5-26c). The important point to keep in mind is that input to residual migration (the second stage) must be data which have been migrated (first stage) using a constant velucity (Rothman et al., 1985).
A field data example is shown in Figure 4.5-27 with a sketch of the migration results in Figure 4.5-28.
W = 1 W = 1 W=1W=1W=1
W = 0.75 W = 0.75 W=0.75W=0.75W=0.75
FIG. 4.5-18. Tests for the stretch factor in Stolt migration: The medium velocity varies vertically from 2000 m / s 2000 m / s 2000m//s2000 \mathrm{~m} / \mathrm{s}2000 m/s at t = 0 t = 0 t=0t=0t=0 to 4000 m / s 4000 m / s 4000m//s4000 \mathrm{~m} / \mathrm{s}4000 m/s at t = 4 s t = 4 s t=4st=4 \mathrm{~s}t=4 s.
The single-stage 15-degree finite-difference result shows the typical undermigrated character (Figure 4.3-3). The 1500 m / s 1500 m / s 1500-m//s1500-\mathrm{m} / \mathrm{s}1500m/s constant-velocity Stolt migration followed by the finite-difference migration seems to produce an output that is reasonably close to the desired migration.
A limitation of residual migration is that an adequate migration is not always achieved since the firststage migration requires constant velocity which may be far off from the velocity field associated with the data. This is the case in Figure 4.5-27, since after residual migration, the dipping event still is slightly undermigrated (see the sketch in Figure 4.5-28). Undermigration occurs because the apparent dip perceived by the second-stage migration still may be too large to be handled accurately. From equation (D-8c) note that the lower the velocity used in migration, the smaller the dip that is perceived by migration. If the residual velocity function given by equation (D-96b) is not too different from the original velocity function because of a large vertical gradient, then residual migration may not be adequate.
Residual migration is different from cascaded migration that is discussed in Section 4.3. The latter in-
Phase-Shift Migration
2
4
住)

:
FIG. 4.5-19. Tests for the stretch factor W W WWW in Stolt migration: (a) Desired migration, (b) W = 0.001 W = 0.001 W=0.001W=0.001W=0.001, and (c) W = 0.5 W = 0.5 W=0.5W=0.5W=0.5. The input CMP stack is shown in Figure 4.3-2a
FIG. 4.4.5-20. Tests for the stretch factor W W WWW in Stolt migration: (a) W = 0.7 W = 0.7 W=0.7W=0.7W=0.7, (b) W = 1 W = 1 W=1W=1W=1, and (c) W = 1.5 W = 1.5 W=1.5W=1.5W=1.5. The input CMP stack is shown in Figure 4.3-2a and the desired migration is shown in Figure 4.5-19a.
FIG. 4.5-21. The combined results of the migrations from Figures 4.5-19 and 4.5-20. B = B = B=B=B= dipping event before and A A AAA = = === dipping event after desired rnigration, D = D = D=D=D= diffraction before and D = D = D^(')=D^{\prime}=D= diffraction after Stolt migration with stretch. Numbers represent different stretch factors W W WWW.
medium velocity. When the same exercise is repeated using a dip-limited implicit finite-difference algorithm, results are not satisfactory even with constant velocity (Figure 4.5-30). When a variable velocity is used at each stage preceding the last stage the dip-limited algorithm causes overmigration (Figure 4.3-19), while the phaseshift method with no dip limit yields accurate result (Figure 4.3-20).
Despite the limitations mentioned above, residual migration is used in practice in the following mode:
(a) Perform phase-shift migration using a vertically varying velocity function v ¯ ( z ) v ¯ ( z ) bar(v)(z)\bar{v}(z)v¯(z), which is obtained by averaging the spatially varying velocity field v ( x , z ) v ( x , z ) v(x,z)v(x, z)v(x,z) and modifying it to meet the requirement that v ¯ ( z ) < v ( x , z ) v ¯ ( z ) < v ( x , z ) bar(v)(z) < v(x,z)\bar{v}(z)<v(x, z)v¯(z)<v(x,z).
(b) Follow with a residual migration using a diplimited implicit or explicit frequency-space finitedifference migration with a residual velocity field equal to v 2 ( x , z ) v ¯ 2 ( z ) v 2 ( x , z ) v ¯ 2 ( z ) sqrt(v^(2)(x,z)- bar(v)^(2)(z))\sqrt{v^{2}(x, z)-\bar{v}^{2}(z)}v2(x,z)v¯2(z) (Section D.8).
FIG, 4.5-22. Wraparound effect in frequency-wavenumber migration: (a) a zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, (b) desired migration using the phase-shift method, and (c) the same as in (b) but with a display gain that is 100 times greater than that used in (b)

4.6 FURTHER ASPECTS OF MIGRATION IN PRACTICE

In this section, we shall discuss the effects of spatial a.liasing, random noise and profile length on migration, and migration from topography. Spatial aliasing is a direct result of undersampling of recorded data (Section 1.2). Because of spatial aliasing, migration can perceive events with steep dips at high frequencies as different, from the actual dips in m s m s ms\mathrm{ms}ms /trace. As a result, migration mispositions the aliased frequency components of the dipping events.
Random noise usually is more prominent in the deep part of a stacked section, just where velocities also
FIG. 4.5-23. Wraparound effect in frequency-wavenumber migration: The input stacked section is shown in Figure 4.2-15a and the desared migration using the phase-shift method is shown in Figure 4.2-15b.
FIG. 4.5-24. Wraparound effect in frequency-space migration: The input stacked section is shown in Figure 4.2-15a and the desired migration using the phase-shift method is shown in Figure 4.2-15b.
(a)
2 2 2-2-2
(b)
2 .
(c)
(d)
FIG. 4.5-25. Principle of residual migration: (a) a zerooffset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration using the phase-shift method with the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s, (c) first-pass mjgration of (a) using constant-velocity Stolt migration with 3000 m / s 3000 m / s 3000-m//s3000-\mathrm{m} / \mathrm{s}3000m/s velocity, and (d) second-pass migration of the output from the first-pass migration as in (c) using a 15-degree finite-difference migration with the residual velocity of 1802 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s (equation D-96b).
are generally higher. This results in random noise organized along wavefront arches, commonly referred to as smiles. This organized noise corrupts the migrated primary energy not just in the deep part of the section but also has detrimental effect on shallow data in a migrated section.
Line length and Jocation of the line traverse at the surface relative to the location of the target in the subsurface have a direct effect on the useability of the a migrated section. Usually a line traverse longer than the spatial extent of the subusrface target is needed (Figure 4.1-1). Keep in mind that your target does not necessarily lie directly beneath the CMP location where the reflection from that target appears on your unmigrated stacked section.
Irregular topography associated with areas subjected to overthurst tectonics has to be accounted for during migration if surface elevation changes ase rapid along the line traverse. Migration algorithms, with the exception of the Kirchhoff summation and the constantvelocity Stolt method, are all based on wave extrapolation from one flat depth level to another. A CMPstacked section is assumed to be equivalent to a zerooffset wavefield and usually is referenced to a flat datum. In the presence of severe topography, one needs to account for the difference between the elevation profile and the reference datum. Otherwise, if the reference datum is above the surface elevation, to a migration algorithm, events appear deeper than they are, and thus are overmigrated. If, on the other hand, the reference datum is below the surface elevation, events appear to a migration algorithm shallower than they actually are, and thus are undermigrated.

Migration and Spatial Aliasing

The concept of spatial aliasing is presented in Section 1.2. Here, we shall examine the effect of spatial aliasing on migration. Figure 4.6-1 shows a zero-offset section that contains a diffraction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity and 12.5 m 12.5 m 12.5-m12.5-\mathrm{m}12.5m trace spacing. By discarding every other trace, obtain another zero-offset section with 25 m trace spacing. Repeat the procedure to obtain the zero-offset sections with 50 m 50 m 50-m50-\mathrm{m}50m and 100 m 100 m 100-m100-\mathrm{m}100m trace spacings (Figure 4.6-1).
The f k f k f-kf-kfk spectra of the zero-offset sections with the four different trace spacings are displayed in Figure 4.6-2. The diffraction hyperbola with 12.5 m 12.5 m 12.5-m12.5-\mathrm{m}12.5m trace spacing maps onto an inverted triangular area in the f k f k f-kf-kfk plane (Section 4.1). The Nyquist wavenumber is 40 c y c l e s / k m 40 c y c l e s / k m 40cycles//km40 \mathrm{cycles} / \mathrm{km}40cycles/km and the bandwidth is given by the corner frequencies 6 , 12 36 , 48 H z 6 , 12 36 , 48 H z 6,12-36,48Hz6,12-36,48 \mathrm{~Hz}6,1236,48 Hz for the passband region of the spectrum. (See Figure 1.1-26 for the definition of corner frequencies.) The red is associated with the flat part of the passband region and the blue is associated with the taper zone.
The f k f k f-kf-kfk spectrum of the zero-offset section with 25-m trace spacing (Figure 4.6-1) indicates spotial aliasing beyond approximately 24 H z 24 H z 24Hz24 \mathrm{~Hz}24 Hz (Figure 4.6-2). Consequently, the triangular shape of the passband region in the f k f k f-kf-kfk plane that defines the diffraction hyperbola is corrupted around the edges near the Nyquist wavenumber of 20 c y c l e s / k m 20 c y c l e s / k m 20cycles//km20 \mathrm{cycles} / \mathrm{km}20cycles/km. At a coarser trace spacing of 50 m 50 m 50m50 \mathrm{~m}50 m, which corresponds to a Nyquist wavenumber of 10 c y c l e s / k m 10 c y c l e s / k m 10cycles//km10 \mathrm{cycles} / \mathrm{km}10cycles/km, the triangular shape in the spectrum is preserved below the threshold frequency for aliasing,
FIG. 4.5-26. Principle of residual migration: (a) a zero-offset section with verticelly varying velocities, (b) 15-degree finitedifference migration, (c) desired migration using the phase-shift method, (d) first-pass migration of (a) using constant-velocity Stolt migration with 2000 m / s 2000 m / s 2000-m//s2000-\mathrm{m} / \mathrm{s}2000m/s velocity, and (e) second-pass migration of the output from the first-pass migration as in (d) using a 15-degree finite-difference migration with the residual velocity function computed by equation (D-96b).
approximately I 2 H z I 2 H z I2Hz\mathrm{I} 2 \mathrm{~Hz}I2 Hz, only. Finally, at trace spacing of 100 m 100 m 100m100 \mathrm{~m}100 m, which correpsonds to a Nyquist wavenumber of 5 cycles / k m / k m //km/ \mathrm{km}/km, the triangular shape is obliterated, completely (Figure 4,6-2).
Figure 4.6-3 shows the results of Kirchhoff migration of the zero-offset sections in Figure 4.6-1. Frequency components that are spatially aliased are perceived by migration with a dip different from the actual dip along the diffraction hyperbola. Normally, energy is moved in the up-dip direction along the diffraction hyperbola and is mapped onto the apex. However, in each migrated section, the spatially aliased part of the energy is split away from the flanks of the diffraction hyperbola and mapped onto the regions to the left and right of the flanks. The aliased energy is dispersed. Since each frequency component of the aliased energy is perceived to have a different dip by migration, the displacement of the energy after migration is frequency dependent. The unaliased portion of the energy is of course mapped onto the apex. The more frequency components are spatially aliased, the less energy at lower frequencies is mapped onto the apex.
As discussed in Section 4.1, the triangular area on the f k f k f-kf-kfk plane associated with the diffaction hyperbola (Figure 4.6-2) is mapped onto the circular area on the f k f k f-kf-kfk plane associated with the migrated section (Figure 4.6-4). Ideally the area in the f k f k f-kf-kfk plane of the migrated section should be semicircular in shape. Because the diffraction hyperbola is defined within a finite spatial aperture (Figure 4.6-1), there is an inplicitly imposed dip limit on migration. As a result, the semicircular area is notched on either side (Figure 4.6-4).
Spatial aliasing corrupts the semicircular shape of the f k f k f-kf-kfk spectrum on both ends of the spectrum at the vicinity of the Nyquist wavenumber. In case of severe
FIG. 4.5-27. Residual migration applied to field data: first pass using constant-velocity Stolt migration ( 1500 m / s 1500 m / s 1500m//s1500 \mathrm{~m} / \mathrm{s}1500 m/s ), and second pass using a 15-degree finite-difference migration of the result from the first pass.
FIG. 4.5-28. The combined migration results from Figure 4.5-27, B = B = B=B=B= dipping event before and A = A = A=A=A= dipping event after desired migration; D = D = D=D=D= diffraction; A 1 , D 1 = A 1 , D 1 = A1,D1=A 1, D 1=A1,D1= after the first pass; A 2 , D 2 = A 2 , D 2 = A2,D2=A 2, D 2=A2,D2= after the second pass.
undersampling, spatially aliased frequency components invade much of the f k f k f-kf-kfk plane as shown in Figure 4.6-4.
Aside from the spatial aliasing noise, dispersive noise also is seen on data migrated with a dip-limited finite-difference algorithm (Section 4.3). Figure 4.6-5 shows migration of a zero-offset section that contains a diffraction hyperbola using the 15-degree implicit finite-difference method. Note the undermigration of the diffraction hyperbola that is caused by the 15-degree dip limitation, the dispersive noise A A AAA that is caused by the finite-difference approximations, and the spatially aliased energy B B BBB that splits away from the unaliased part that collapses to the apex.
Figure 4.6-6 shows the results of migration of the zero-offset sections in Figure 4.6-1 using an 'implicit frequency-space finite-difference scheme (Section 4.4). Note the dispersive noise caused by the finite-difference approximations in the section with 12.5 m 12.5 m 12.5-m12.5-\mathrm{m}12.5m trace spacing. The dispersive noise in the sections with 25 m 25 m 25-m25-\mathrm{m}25m, 50 m 50 m 50-m50-\mathrm{m}50m, and 100 m 100 m 100m100 \mathrm{~m}100 m trace spacings, however, is attributed largely to spatial aliasing.
It is instructive to note that the diffaction energy a.ppears slightly undermigrated with 12.5 -m trace spacing, but is overmigrated with 25 m 25 m 25-m25-\mathrm{m}25m and 50 m 50 m 50-m50-\mathrm{m}50m trace spacings. As discussed in Sections 4.3 and 4.4, the fidelity of migration by finite-difference schemes is dictated by an intricately complex interplay between the various parameters spatial and temporal sampling intervals, dip, frequency, and velocity. Depending on the values of these parameters, one scheme may cause undermigration in one case and overmigration in another case.
Figure 4.6-7 shows the f k f k f-kf-kfk spectra of the migrated sections in Figure 4.6-6. Note that implicit frequencyspace migration can create high-frequency noise beyond the passband of the input data. Note also that spatial aliasing combined with the inherent dispersive effect of finite-difference schemes corrupt the semicircular shape of the f k f k f-kf-kfk spectrum on both ends of the spectrum.
Figure 4.6-8 shows the results of the migration of the zero-offset sections in Figure 4.6-1 using an explicit frequency-space finite-difference scheme (Section 4,4). There appears to be no aliasing noise in either sections with 12.5 m 12.5 m 12.5-m12.5-\mathrm{m}12.5m and 25 m 25 m 25-m25-\mathrm{m}25m trace spacings. Also note that, compared to the results of Kirchhof migration (Figure 4.6-2), there is less aliasing noise in the sections with 50 m m m\mathrm{m}m and 100 m 100 m 100-m100-\mathrm{m}100m trace spacings. These observations can be verified by referring to the f k f k f-kf-kfk spectra shown in Figure 4.6-9. Explicit schemes, by the design criterion, attenuate energy associated with wavenumbers k x k x k_(x)k_{x}kx above a specified cutoff wavenumber defined by a fraction of the Nyquist wavenumber. This effectively removes part of the aliased energy that maps onto the spectral region above the cutoff wavenumber associated with the extrapolation filter for the explicit scheme. Note from the f k f k f-kf-kfk spectrum in Figure 4.6-9 that almost all of the aliased energy has been filtered out for the case of the 25 m 25 m 25-m25-\mathrm{m}25m trace spacing. This is why aliasing noise is absent in the corresponding migrated section in Figure 4.6-8. Despite the wavenumber filtering effect of the explicit scheme, however, much of the aliased noise remains in the sections with the 50 m 50 m 50-m50-\mathrm{m}50m and 100 m 100 m 100-m100-\mathrm{m}100m trace spacings.
Figure 4.6-10 shows the results of phase-shift migration of the zero-offset sections in Figure 4.6-1, and Figure 4.6-11 shows the corresponding f k f k f-kf-kfk spectra. These results are used as a benchmark to evaluate the results obtained from the other migration algorithms (Figures 4.6-3 through 4.6-9). Except for the aliasing noise, phase-shift migration produces no artifacts.
The experiments described above clearly demonstrate that all migration algorithms suffer from saptial aliasing. We now examine the effect of spatial aliasing on migration using a dipping events model. Figure 4.6-12 shows a zero-offset section that contains a set of dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity and 25 m 25 m 25-m25-\mathrm{m}25m trace
FIG. 4.5-29. Multiple passes of residual migration. (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-m / s3500m/s velocity, (b) desired migration using the phase-shift method with the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s, (c) first-pass migration of the zero-offet section in (a) using the phase-shift method with a constant velocity of 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s, (d) second-pass migration of the output from the first-pass migration as in (c) using the phase-shift method with a constant residual velocity of 1145 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s, (e) third-pass migration of the output from the second-pass migration as in (d) using the phase-shift method with a constant residual velocity of 1198 m / s 1198 m / s 1198m//s1198 \mathrm{~m} / \mathrm{s}1198 m/s, (f) fourth-pass migration of the output from the third-pass migration as in (e) using the phase-shift method with a constant residual velocity of 1250 m / s 1250 m / s 1250m//s1250 \mathrm{~m} / \mathrm{s}1250 m/s, and (g) fifth-pass migration of the output from the fourth-pass migration as in (f) using the phase-shift method with a constant residual velocity of 1299 m / s 1299 m / s 1299m//s1299 \mathrm{~m} / \mathrm{s}1299 m/s
FIG. 4.5-30. Multjple passes of residual migration: (a) a zero-offset section that contains dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, (b) desired migration using the phase-shift method with the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s, (c) first-pass migration of the zero-ofiset section in (a) using the 65-degree implicit method with a constant velocity of 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s, (d) second-pass migration of the output from the first-pass migration as in (c) using the 65-degree implicit method with a constant residual velocity of 1145 m / s 1145 m / s 1145m//s1145 \mathrm{~m} / \mathrm{s}1145 m/s, (e) third-pass migration of the output from the second-pass migration as in (d) using the 65-degree implicit method with a constant residual velocity of 1198 m / s 1198 m / s 1198m//s1198 \mathrm{~m} / \mathrm{s}1198 m/s, (f) fourth-pass migration of the output from the third-pass migration as in (e) using the 65-degree implicit method with a constant residual velocity of 1250 m / s 1250 m / s 1250m//s1250 \mathrm{~m} / \mathrm{s}1250 m/s, and (g) fifth-pass migration of the output from the fourth-pass migration as in (f) using the 65-degree implicit method with a constant residual velocity of 1299 m / s 1299 m / s 1299m//s1299 \mathrm{~m} / \mathrm{s}1299 m/s
FIG. 4,6-1. Zero-offset sections, which contain a diffaction hyperbola with 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s velocity, with trace spacings, from top to bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-2. The f k f k f-kf-kfk spectra of the zero-offet sections in Figure 4.6-1 with trace spacings, from top to bottom. 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
2
FIG. 4.6-3. Kirchhofl migrations of the zero-offset sections in Figure 4.6-1 with trace spacings, from top to bottom, 12.5 m 12.5 m 12.5m12.5 \mathrm{~m}12.5 m, 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-4. The f k f k f-kf-kfk spectra of the outputs from the Kirchhof migrations in Figure 4.6-3 with trace spacings, from bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-5. 15-degree finite-difference migrations of the zero-offsot sections in Figure 4.6-1 with trace spacings, from top to bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-6. 65-degree implicit freguency-space migrations of the vero-offest sections in Figure 4.6-1 with top to bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-7. The f k f k f-kf-kfk spectra of the outputs from the 65 -degree implicit frequency-space migrations in Figure 4.6 6 4.6 6 4.6-64.6-64.66 with trace spacings, from top to bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
S
2
FIG. 4.6-8. 70-degree explicit frequency-space migrations of the zero-offset sections in Figure 4.6-1 with th top to bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-9. The f k f k f-kf-kfk spectra of the outputs from the steep-dip explicit frequency-space migrations in Figure 4.6 8 4.6 8 4.6-84.6-84.68 with trace spacings, from top to bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-10. Phase-shift migrations of the zero-offset sections in Figure 4.6-1 with trace spacings, fro 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
Migration
FIG. 4.6-11. The f k f k f-kf-kfk spectra of the outputs from the phase-shift migrations in Figure 4.6-10 with trace spacin top to bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-12. Zero-offset sections, which contain dipping events with 3500 m / s 3500 m / s 3500-m//s3500-\mathrm{m} / \mathrm{s}3500m/s velocity, with trace spacings, f f fff bottom, 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-13. The f k f k f-kf-kfk spectra of the zero-offset sections in Figure 4.6-12 with trace spacings, from top to bottom, 25 m 25 m 25m25 \mathrm{~m}25 m, 50 m 50 m 50m50 \mathrm{~m}50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
s
1
2
FIG. 4.6-14. Kirchhoff migrations of the zero-offset sections in Figure 4.6-12 with trace spacings, from top to bc 50 m 50 m 50m50 \mathrm{~m}50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-15. The f k f k f-kf-kfk spectra of the outputs from the Kirchhoff migrations in Figure 4.6-14 with trace spacings, from top to bottom, 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
Trace Spacing = 25 m = 25 m =25m=25 \mathrm{~m}=25 m
FIG. 4.6-16. 15-degree finite-difference migrations of the zero-offset sections in Figure 4.6-12 with t t ttt to bottom, 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-17. 65-degree implicit frequency-space migrations of the zero-offset sections in Figure 4.6-12 with truce sprcings, from top to bottom, 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-18. The f k f k f-kf-kfk spectra of the outputs from the 65 -degree implicit frequency-space migrations in Figure 4.6 17 w 4.6 17 w 4.6-17w4.6-17 \mathrm{w}4.617w trace spacings, from top to bottom, 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
s
2
FIG. 4.6-19. 70-degree explicit frequency-space migrations of the zero-offset sections in Figure 4.6-12 with trace spacings, from top to bottom, 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-20. The f k f k f-kf-kfk spectra of the outputs from the steep-dip explicit frequency-space migrations in Figure 4.6-19 w trace spacings, from top to bottom, 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-21. Phase-shift migrations of the zero-offet sections in Figure 4.6-12 with trace spacings, from top to bottom, 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-22. The f k f k f-kf-kfk spectra of the outputs from the phase-shift migrations in Figure 4.6-21 with trace spacings, frr top to bottom, 25 m , 50 m 25 m , 50 m 25m,50m25 \mathrm{~m}, 50 \mathrm{~m}25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
spacing. By discarding every other trace, obtain another zero-offset section with 50 m 50 m 50m50 \mathrm{~m}50 m trace spacing. Repeat the procedure to obtain the zero-offset section with 100-m trace spacing (Figure 4.6-12).
The f k f k f-kf-kfk spectra of the zero-offset sections with the three different trace spacings are displayed in Figure 4.6-13. The dipping events with 25 m 25 m 25-m25-\mathrm{m}25m trace spacing map onto a series of radial lines in the f k f k f-kf-kfk plane (Section 4.1). The Nyquist wavenumber is 20 cycles / k m / k m //km/ \mathrm{km}/km and the bandwidth is given by the corner frequencies 6 , 12 36 6 , 12 36 6,12-366,12-366,1236, 48 H z 48 H z 48Hz48 \mathrm{H} z48Hz for the passband region of the spectrum. As for the diffraction hyperbola model (Figure 4.6-3), the red is associated with the flat part of the passband region and the blue is associated with the taper zone.
The f k f k f-kf-kfk spectrum of the zero-offset section with 50 m 50 m 50-m50-\mathrm{m}50m trace spacing (Figure 4.6-12), which corresponds to a Nyquist wavenumber of 10 c y c l e s / k m 10 c y c l e s / k m 10cycles//km10 \mathrm{cycles} / \mathrm{km}10cycles/km, indicates spatial aliasing beyond approximately 24 H z 24 H z 24Hz24 \mathrm{~Hz}24 Hz (Figure 4.6-13). Consequently, the aliased segments of the radial lines map onto the left quadrant of the f k f k f-kf-kfk spectrum. At a coarser trace spacing of 100 m 100 m 100m100 \mathrm{~m}100 m, which corresponds to a Nyquist wavenumber of 5 c y c l e s / k m 5 c y c l e s / k m 5cycles//km5 \mathrm{cycles} / \mathrm{km}5cycles/km, spatial aliasing occurs first at approximately 12 H z 12 H z 12Hz12 \mathrm{~Hz}12 Hz. Then, some of the encrgy alrcady aliased becomes aliased for the second time at approximately 36 H z 36 H z 36Hz36 \mathrm{~Hz}36 Hz. Moreover, part of the aliased energy is remapped onto the right quadrant (Figure 4.6-13).
Figure 4.6-14 shows the results of Kirchhoff migration of the zero-offset sections in Figure 4.6-12. No aliasing noise is present on the migrated section with 25 m 25 m 25-m25-\mathrm{m}25m trace spacing. Next, consider the migrated section with 50 m 50 m 50-m50-\mathrm{m}50m trace spacing. Frequency components that are spatially aliased are perceived by migration to dip in the direction opposite to the actual dips of the events. Normally, energy is moved in the up-dip dircetion, in this case from right to left as seen in the migrated section with 25 m 25 m 25-m25-\mathrm{m}25m trace spacing. However, in the migrated section with 50 m 50 m 50-m50-\mathrm{m}50m trace spacing, the spatially aliased part of the energy is split away from the dipping events and moved from left to right. Note that the aliased energy is dispersed. As for the diffraction hyperbola model (Figure 4.6-2), each frequency component of the aliased energy is perceived to have a different dip by migration, the displacement of the energy after migration is frequency dependent. The unaliased portion of the energy is of course moved from right to left and positioned accurately. The more frequency components are spatially aliased, the less energy at lower frequencies is mapped to the correct position.
Finally, consider the case of the migrated section with 100 m 100 m 100-m100-\mathrm{m}100m trace spacing (Figure 4.6-14). Note that there exists aliasing noise not only to the right of the dipping events but also in the left-most portion of the section. The latter is associated with the euergy that has been aliased twice (Figure 4.6-3). Because of the complexity of aliasing, the noise essentially disperses over the whole of the section.
An interesting observation on the migrated sections in Figure 4.6-14 relates to the energy in the region above 1 s 1 s 1s1 \mathrm{~s}1 s. In Kirchhoff migration, amplitudes in the input section are summed along a hyperbolic summation path and placed at the apex of the hyperbola. Imagine a summation path whose apex is situated at a time less than 1 s. There will be some energy placed at this apex location since the flanks of the summation path under consideration will intersect through traces with nonzero sample values. This situation is encountered when migrating marine data using Kirchhoff summation. Normally, the migrated section is muted above the water bottom to remove the noisc created by migration within the water layer.
Besides data aliasing, there is also the problem of operator aliasing. In particular, for a low-velocity hyperbola or for a hyperbola with its apex situated at shallow times, Kirchhoff summation may require more than one sample per trace. This results in some energy in the form of precursors above the migrated sea-bottom reflection, when only one point per trace is included in the summation.
Figure 4.6-15 shows the f k f k f-kf-kfk spectra of the migrated sections in Fignre 4.6-14. As discussed in Section 4.1, migration rotates the radial lines on the f k f k f-kf-kfk plane associated with the dipping events.
Figure 4.6-16 shows migration of a zero-offset section that contains a set of dipping events using the 15degree implicit finite-difference method. Note the undermigration of the steeply dipping events caused by the 15-degree dip limitation, the dispersive noise A A AAA caused by the finite-difference approximations, and the spatially aliased energy B B BBB that splits away from the unaliased part, and moves in the oppasite direction.
Figure 4.6-17 shows the results of migration of the zero-offset sections in Figure 4.6-12 using an implicit frequency-space finite-difference scheme (Section 4.4). Note the dispersive noise caused by the finite-difference approxirations in the section with 25 r n 25 r n 25-rn25-\mathrm{rn}25rn trace spacing. In the sections with 50 r n 50 r n 50-rn50-\mathrm{rn}50rn and 100 m 100 m 100-m100-\mathrm{m}100m trace spacings, two sets of dispersive noise can be distinguished - one that is caused by the finite-difference approximations and the other caused by spatial aliasing. At coarse spatial sampling, the steeply dipping events are faintly detected on the migrated section.
Figure 4.6-18 shows the f k f k f-kf-kfk spectra of the migrated sections in Figure 4.6-17. As in the case of the diffraction hyperbola (Figure 4.6-7), implicit frequencyspace migration can crate high-frequency noise beyond the passband of the input data.
Figure 4.6-19 shows the results of the migration of the zero-offset sections in Figure 4.6-12 using an explicit
frequency-space finite-difference scheme (Section 4.4). There is no aliasing noise in the section with 25 m 25 m 25-m25-\mathrm{m}25m trace spacing. But there is precursive dispersion along the steeply dipping events because of the inherent nature of the explicit scheme used here. This dispersion is not as severe as that observed on the result from the implicit scheme (Figure 4.6-17).
The corresponding f k f k f-kf-kfk spectra shown in Figure 4.6-20 explains why there is less aliasing noise on the migrated sections in Figure 4.6-19 compared to those from Kirchhoff summation (Figure 4.6-14). As for the case of the diffaction hyperbola (Figure 4.6-9), explicit schemes attenuate energy associated with wavenumbers k x k x k_(x)k_{x}kx above a specified cutoff wavenumber. This effectively removes part of the aliased energy that maps onto the spectral region above the cutoff wavenumber associated with the extrapolation filter for the explicit scheme. Note from the f k f k f-kf-kfk spectrum in Figure 4.6-20 that a significant portion of the aliased energy in the left quadrant has been filtered out for the case of the 50 m 50 m 50-m50-\mathrm{m}50m trace spacing. Despite the wavenumber filtering effect of the explicit scheme, however, much of the aliased noise remains in the section with the 100 m 100 m 100-m100-\mathrm{m}100m trace spacing.
Figure 4.6-21 shows the results of the phase-shift migration of the zero-offset sections in Figure 4.6-12, and Figure 4.6-22 shows the corresponding f k f k f-kf-kfk spectra. These results are used as a benchmark to evaluate the results obtained from the other migration algorithms (Figures 4.6-14 through 4.6-20). Except for the aliasing noise, phase-shift migration produces no artifacts.
The effect of spatial aliasing on migration of field data, to begin with, is demonstrated in Figures 4.6-23 and 4.6-24. We see the original stacked section and its resampled versions at coarser trace spacings. From the migrations of these four stacked sections with coarser trace spacings, note the loss of spatial resolution. The nearly flat events are not adversely affected by spatial aliasing, while the steeply dipping reflection of the right flank of the salt diapir can only be detected on the migrated section with very coarse sampling by a lowfrequency, weak-amplitude event. The diffraction energy off the tip of the salt diapir is largely dispersed into the region with nearly flat events to the right of the diapir
We now examine the response of the various migration algorithms to spatial alaising using the data shown in Figures 4.6-25 and 4.6-26. The stacked data are associated with the same line sampled at four different trace spacings 12.5 , 25 , 50 12.5 , 25 , 50 -12.5,25,50-12.5,25,5012.5,25,50, and 100 m 100 m 100m100 \mathrm{~m}100 m. Figure 4.6-27 shows migrations of the stacked sections using Kirchhoff summation. The section with 12.5 m 12.5 m 12.5-m12.5-\mathrm{m}12.5m trace spacing provides a crisp image of the salt diapir, while the sections with coarser trace spacings degrade gradually. Specifically, it is almost impossible to delineate the salt boundary on the section with 50 m 50 m 50-m50-\mathrm{m}50m trace spacing, and the section with 100 m 100 m 100-m100-\mathrm{m}100m trace spacing does not even provide an image of the gently dipping reflections. This is because of the aliasing noise associated with the steep lanks of the salt diapir corrupting the surrounding reflections. Spar tial aliasing not only adversely affects the quality of the inage associated with a dipping event that is aliased, but it also can obliterate other nonaliased events in the data.
Figure 4.6-28 through 4.6-30 show migrations of the stacked sections in Figures 4.6-25 and 4.6-26 using steep-dip frequency-space implicit and explicit schemes, and the phase-shift method. Similar conclusions are drawn for the Kirchhoff summation results shown in Figure 4.6-27. Differences in terms of delineation of the salt boundary and the surrounding strata are attributable to the manner in which these algorithms are implemented and how they treat the velocity field for migration. For instance, when examining the results from the froquency-space implicit scheme (Figure 4.628), one must keep in mind the effect of spatial aliasing combined with the effect of undermigration caused by the dip-limited nature of the algorithm and the effect of dispersion caused by finite-difference approximations.
What is the remedy for spatial aliasing noise in migration? Arrange the sequence of the sections in Figures 4.6-27 through 4.6-30 from a coarser to a finer trace spacing. Note that the deleterious effect of spatial aliasing in migration disappears as we go to finer trace spacings. To avoid spatial aliasing, we must record with sufficiently fine CMP trace interval or interpolate the data that have been recorded with coarse spatial sampling.
Most modern surveys are conducted using spatial sampling rates that are perfectly adequate to meet exploration and development objectives. If we are dealing with vintage data with coarse spatial sampling, there are two ways to circumvent the effect of spatial aliasing. The first approach would be to filter out the aliased frequencies. This is undesirable, since it severely limits vertical and lateral resolutions (Scction 11.1). The second approach would be to do trace interpolation before migration. In Sections 7.2 and G.5, we discuss interpolation of aliased data. Note from section 1.3 that the smaller the trace interval, the higher the Nyquist in the spatia! wavenumber direction (Figures 1.3-10 and 1.3-11), and thus, the less likelihood of aliasing highfrequency datg.
A schematic illustration of the spatial aliasing phe nomenon is shown in Figure 4.6-31. Start with the spectral bandwidth that spans C O A C O A COAC O ACOA in the spatial wavenumber axis, where A A AAA is the location of the Nyquist wavenumber, and O N O N ONO NON in the temporal frequency axis, where N N NNN is the location of the Nyquist frequency. Dip

Trace Spacing = 13.3 m = 13.3 m =13.3m=13.3 \mathrm{~m}=13.3 m

FIG. 4.6-23. A portion of a CMP-stacked section spatially sampled at four different trace spacings.

Trace Spacing = 13.3 m = 13.3 m =13.3m=13.3 \mathrm{~m}=13.3 m

FIG. 4.6-24. Phase-shift mgrations of the stacked sections in Figure 4.6-23 sampled at four different trace spacings.
FIG. 4.6-25. A CMP-stacked section spat,ally sampled at 125 m 125 m 125-m125-\mathrm{m}125m (top) and 25 m 25 m 25-m25-\mathrm{m}25m (bottom) trace spacings.
FIG. 4.6-26. A CMP-stacked section as in Figure 4.6-25 spatially sampled at 50-m (top) and 100 m 100 m 100-m100-\mathrm{m}100m (bottom) trace spacings.
FIG. 4.6-27. Kirch hoff migrations of the stacked sections in Figure 4.6-25 and 4.6-26 with trace spacings, from top to bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-28. 65-degree implicit frequency-space migrations of the stacked sections in Figure 4.6-25 and 46 26 46 26 46-2646-264626 w spacings, from top to bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-29. 70-degree explicit frequency-space migrations of the stacked sections in Figure 46-25 and 4.6-26 with trace spacings, from top to bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4,6-30. Phase-shift migrations of the stacked sections in Figure 4.6-25 and 46-26 with trace spacings, from bottom, 12.5 m , 25 m , 50 m 12.5 m , 25 m , 50 m 12.5m,25m,50m12.5 \mathrm{~m}, 25 \mathrm{~m}, 50 \mathrm{~m}12.5 m,25 m,50 m, and 100 m 100 m 100m100 \mathrm{~m}100 m.
FIG. 4.6-31. Two dipping events in the f k f k f-kf-kfk domajn. See text for details.
components 1 and 2 are aliased beyond frequency values A T A T ATA TAT and A S A S ASA SAS, respectively. Extend the wavenumber axis to D O B D O B DOBD O BDOB by making the trace interval half of the original. Event 1 no longer is spatially aliased within the frequency band width O N O N ONO NON. Event 2 still is aliased beyond the frequency value B V B V BVB VBV. However, at this point and beyond, there may be no significant energy, so further extension of the wavenumber axis may not be necessary. Another important point is that if the temporal frequency band only extended up to O G O G OGO GOG to start with, extension of the wavenumber axis to D O B D O B DOBD O BDOB also would result in Event 2 being unaliased. Thus, the amount of trace interpolation that is required also depends on temporal bandwidth as well as on structural dip.
Trace interpolation often is necessary when dealing with 3-D data and old data recorded with a large group interval. In a typical 3-D survey, the inline trace interval may be as little as 12.5 m 12.5 m 12.5m12.5 \mathrm{~m}12.5 m, while the trace interval in the crossline direction, for some old data, may be as much as 100 m 100 m 100m100 \mathrm{~m}100 m. Therefore, interpolation is required before m i m i mi-\mathrm{mi}-mi gration in the crossline direction. You do not necessarily interpolate down to the inline trace spacing; instead, depending on the maximun structural dip and velocity in the area, the optimum trace spacing for interpolation in the crossline direction can be computed using equation (1-8). Section 7.2 provides more information on trace interpolation in relation to 3 D 3 D 3-D3-\mathrm{D}3D migration.

Migration and Random Noise

Figure 4.6-32 shows a section that contains bandlimited random noise uncorrelated from trace to trace and its migration using the phase-shift method. Velocity increases linearly from 2000 m / s 2000 m / s 2000m//s2000 \mathrm{~m} / \mathrm{s}2000 m/s at the top to 4000 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s at the bottom of the section. The amplitude and frequency characteristics of the input section in Figure
(a)
(b)
FIG. 4.6-32. Response of migration to random noise: (a) zero-offset section with random noise, only, (b) frequencywavenumber migration.
(a)
(b)
FIG. 4.6-33. (a) A deeper portion of a CMP-stacked section with significant noise level, (b) the same portion after migration.
FIG. 4.6-34. Migrations of a portion of a CMP stack with different lateral extents.
(a)
(b)
(c)
FIG. 4.6-35. Edge effects in migration: (a) a portion of a CMP stack, (b) the same portion after migration, and (c) a sketch that illustrates the edge effect problem using the semicircle superposition method of migration. See text for A, B, C, and D.
(a)
(b)
FIG. 4.6-36. A CMP stack (a) before and (b) after migration.
4.6-32 are virtually unchanged in the interior portion of the migrated section. However, note the smearing of amplitudes at the bottom and side boundaries after migration.
Ambient noise commonly dominates the deep portion of a stacked section where velocities are high. Therefore, orgenization of random noise caused by migration generally is more severe in the deeper part of a stacked section. A field data example is shown in Figure 4.6-33. In addition to smearing effects, the migrated section also has smiles, which are caused by sparsely distributed bursts of amplitude in the input section. Keep in mind that a single spike on the time section migrates to a semicircle on the depth section.
We already have seen the gdverse effect of an improper choice of aperture width in Kirchhoff summation (Figure 4.2-7). A narrow aperture can introduce strong smearing as spurious, nearly horizontal events. A similar effect occurs for all types of migration algorithms if the maximum dip to migrate is severely restricted (Figure 4.5 4 4.5 4 4.5-44.5-44.54 ). It is a misconception to imagine that migration attenuates random noise and improves signal-to-noise ratio. Instead, one must keep in mind that migration organizes random noise, it does not ettenuate it. A diplimited migration algorithm acts upon the random noise like a dip filter and removes the noise energy beyond the dip limit much like shown in Figure 6.2-2. The diplimited algorithm also attenuates unaliased linear noise with a dip steeper than the dip limit.

Migration and Line Length

For one reason or another, a seismic line may have to be recorded in the field with a shorter length than desired. To see the effect of line length on migration, we will examine the migrations of the decreasing lengths of the same CMP stack (Figure 4.6-34). Migration of the smaller portions, B D B D BDB DBD and C D C D CDC DCD, results in an increasingly smeared section, particularly in the deeper parts. We conclude that short seismic lines really are not suited for migration.
If the line traverse is too short, two effects occur. First, there is not enough space in the section for dipping events to move during migration. This problem may be alleviated by padding the stacked section with
FIG. 4.6-39. A sketch of the events after migration from the flat reference datum level as in Figure 4.6-37 denoted by the dotted segments and migration from the floating datum as in Figure 4.6-38 denoted by the solid segments. The area covered corresponds to the upper central portions of the sections in Figures 4.6-37 and 46 38 46 38 46-3846-384638 between midpoints A A AAA and B B BBB.
zero traces on both sides before migration. Second, side boundary effects contaminate a significant portion of the migrated section. The real solution to circumvent the boundary effects is to record data with sufficient line length.
With a general idea of structural dip in an area, the geophysicist must consider the additional spatial extent that is required by migration. (Refer to the discussion on Figure 4.1-1.) This is especially important in 3-D surveys in which the surface areal coverage must be extended beyond the subsurface areal coverage so that steep dips and structural discontinuities can be recorded and imaged properly (Section 7.1). The problem with 3 D 3 D 3-D3-D3D is that cost increases as the square of the survey dimension, so that temptation to record too small a survey is great.
Regardless of line lengths, there are additional problems associated with the side boundaries of the stacked section input to migration. All migration algorithms implicitly make some assumption about the nature of data outside the side boundaries of the input stacked section. The simple assumptions, zero amplitude or zero gradient at the side boundaries of the section, cause data that should migrate past the edge to be reflected back into the section. To prevent this, traces of zero amplitude often are appended to the edges of the input section. This allows the dipping events to move freely into the zero-amplitude region during migration. If the events that would migrate off the input section are not needed, they often are suppressed by using absorbing side boundary conditions (Clayton and Engquist, 1980).
Figure 4.6-35 shows a section with significant smearing caused by side boundary effects. The wavefront character that dominates the left boundary of the migrated section down to the bottom of the mute zone can be explained using the principle of semicircle superposition for migration. Consider a dipping event A A AAA that extends down to the edge of the section as in the sketch in Figure 4,6-35. After migration B B BBB, note the remainder of the semicircular wavefront C C CCC on the left side. This wavefront did not cancel out during superposition because no data were available beyond the left boundary of the section.
Another source of edge effects is the presence of amplitude bursts at or near the edge of the stacked section associated with a low signal-to-noise ratio that results from low fold. The edge effects on the left boundary below the mute zone in the migrated section (Figure 4.6-35) probably stem from the lack of amplitude balance on the CMP stacked section. The latter is caused by changes in fold at the end of the line.
Figure 4.6-36 shows a CMP stack with an imbricate structure associated with overthrust tectonics. After migration, note that there are two zones with no reflections. The zone to the left of CMP 100 resulted from finite line length. Specifically, the events on the left flank of the imbricate structure are migrated to the right in the up-dip direction, thus leaving behind a zone of no events into which no energy is moved since the line ends to the left of the structure. The zone of no events between CMP 200 and 300 is a direct consequence of the overthrusting that has given rise to a culminating stricture with very steep, almost overturned events. Mi-
FIG, 4,6-40. Principles of migration from topography. See text for details.
gration of such steep dips is possible only if they exist in the recorded data and are imaged using algorithms which handle dips beyond 90 degrees.

Migration from Topography

A CMP-stacked section is assumed to be equivalent to a zero-offset wavefield and usually is referenced to a flat datum. Figure 4.6-37 shows a migrated CMP stacked section associated with a seismic line that follows a traverse with severe topography from an area with overthrust tectonics. Migration was done from a flat reference datum. When migrating data recorded over such an irregular and severe topography, however, one needs to account for the difference between the elevation profile and the reference datum. Otherwise, events appear to a migration algorithm shallower than they actually are if the flat reference datum is below the elevation profile, and thus are undermigr ated. If the flat reference datum is above the elevation profile, then events appcar to a migration algorithm deeper than they actually are, and thus are overmigrated.
Figure 4.6-38 shows the same data as in Figure 4.6-37 with migration from the floating datum which is a smooth form the elevation profile. A sketch of key events between midpoints A A AAA and B B BBB from both sections is provided in Figure 4.6-39. The flat reference datum in this case is above the elevation profile. Hence, migration from the flat datum causes overmigration as denoted by the dotted interpretation segments. By migrating the data from the floating datum and interpreting the resulting section, we obtain the solid segments in Figure 4.6-39.
Migration algorithms, with the exception of Kirchhoff summation and the constant-velocity Stolt method, are all based on wave extrapolation from one flat depth level to another. To accommodate an irregular topography, the following formal approach can be used:
(a) Stack the data referenced to the floating datum and assume it to be the zero-offset wavefield recorded along the floating datum profile.
(b) Apply wave-equation datuming (Section 8.1) to extrapolate the zero-offset wavefield as dofined in (a) from the floating datum to a flat datum above using a velocity the same as that just below the floating datum.
(c) Migrate the output wavefield from (b) using a preferred migration algorithm.
The stacking velocity field required in step (a) is referenced to the floating datum. The migration velocity field required in step (c) would need to be derived by redefining the stacking velocities with respect to the flat datum. To circumvent this tedious task, migration from an irregular topography is done either by the zero-velocity trick (Beasley and Lynn, 1902) or the zero-wavefield trick (Reshef, 1991).
In the first approach by Beasley and Lynn (1992), a zero velocity value is assigned to the region between the floating datum and the flat datum, which is specified above the floating datum. Just as it should be in conventional processing, the stacked section is referenced to the flat datum, and the velocities are referenced to the floating datum. Extrapolate the stacked section down one depth step using the zero velocity as part of the migration process. This amounts to a simple vertical time shift. If the depth level intersects the floating detum profile, then invoke the diffraction term (equation 4-16a) for the traces in the stacked section that coincide with the intersection points. Continue the extrapolation process from one depth level to the next while trurning on the diffraction term for those traces which coincide with the intersection points of the depth levels and floating datum profile.
In the second approach by Reshef (1991), to start with, a zero wavefield is assigned to the fat datum level z 0 z 0 z_(0)z_{0}z0 in Figure 4.6-40. The stacked section and the velocities are referenced to the floating datum. Extrapolate this wavefield down one depth level to z 1 z 1 z_(1)z_{1}z1 using a velocity the same as that just below the floating datum profile. Import the traces 1 and 2 from the stacked section at the intersection points of the depth level and the floating datum profile, and insert them to the section referenced to the depth level z 1 z 1 z_(1)z_{1}z1. Now extrapolate down to the next depth level z 2 z 2 z_(2)z_{2}z2, and import traces 3 , 4 , 5 3 , 4 , 5 3,4,53,4,53,4,5, and 6 from the stacked section, and insert them into section referenced to the depth level z 2 z 2 z_(2)z_{2}z2. At each depth level, while new traces are imported from the original stacked section, the previously imported traces are subsjected to wave extrapolation as symbolized by the small arcs associated with each time sample.

EXERCISES

Exercise 4-1. Consider the special case of a 90 degree dipping reflector in Figure 4.1-1a. Sketch the corresponding zero-offect time section.
Exercise 4-2. Consider Huygens' secondary sources along a dipping reflector. Sketch the zero-offset section by superimposing the individual responses from these sources. Remember, to do zero-offset modeling, you must map a point in the x z x z x-zx-zxz plane to a hyperbola in the x t x t x-tx-txt plane with its apex as the input point.
Exercise 4-3. For which case is spatial aliasing a more serious problen, the low-velocity or high-velocity medium?
FIG. 4.E-1. See Excrcise 4-4.
Exercise 4-4. Locate the dipping event A A A A AA^(')A A^{\prime}AA on the migrated section in Figure 4.E-1,
Exercise 4-5. A point in the x t x t x-tx-txt plane is mapped onto a semicircle in the x z x z x-zx-zxz plane. Where does it map on the x τ x τ x-taux-\tauxτ plane, where τ = 2 z / v τ = 2 z / v tau=2z//v\tau=2 z / vτ=2z/v.
Exercise 4-6. Refer to Figure 4. I-14. It suggests that if the subsurface consisted of a semicircular reflector (b), then the zero-offset response would be as in (a). What would the subsurface be like if you obtained (a) using a source-receiver pair with a finite separation between them? (See Figurcs D-5 and D-6.)
Exercise 4-7. Suppose you specified the wrong trace spacing in your migration. What effect does it have, overmigration or undermigration? Assume that you supplied the wrong sampling rate in time. What cffect does it have on migration output?
Exercise 4-8. Suppose you want to do zero-offset recording of the steep lank of a salt dome. Which case would require a longer line length when the medium velocity along the raypath is (a) constant or (b) vertically increasing?
Exercise 4-9. How would Figure 4.3-6 look if you used a 15-degree phase-shift migration algorithm?

Appendix D
MATHEMATICAL FOUNDATION OF MIGRATION

D. 1 Wavefield Extrapolation and Migration

A fundamental equation of reflection seismology is the double-square-root ( D S R ) ( D S R ) (DSR)(D S R)(DSR) equation. This equation describes downward continuation of both shots and receivers into the earth. It is exact for all dips and offsets. Neglecting the velocity gradient d v ( z ) / d z d v ( z ) / d z dv(z)//dzd v(z) / d zdv(z)/dz makes the D S R D S R DSRD S RDSR equation also applicable to a stratified earth. The DSR equation can be extended, with some approximation, to treat weak lateral velocity variations. A comprehensive mathematical treatise of the DSR equation is found in Claerbout (1985).
The basic 2-D theory for wavefield extrapolation is presented here. Then, using the DSR equation, a rigorous analysis of conventional seismic data processing is made. We show that conventional implementation of the D S R D S R DSRD S RDSR equation requires zero-dip and zero-offset assumptions.
Before discussing the D S R D S R DSRD S RDSR equation, we review the basic theory for wavefield cxtrapolation. Once the extrapolation equations are developed, they can be used with the imaging principle to migrate 2-D or 3-D prestack and poststack data.
Start with the 2-D scalar wave equation, which describes propagation of a compressional wavefield P ( x , z , t ) P ( x , z , t ) P(x,z,t)P(x, z, t)P(x,z,t) in a medium with constant material density and compressional wave velocity v ( x , z ) v ( x , z ) v(x,z)v(x, z)v(x,z) :
( 2 x 2 + 2 z 2 1 v 2 2 t 2 ) P ( x , z , t ) = 0 2 x 2 + 2 z 2 1 v 2 2 t 2 P ( x , z , t ) = 0 ((del^(2))/(delx^(2))+(del^(2))/(delz^(2))-(1)/(v^(2))(del^(2))/(delt^(2)))P(x,z,t)=0\left(\frac{\partial^{2}}{\partial x^{2}}+\frac{\partial^{2}}{\partial z^{2}}-\frac{1}{v^{2}} \frac{\partial^{2}}{\partial t^{2}}\right) P(x, z, t)=0(2x2+2z21v22t2)P(x,z,t)=0
where x x xxx is the horizontal spatial axis, z z zzz is the depth axis (positive downward), and t t ttt is time. Given the upcoming seismic wavefield P ( x , 0 , t ) P ( x , 0 , t ) P(x,0,t)P(x, 0, t)P(x,0,t), which is recorded at the surface, we want to determine reflectivity P ( x r z , 0 ) P x r z , 0 P(x_(r)z,0)P\left(x_{r} z, 0\right)P(xrz,0). This requires extrapolating the surface wavefield to depth z z zzz, then collecting it at t = 0 t = 0 t=0t=0t=0. The process of obtaining the earth's reflectivity P ( x , z , t = 0 ) P ( x , z , t = 0 ) P(x,z,t=0)P(x, z, t=0)P(x,z,t=0) from the observed wavefield P ( x , z = 0 , t ) P ( x , z = 0 , t ) P(x,z=0,t)P(x, z=0, t)P(x,z=0,t) at the surface z = 0 z = 0 z=0z=0z=0 is called migration, and the reverse process is called modeling (Figure D-1).
It is advantageous to decompose the wavefield into monochromatic plane waves with different angles of propagation from the vertical. Therefore, we will work in the Fourier transform domain whenever possible. The wavefield can always be Fourier transformed over time t t ttt. If there is no lateral velocity variation, then the wavefield also can be Fourier transformed over the horizontal axis x x xxx. Thus,
P ( k x , z , ω ) = P ( x , z , t ) exp ( ı k x i ω t ) d x d t P k x , z , ω = P ( x , z , t ) exp ı k x i ω t d x d t P(k_(x),z,omega)=∬P(x,z,t)exp(ık_(x)-i omega t)dxdtP\left(k_{x}, z, \omega\right)=\iint P(x, z, t) \exp \left(\imath k_{x}-i \omega t\right) d x d tP(kx,z,ω)=P(x,z,t)exp(ıkxiωt)dxdt
and inversely,
P ( x , z , t ) = P ( k x , z , ω ) exp ( i k x + i ω t ) d k x d ω P ( x , z , t ) = P k x , z , ω exp i k x + i ω t d k x d ω P(x,z,t)=∬P(k_(x),z,omega)exp(-ik_(x)+i omega t)dk_(x)d omegaP(x, z, t)=\iint P\left(k_{x}, z, \omega\right) \exp \left(-i k_{x}+i \omega t\right) d k_{x} d \omegaP(x,z,t)=P(kx,z,ω)exp(ikx+iωt)dkxdω
When the differential operator in equation (D-1) is applied to equation (D-2b), we get
2 z 2 P ( k ˙ x , z , ω ) + ( ω 2 v 2 k x 2 ) P ( k x , z , ω ) = 0 2 z 2 P k ˙ x , z , ω + ω 2 v 2 k x 2 P k x , z , ω = 0 (del^(2))/(delz^(2))P(k^(˙)_(x),z,omega)+((omega^(2))/(v^(2))-k_(x)^(2))P(k_(x),z,omega)=0\frac{\partial^{2}}{\partial z^{2}} P\left(\dot{k}_{x}, z, \omega\right)+\left(\frac{\omega^{2}}{v^{2}}-k_{x}^{2}\right) P\left(k_{x}, z, \omega\right)=02z2P(k˙x,z,ω)+(ω2v2kx2)P(kx,z,ω)=0
Although v v vvv can be varied with depth z z zzz in equation (D-3), for now we assume a constant velocity case. The stratified earth case is considered later in this appendix. Equation (D-3) has two solutions, one for upcoming waves, the other for downgoing waves. The upcoming wave solution to equation (D-3) is recognized as

Migration

Observations

Earth
z = 0 z = 0 z=0z=0z=0
all t t ttt
z=0 all t| $z=0$ | | :---: | | all $t$ |
"z=0 all t"| $z=0$ <br> all $t$ | | :--- |

Modeling

FIG. D-1. Relationship between migration and wavefield modeling (see Section D.1).
P ( k x , z , ω ) = P ( k x , z = 0 , ω ) exp [ i ω 2 v 2 k x 2 z ] P k x , z , ω = P k x , z = 0 , ω exp i ω 2 v 2 k x 2 z P(k_(x),z,omega)=P(k_(x),z=0,omega)exp[-isqrt((omega^(2))/(v^(2))-k_(x)^(2)z)]P\left(k_{x}, z, \omega\right)=P\left(k_{x}, z=0, \omega\right) \exp \left[-i \sqrt{\frac{\omega^{2}}{v^{2}}-k_{x}^{2} z}\right]P(kx,z,ω)=P(kx,z=0,ω)exp[iω2v2kx2z]
Equation (D-4) ulso is the solution to the following one-way wave equation:
z P ( k x , z , ω ) = i ω 2 v 2 k x 2 P ( k x , z 1 ω ) z P k x , z , ω = i ω 2 v 2 k x 2 P k x , z 1 ω (del)/(del z)P(k_(x),z,omega)=-isqrt((omega^(2))/(v^(2))-k_(x)^(2))P(k_(x),z_(1)omega)\frac{\partial}{\partial z} P\left(k_{x}, z, \omega\right)=-i \sqrt{\frac{\omega^{2}}{v^{2}}-k_{x}^{2}} P\left(k_{x}, z_{1} \omega\right)zP(kx,z,ω)=iω2v2kx2P(kx,z1ω)
This solution can be verified by substituting equation (D-4) into equation (D-5).
We define the vertical wavenumber as
k z = ω v 1 ( v k x ω ) 2 k z = ω v 1 v k x ω 2 k_(z)=(omega )/(v)sqrt(1-((vk_(x))/(omega))^(2))k_{z}=\frac{\omega}{v} \sqrt{1-\left(\frac{v k_{x}}{\omega}\right)^{2}}kz=ωv1(vkxω)2
Equation (D-6) often is called the disperston relation of the one-way scalar wave equation. By using this expression, equation (D-4) takes the simple form
P ( k x , z , ω ) = P ( k x , z = 0 , ω ) exp ( ı k z z ) P k x , z , ω = P k x , z = 0 , ω exp ı k z z P(k_(x),z,omega)=P(k_(x),z=0,omega)exp(-ık_(z)z)P\left(k_{x}, z, \omega\right)=P\left(k_{x}, z=0, \omega\right) \exp \left(-\imath k_{z} z\right)P(kx,z,ω)=P(kx,z=0,ω)exp(ıkzz)
To determine the reflectivity P ( x , z , 0 ) P ( x , z , 0 ) P(x,z,0)P(x, z, 0)P(x,z,0) from the wavefield recorded at the earth's surface P ( x , 0 , t ) P ( x , 0 , t ) P(x,0,t)P(x, 0, t)P(x,0,t), proceed as follows:
(a) Perform a 2-D Fourier transform over x x xxx and t t ttt to get P ( k x , 0 , ω ) P k x , 0 , ω P(k_(x),0,omega)P\left(k_{x}, 0, \omega\right)P(kx,0,ω).
(b) Multiply by the all-pass filter exp ( ı k z z ) exp ı k z z exp(-ık_(z)z)\exp \left(-\imath k_{z} z\right)exp(ıkzz) to obtain the wavefield P ( k z , z , ω ) P k z , z , ω P(k_(z),z,omega)P\left(k_{z}, z, \omega\right)P(kz,z,ω) at depth z z zzz.
(c) Perform summation over ω ω omega\omegaω to obtain P ( k x , z , 0 ) P k x , z , 0 P(k_(x),z,0)P\left(k_{x}, z, 0\right)P(kx,z,0).
(d) Finally, inverse Fourier tranforn over k x k x k_(x)k_{x}kx to obtain the earth's image P ( x , z , 0 ) P ( x , z , 0 ) P(x,z,0)P(x, z, 0)P(x,z,0) at that depth.
For the constant velocity case P ( k x , k z , 0 ) P k x , k z , 0 P(k_(x),k_(z),0)P\left(k_{x}, k_{z}, 0\right)P(kx,kz,0) can be computed by a direct mapping in the transform domain from ( k x , ω ) k x , ω (k_(x),omega)\left(k_{x}, \omega\right)(kx,ω) to ( k x , k z ) k x , k z (k_(x),k_(z))\left(k_{x}, k_{z}\right)(kx,kz) using equation (D-6) (Stolt, 1978).
The main objective here is to interpret equation (D-7) as a tool for downward extrapolating wavefields given at the surface. While the mathematical development of the process presented is simple, its physical basis is not obvious. In an effort to devclop a physical motivation for equation (D-7), a simpler derivation follows.
Given the upcoming wavefield P ( x , 0 , f ) P ( x , 0 , f ) P(x,0,f)P(x, 0, f)P(x,0,f) recorded at the surface, we can decompose it into monochromatic plane waves, each traveling at a different angle from the vertical. We identify these plane waves by attaching each one to a unique ( k x , ω ) k x , ω (k_(x),omega)\left(k_{x}, \omega\right)(kx,ω) pair. This plane-wave decomposition is equivalent to Fourier transforming the wavefield to yield P ( k x , 0 , ω ) P k x , 0 , ω P(k_(x),0,omega)P\left(k_{x}, 0, \omega\right)P(kx,0,ω).
Now consider one of these plane waves as shown in Figure D-2. Imagine that this plane wave passed point P P PPP at t = 0 t = 0 t=0t=0t=0, traveled upward, and was recorded by a receiver at surface point G G GGG at
FIG. D-2. Geometry for wavefield extrapolation (see Section D.1) (Yilmaz, 1979).
time t t ttt. For reflector mapping, we need to take the energy located at point G G GGG on the wavefront at time t t ttt, back to its position at t = 0 t = 0 t=0t=0t=0 - to reflection point P P PPP. To return the energy to P P PPP, it makes sense to follow the sarne raypath used for outward propagation from P P PPP. The fact that the same path is used means that downward continuation does not alter the horizontal wavenumber k x k x k_(x)k_{x}kx.
Suppose that the wavefront is moved to a depth Δ z = G G Δ z = G G Delta z=GG^(')\Delta z=G G^{\prime}Δz=GG beneath the receiver at G G GGG so that the waveform at G G GGG now is at G G G^('')G^{\prime \prime}G. If a receiver were buried at G G G^('')G^{\prime \prime}G, it would have recorded the plane wave at t Δ t t Δ t t-Delta tt-\Delta ttΔt, where Δ t Δ t Delta t\Delta tΔt is the traveltime between G G GGG and G G G^('')G^{\prime \prime}G. In other words, moving the receiver at G G GGG vertically down a distance Δ z Δ z Delta z\Delta zΔz to a new location G G G^(')G^{\prime}G changes the traveltime along the raypath from G G GGG to P P PPP by Δ t Δ t -Delta t-\Delta tΔt.
From the geometry of Figure D-2, we have
Δ t = Δ z v cos θ Δ t = Δ z v cos θ Delta t=(Delta z)/(v)cos theta\Delta t=\frac{\Delta z}{v} \cos \thetaΔt=Δzvcosθ
where v / cos θ v / cos θ v//cos thetav / \cos \thetav/cosθ is the vertical phase velocity. We know the k x k x k_(x)k_{x}kx and ω ω omega\omegaω values for the plane wave. Suppose the distance between G G GGG and G G G^('')G^{\prime \prime}G is one wavelength λ λ lambda\lambdaλ. At time t Δ t t Δ t t-Delta tt-\Delta ttΔt, the wavefront intersects the x x xxx-axis at distance λ x λ x lambda_(x)\lambda_{x}λx from G G GGG. From the geometric relation in Figure D-2, we have
λ λ x = sin θ λ λ x = sin θ (lambda)/(lambda_(x))=sin theta\frac{\lambda}{\lambda_{x}}=\sin \thetaλλx=sinθ
By using the definitions λ = 2 π / ( ω / v ) , λ x = 2 π / k x λ = 2 π / ( ω / v ) , λ x = 2 π / k x lambda=2pi//(omega//v),lambda_(x)=2pi//k_(x)\lambda=2 \pi /(\omega / v), \lambda_{x}=2 \pi / k_{x}λ=2π/(ω/v),λx=2π/kx, and equation (D-8b), we obtain
sin θ = v k x ω sin θ = v k x ω sin theta=(vk_(x))/(omega)\sin \theta=\frac{v k_{x}}{\omega}sinθ=vkxω
and
cos θ = 1 ( v k x ω ) 2 cos θ = 1 v k x ω 2 cos theta=sqrt(1-((vk_(x))/(omega))^(2))\cos \theta=\sqrt{1-\left(\frac{v k_{x}}{\omega}\right)^{2}}cosθ=1(vkxω)2
where ω / v ω / v omega//v\omega / vω/v is the wavenumber along the raypath. By substituting equation (D-8d) into equation (D-8a), we have
Δ t = 1 v 1 ( v k r ω ) 2 Δ z Δ t = 1 v 1 v k r ω 2 Δ z Delta t=(1)/(v)sqrt(1-((vk_(r))/(omega))^(2))Delta z\Delta t=\frac{1}{v} \sqrt{1-\left(\frac{v k_{r}}{\omega}\right)^{2}} \Delta zΔt=1v1(vkrω)2Δz
As we move down, we do not want to change the amplitude of the plane wave. Given the change in traveltime, Δ t Δ t Delta t\Delta tΔt by equation (D-8e), the corresponding phase shift is ω Δ t ω Δ t -omega Delta t-\omega \Delta tωΔt. At each Δ z Δ z Delta z\Delta zΔz step of descent, we may propagate the plane wave with a different velocity v ( z ) v ( z ) v(z)v(z)v(z). The total phase shift to which the waveform was subjected with arrival at P P PPP is ω d t ω d t -int omega dt-\int \omega d tωdt.
To compute the wavefield at P P PPP, we use equation (D-8e) and multiply the transformed surface wavefield P ( k x , 0 , ω ) P k x , 0 , ω P(k_(x),0,omega)P\left(k_{x}, 0, \omega\right)P(kx,0,ω) by
exp ( ı C P ω d t ) = exp [ ı 0 z ω v ( z ) 1 ( v ( z ) k τ ω ) 2 d z ] exp ı C P ω d t = exp ı 0 z ω v ( z ) 1 v ( z ) k τ ω 2 d z exp(-ıint_(C)^(P)omega dt)=exp[-ıint_(0)^(z)(omega)/(v(z))sqrt(1-((v(z)k_(tau))/(omega))^(2))dz]\exp \left(-\imath \int_{C}^{P} \omega d t\right)=\exp \left[-\imath \int_{0}^{z} \frac{\omega}{v(z)} \sqrt{1-\left(\frac{v(z) k_{\tau}}{\omega}\right)^{2}} d z\right]exp(ıCPωdt)=exp[ı0zωv(z)1(v(z)kτω)2dz]
Equation (D-9) is the same operator uscd in equation (D-7), except that equation (D-7) was derived for constant v v vvv.
We now return to the more mathematical discussion and consider the stratified earth with a velocity v ( z ) v ( z ) v(z)v(z)v(z). Since we have not Fourier transformed P ( x , z , t ) P ( x , z , t ) P(x,z,t)P(x, z, t)P(x,z,t) over z z zzz, the one-way wave equation (D-5) also is valid for v ( z ) v ( z ) v(z)v(z)v(z) :
z P ( k x , z , ω ) = i ω 2 v 2 ( z ) k z 2 P ( k x , z , ω ) z P k x , z , ω = i ω 2 v 2 ( z ) k z 2 P k x , z , ω (del)/(del z)P(k_(x),z,omega)=-isqrt((omega^(2))/(v^(2)(z))-k_(z)^(2))P(k_(x),z,omega)\frac{\partial}{\partial z} P\left(k_{x}, z, \omega\right)=-i \sqrt{\frac{\omega^{2}}{v^{2}(z)}-k_{z}^{2}} P\left(k_{x}, z, \omega\right)zP(kx,z,ω)=iω2v2(z)kz2P(kx,z,ω)
in which case equation
6) becomes.  6) becomes.  " 6) becomes. "\text { 6) becomes. } 6) becomes. 
k z ( z ) = ω v ( z ) 1 [ v ( z ) k x ω ] 2 k z ( z ) = ω v ( z ) 1 v ( z ) k x ω 2 k_(z)(z)=(omega)/(v(z))sqrt(1-[(v(z)k_(x))/(omega)]^(2))k_{z}(z)=\frac{\omega}{v(z)} \sqrt{1-\left[\frac{v(z) k_{x}}{\omega}\right]^{2}}kz(z)=ωv(z)1[v(z)kxω]2
Substitution verifies that equation (D-10) has the following solution:
P ( k x , z , ω ) = P ( k x , 0 , ω ) exp [ i 0 z k z ( z ) d z ] P k x , z , ω = P k x , 0 , ω exp i 0 z k z ( z ) d z P(k_(x),z,omega)=P(k_(x),0,omega)exp[-iint_(0)^(z)k_(z)(z)dz]P\left(k_{x}, z, \omega\right)=P\left(k_{x}, 0, \omega\right) \exp \left[-i \int_{0}^{z} k_{z}(z) d z\right]P(kx,z,ω)=P(kx,0,ω)exp[i0zkz(z)dz]
We must check whether this solution satisfies the two-way scalar wave equation (D-3). By differentiating equation (D-10) and using equation (D-11), we have
2 z 2 P = i d k z ( z ) d v d v ( z ) d z P i k z ( z ) z P 2 z 2 P = i d k z ( z ) d v d v ( z ) d z P i k z ( z ) z P (del^(2))/(delz^(2))P=-i(dk_(z)(z))/(dv)(dv(z))/(dz)P-ik_(z)(z)(del)/(del z)P\frac{\partial^{2}}{\partial z^{2}} P=-i \frac{d k_{z}(z)}{d v} \frac{d v(z)}{d z} P-i k_{z}(z) \frac{\partial}{\partial z} P2z2P=idkz(z)dvdv(z)dzPikz(z)zP
where P = P ( k x , z , ω ) P = P k x , z , ω P=P(k_(x),z,omega)P=P\left(k_{x}, z, \omega\right)P=P(kx,z,ω). By substituting equation (D-10) for P / d z P / d z del P//dz\partial P / d zP/dz, we obtain
2 z 2 P = i d k z ( z ) d v d v ( z ) d z P k z 2 ( z ) P 2 z 2 P = i d k z ( z ) d v d v ( z ) d z P k z 2 ( z ) P (del^(2))/(delz^(2))P=-i(dk_(z)(z))/(dv)(dv(z))/(dz)P-k_(z)^(2)(z)P\frac{\partial^{2}}{\partial z^{2}} P=-i \frac{d k_{z}(z)}{d v} \frac{d v(z)}{d z} P-k_{z}^{2}(z) P2z2P=idkz(z)dvdv(z)dzPkz2(z)P
If the velocity gradient d v ( z ) / d z d v ( z ) / d z dv(z)//dzd v(z) / d zdv(z)/dz is ignored, then the first term on the right side drops out. The final expression then is
2 z 2 P + k z 2 ( z ) P = 0 2 z 2 P + k z 2 ( z ) P = 0 (del^(2))/(delz^(2))P+k_(z)^(2)(z)P=0\frac{\partial^{2}}{\partial z^{2}} P+k_{z}^{2}(z) P=02z2P+kz2(z)P=0
When equation (D-11) is substituted into this expression, we get:
2 z 2 P + [ ω 2 v 2 ( z ) k x 2 ] P = 0 2 z 2 P + ω 2 v 2 ( z ) k x 2 P = 0 (del^(2))/(delz^(2))P+[(omega^(2))/(v^(2)(z))-k_(x)^(2)]P=0\frac{\partial^{2}}{\partial z^{2}} P+\left[\frac{\omega^{2}}{v^{2}(z)}-k_{x}^{2}\right] P=02z2P+[ω2v2(z)kx2]P=0
which is identical to equation (D-3) where velocity can be varied with depth z z zzz.
So far, we have shown that a 2-D waveficld recorded at the earth's surface can be extrapolated downward using the phase-shift operator given by equation (D-9). Wave extrapolation can be done through either a constant-velocity medium (equation D-7) or a vertically varying velocity medium (equation D-12). Seismic imaging is not complete until a stopping condition is imposed on downward continuation. The process of downward continuation is terminated when the clock, which measures t d t t d t t-int dtt-\int d ttdt. reads zero traveltime.
The concepts described above can be used to downward continue a complete seismic experiment that involves many shots and receivers. The vertical wavernumber given by equation (D-6)
is expressed as a sum of two square roots, one associated with downward continuation of shots and the other associated with downward continuation of receivers:
k z = ω v D S R ( G , S ) k z = ω v D S R ( G , S ) k_(z)=(omega )/(v)DSR(G,S)k_{z}=\frac{\omega}{v} D S R(G, S)kz=ωvDSR(G,S)
where v v vvv is the medium velocity that can be varied in depth z z zzz, and D S R D S R DSRD S RDSR stands for the double square root (Claerbout, 1985):
D S R ( G , S ) = 1 G 2 + 1 S 2 D S R ( G , S ) = 1 G 2 + 1 S 2 DSR(G,S)=sqrt(1-G^(2))+sqrt(1-S^(2))D S R(G, S)=\sqrt{1-G^{2}}+\sqrt{1-S^{2}}DSR(G,S)=1G2+1S2
where G G GGG and S S SSS are the normalized receiver and shot wavenumbers, k g k g k_(g)k_{g}kg and k s k s k_(s)k_{s}ks, respectively:
G = v k g ω G = v k g ω G=(vk_(g))/(omega)G=\frac{v k_{g}}{\omega}G=vkgω
and
S = v k s ω S = v k s ω S=(vk_(s))/(omega)S=\frac{v k_{s}}{\omega}S=vksω
The newly defined vertical wavenumber in equation (D-15) is inserted into the extrapolation equation (D-7) to obtain
P ( k g , k s , z , ω ) = P ( k g , k s , 0 , ω ) cxp ( i k z z ) P k g , k s , z , ω = P k g , k s , 0 , ω cxp i k z z P(k_(g),k_(s),z,omega)=P(k_(g),k_(s),0,omega)cxp(-ik_(z)z)P\left(k_{g}, k_{s}, z, \omega\right)=P\left(k_{g}, k_{s}, 0, \omega\right) \operatorname{cxp}\left(-i k_{z} z\right)P(kg,ks,z,ω)=P(kg,ks,0,ω)cxp(ikzz)
where P ( k q , k s , 0 , ω ) P k q , k s , 0 , ω P(k_(q),k_(s),0,omega)P\left(k_{q}, k_{s}, 0, \omega\right)P(kq,ks,0,ω) is the Fourier transform of the prestack data P ( s , g , z = 0 , t ) P ( s , g , z = 0 , t ) P(s,g,z=0,t)P(s, g, z=0, t)P(s,g,z=0,t) in shotreceiver coordinates. This new extrapolation equation then can be used to downward continue common-shot gathers, and by way of reciprocity, common-receiver gathers.
The DSR equation (D-16) is separable in terms of shot and receiver wavenumbers. This separation means that we can start with the wavefields recorded at the surface as common-shot gathers and use the first part of the D S R D S R DSRD S RDSR operator to downward continue the receivers to depth Δ z Δ z Delta z\Delta zΔz. Then, we can sort the already downward-continued wavefields into common-receiver gathers and use the second part of the D S R D S R DSRD S RDSR operator to downward continue the shots to depth z z /_\z\triangle zz. By alternating between common-receiver and common-shot gathers, the entire seismic experiment (whole line) can be downward continued until imaging is accomplished (Figure D-3).
Although no approximation, besides the stratified earth assumption, is made in this alternating downward-continuation scheme, it is computationally exhausting. In fact, most of today's seismic data processing is done in midpoint-(half) offset ( y , h ) ( y , h ) (y,h)(y, h)(y,h) coordinates, rather than in shotreceiver ( s r g s r g (s_(r)g:}\left(s_{r} g\right.(srg ) coordinates. Therefore, we will put D S R D S R DSRD S RDSR as defined by equation (D-16) into the ( y , h ) ( y , h ) (y,h)(y, h)(y,h) coordinates.
The following coordinate transformation is required:
y = 1 2 ( g + s ) y = 1 2 ( g + s ) y=(1)/(2)(g+s)y=\frac{1}{2}(g+s)y=12(g+s)
and
h = 1 2 ( g s ) h = 1 2 ( g s ) h=(1)/(2)(g-s)h=\frac{1}{2}(g-s)h=12(gs)
After the transformation (Claerbout, 1985), we obtain
G = Y + H G = Y + H G=Y+HG=Y+HG=Y+H
and
S = Y H S = Y H S=Y-HS=Y-HS=YH
where Y Y YYY and H H HHH are the normalized midpoint and offet wavenumbers, respectively:
Y = v k y 2 ω Y = v k y 2 ω Y=(vk_(y))/(2omega)Y=\frac{v k_{y}}{2 \omega}Y=vky2ω
and
H = v k h 2 ω H = v k h 2 ω H=(vk_(h))/(2omega)H=\frac{v k_{h}}{2 \omega}H=vkh2ω
FIG. D-3. A flow diagram of shot-geophone migration (see Section D.1).
By substituting equations (D-21a) and (D-21b) into equation (D-16), the DSR equation takes the following form in midpoint-offset coordinates:
D S R ( Y , H ) = 1 ( Y + H ) 2 + 1 ( Y H ) 2 D S R ( Y , H ) = 1 ( Y + H ) 2 + 1 ( Y H ) 2 DSR(Y,H)=sqrt(1-(Y+H)^(2))+sqrt(1-(Y-H)^(2))D S R(Y, H)=\sqrt{1-(Y+H)^{2}}+\sqrt{1-(Y-H)^{2}}DSR(Y,H)=1(Y+H)2+1(YH)2
The vertical wavenumber (equation D-15) now is expressed in terms of normalized midpointoffset wavenumbers Y Y YYY and H H HHH :
k z = ω v D S R ( Y . H ) k z = ω v D S R ( Y . H ) k_(z)=(omega )/(v)DSR(Y.H)k_{z}=\frac{\omega}{v} D S R(Y . H)kz=ωvDSR(Y.H)
The newly defined vertical wavenumber in equation (D-23) is inserted into the extrapolation equation (D-18):
P ( k y , k h , z , ω ) = P ( k y , k h , 0 , ω ) exp ( ı k z z ) , P k y , k h , z , ω = P k y , k h , 0 , ω exp ı k z z , P(k_(y),k_(h),z,omega)=P(k_(y),k_(h),0,omega)exp(-ık_(z)z),P\left(k_{y}, k_{h}, z, \omega\right)=P\left(k_{y}, k_{h}, 0, \omega\right) \exp \left(-\imath k_{z} z\right),P(ky,kh,z,ω)=P(ky,kh,0,ω)exp(ıkzz),
where P ( k y , k h , 0 , ω ) P k y , k h , 0 , ω P(k_(y),k_(h),0,omega)P\left(k_{y}, k_{h}, 0, \omega\right)P(ky,kh,0,ω) is the Fourier transform of the prestack data P ( y , h , z = 0 , t ) P ( y , h , z = 0 , t ) P(y,h,z=0,t)P(y, h, z=0, t)P(y,h,z=0,t) in midpointoffset coordinates.
Figure D-4 shows the ω k y ω k y omega-k_(y)\omega-k_{y}ωky plane for a spocific value of z z zzz and h h hhh, and the k y z k y z k_(y)-zk_{y}-zkyz plane for a specific value of ω ω omega\omegaω and h h hhh. The radial line A corresponds to k ν = 2 ω / v k ν = 2 ω / v k_(nu)=2omega//vk_{\nu}=2 \omega / vkν=2ω/v. The region in the ω k y ω k y omega-k_(y)\omega-k_{y}ωky plane below the radial line corresponds to the evanescent energy and that above the radial line corresponds to the propagating energy. The same transition between the two regions also are noted in the k y z k y z k_(y)-zk_{y}-zkyz plane. The zero-offset case (Figure D-4c) clearly shows the evanescent energy to the right of the point on the k z k z k_(z)k_{z}kz axis labeled as k y = 2 ω / v k y = 2 ω / v k_(y)=2omega//vk_{y}=2 \omega / vky=2ω/v dying off rapidly with depth. The width of the propagation region stays constant with depth. The nonzero-offset case shown in Figure D-4d, however, indicates that the width of the propagation region varies with depth - zero at the surface z = 0 z = 0 z=0z=0z=0 and approaching rapidly to the zero-offset case immediately at shallow depths. The physical interpretation of this depth-dependency is quite intuitive - the normalized offset wqvenumber H H HHH becomes increasingly less significant at greater depths, and the normalized midpoint wavenumber Y Y YYY becomes the dominating wavenumber. More specifically, on a CMP gather, moveout decreases with depth which implies nearly zero H H HHH.
Figure D-5 shows the response characteristics of the dispersion relation defined by equation (D-23). Note the semi-elliptical wavefronts in the y z y z y-zy-zyz plane for a single frequency ω ω omega\omegaω; while in the y t y t y-ty-tyt plane, note the table-top traveltime trajectories. The equations for the wavefront and traveltime trajectories are derived in Section D. 2 using stationary phase approximations.
Note that in equation (D-16), the terms with different spatial wavenumbers are separable, However, we have lost the property of separation in equation (D-22) because the operators in Y Y YYY and H H HHH are strongly coupled. As a result, the Taylor series expansions of the square roots in
b
FIG. D-4. Real part of the ω k y ω k y omega-k_(y)\omega-k_{y}ωky plane at z = 200 m z = 200 m z=200mz=200 \mathrm{~m}z=200 m : (a) DSR (equation D-23) with h = 0 m h = 0 m h=0mh=0 \mathrm{~m}h=0 m, and (b) DSR with h = 400 m h = 400 m h=400mh=400 \mathrm{~m}h=400 m. Real part of the k y z k y z k_(y)-zk_{y}-zkyz plane at ω = 16 m ω = 16 m omega=16m\omega=16 \mathrm{~m}ω=16 m : (c) D S R D S R DSRD S RDSR (equation D-23) with h = 0 m h = 0 m h=0mh=0 \mathrm{~m}h=0 m, and (d) D S R D S R DSRD S RDSR with h = 400 m h = 400 m h=400mh=400 \mathrm{~m}h=400 m (Yilmaz, 1979).
equation (D-22) yield terms that contain cross-products of the two wavenumbers. The penalty for processing in the conventional coordinate system ( y , h , t ) ( y , h , t ) (y,h,t)(y, h, t)(y,h,t) is that strong coupling in the extrapolation operator requires the entire prestack data set to be handled at the same time for each depth step.
Conventional processing comprises two important steps. First, the data are organized into common-midpoint (CMP) gathers, and normal-moveout (NMO) correction is applied to each
FIG. D-5. The response charscteristics of the DSR operator (equation D-23) (Yilmaz, 1979). (a) Real part of the y z y z y-zy-zyz plane at 16 H z 16 H z 16Hz16 \mathrm{~Hz}16 Hz and h = 400 m h = 400 m h=400mh=400 \mathrm{~m}h=400 m. Note the semielliptical wavefronts. (b) Real part of the y z y z y-zy-zyz plane at t = 1024 m s , h = 400 m t = 1024 m s , h = 400 m t=1024ms,h=400mt=1024 \mathrm{~ms}, h=400 \mathrm{~m}t=1024 ms,h=400 m. Because of the wraparound in h h hhh, we observe two wavefronts, one for h = 400 m h = 400 m h=400mh=400 \mathrm{~m}h=400 m and one for h = 0 h = 0 h=0h=0h=0. (c) Real part of the y t y t y-ty-tyt plane at z = 200 , 400 , 600 z = 200 , 400 , 600 z=200,400,600z=200,400,600z=200,400,600, and 800 in superimposed. These are the table-top trajectories for h = 400 m h = 400 m h=400mh=400 \mathrm{~m}h=400 m. The loci of the arrival times are determined by a stationary-phase approximation to DSR (see Section D.2) (Clayton, 1978). Periodicity in y y yyy and t t ttt result from approximating Fourier integrals by sums.
gather. The time shift Δ t = t ( h ) t 0 Δ t = t ( h ) t 0 Delta t=t(h)-t_(0)\Delta t=t(h)-t_{0}Δt=t(h)t0 associated with the NMO correction is given by
Δ t = t 0 [ 1 + ( 2 h v t 0 ) 2 1 ] Δ t = t 0 1 + 2 h v t 0 2 1 Delta t=t_(0)[sqrt(1+((2h)/(vt_(0)))^(2))-1]\Delta t=t_{0}\left[\sqrt{1+\left(\frac{2 h}{v t_{0}}\right)^{2}}-1\right]Δt=t0[1+(2hvt0)21]
where t ( h ) t ( h ) t(h)t(h)t(h) is the two-way traveltime for a given (half) offset h h hhh, and t 0 t 0 t_(0)t_{0}t0 is the corresponding twoway zero-offset time. Here, v v vvv is the root-mean-square (ms) velocity at t 0 t 0 t_(0)t_{0}t0. Equation (D-25) is based on the stratified earth (zero-dip) assumption. After NMO correction, traces of the CMP gather are stacked. This not only reduces data volume, but also enhances the signal-to-noise ratio.
Second, the CMP stack is migrated as if it were the zero-offset wavefield generated by exploding reflectors (Section 4.0). The equation used for the downward extrapolation portion of migration is the solution to the one-way wave equation (equation D-12).
To account for the one-way traveltime of the exploding reflectors model, the velocity used in extrapolation is taken as half the medium velocity. Thus, the vertical wavenumber given by equation (D-11) is expressed as
k z = 2 ω v 1 ( v k y 2 ω ) 2 k z = 2 ω v 1 v k y 2 ω 2 k_(z)=(2omega)/(v)sqrt(1-((vk_(y))/(2omega))^(2))k_{z}=\frac{2 \omega}{v} \sqrt{1-\left(\frac{v k_{y}}{2 \omega}\right)^{2}}kz=2ωv1(vky2ω)2
where v v vvv can be varied with depth z z zzz. (Since migration is done in midpoint space, k x k x k_(x)k_{x}kx has been replaced with k y k y k_(y)k_{y}ky.)
Some of the current migration techniques based on wave extrapolation use certain rational approximations to equation (D-26), while some implement the exact form in the frequencywavenumber domain (Section 4.1).
Conventional processing theory has an advantage over the exact theory represented by the DSR equation in midpoint-offet space (equation D-22). Unlike the approach based on the D S R D S R DSRD S RDSR equation, the conventional approach is composed of two separable operators the NMO correction and stack applied in offset space, and migration applied in mjdpoint space. However, this advantage is based on zero-dip and zero-offset assumptions.
Where do we go from here? On the one hand, we have an exact theory that can handle all dips and offset angles, but is difficult to implement. On the other hand, we have a conventional approach that has the convenient property of separation, but is based on the zero-dip and zero-offset assumptions.
To examine the relationship between the two approaches, we return to the exact theory and make the same two assumptions that underlie the conventional approach. The zero-dip assumption implies that the earth model is stratified in y t y t y-ty-tyt domain. The seismic energy recorded over such an earth is concentrated completely at the zero midpoint wavenumber k y = 0 k y = 0 k_(y)=0k_{y}=0ky=0. This suggests that we set the normalized wavenumber Y Y YYY equal to zero in D S R D S R DSRD S RDSR as defined by equation (D-22). The resulting operator here is defined as the stacking (St) operator
S t ( H ) = 2 1 H 2 S t ( H ) = 2 1 H 2 St(H)=2sqrt(1-H^(2))S t(H)=2 \sqrt{1-H^{2}}St(H)=21H2
As shown in Section D.2, the NMO shift given by equation (D-25) is a stationary-phase approximation to equation (D-27) (Clayton, 1978). The S t ( H ) S t ( H ) St(H)S t(H)St(H) operator condenses primary information on a CMP gather down to zero offset. After applying this operator on a CMP gather, we may keep the zero-offset trace and abandon all other offsets. Since a CMP stack can be regarded as a zero-offset wavefield, equation (D-27) is a zero-dip NMO and stack-type operator.
Application of the zero-offset ( h = 0 ) ( h = 0 ) (h=0)(h=0)(h=0) assumption into the D S R D S R DSRD S RDSR operator is more subtle. On a CMP gather at and near h = 0 h = 0 h=0h=0h=0, energy essentially is concentrated at zero value of the offset wavenumber k h = 0 k h = 0 k_(h)=0k_{h}=0kh=0. In fact, NMO correction tries to push the primary energy on a CMP gather toward k h = 0 k h = 0 k_(h)=0k_{h}=0kh=0. Therefore, by setting the normalized offset wavenumber H = 0 H = 0 H=0H=0H=0 in equation (D-22), the exploding reflectors (ER) migration operator can be expressed as
E R ( Y ) = 2 1 Y 2 E R ( Y ) = 2 1 Y 2 ER(Y)=2sqrt(1-Y^(2))E R(Y)=2 \sqrt{1-Y^{2}}ER(Y)=21Y2
Equation (D-28) is an approximation, because setting H = 0 H = 0 H=0H=0H=0 is not exactly the same as setting h = 0 h = 0 h=0h=0h=0. By setting H = 0 H = 0 H=0H=0H=0 in equation (D-22) and using the dispersion relation given by equation (D-23), we have the zero-offset vertical wavenumber
k z = 2 ω v 1 Y 2 k z = 2 ω v 1 Y 2 k_(z)=(2omega)/(v)sqrt(1-Y^(2))k_{z}=\frac{2 \omega}{v} \sqrt{1-Y^{2}}kz=2ωv1Y2
By substituting the definition for Y Y YYY from equation (D-21a) into equation (D-29), we obtain
k z = 2 ω v 1 ( v k y 2 ω ) 2 k z = 2 ω v 1 v k y 2 ω 2 k_(z)=(2omega)/(v)sqrt(1-((vk_(y))/(2omega))^(2))k_{z}=\frac{2 \omega}{v} \sqrt{1-\left(\frac{v k_{y}}{2 \omega}\right)^{2}}kz=2ωv1(vky2ω)2
FIG. D-6. The response characteristics of the exploding reflectors operator E R ( Y ) E R ( Y ) ER(Y)E R(Y)ER(Y) (equation D-29) (Yilmaz, 1979). (a) Real part of the y z y z y-zy-zyz plane at 16 H z 16 H z 16Hz16 \mathrm{~Hz}16 Hz. Note the circular wavefronts. (b) Real part of the y z y z y-zy-zyz plane at t = 1024 m s t = 1024 m s t=1024mst=1024 \mathrm{~ms}t=1024 ms. (c) Real part of the y t y t y-ty-tyt plane at z = 200 , 400 , 600 z = 200 , 400 , 600 z=200,400,600z=200,400,600z=200,400,600, and 800 m 800 m 800m800 \mathrm{~m}800 m superimposed. These are the hyperbolic trajectories. The loci of the arrival times are determined via the stationary-phase approximation to E R ( Y ) E R ( Y ) ER(Y)E R(Y)ER(Y) (see section D.2) (Clayton, 1978). Periodicity in y y yyy and t t ttt result from approximating Fourier integrals by sums.
which is identical to equation (D-26), We conclude that the zero-ofset migration operator E R ( Y ) E R ( Y ) ER(Y)E R(Y)ER(Y) (equation D-28) derived from the D S R D S R DSRD S RDSR equation (D-22) is identical to the migration operator that is based on the exploding reflectors model of conventional processing.
Figure D-6 shows the response characteristics of the dispersion relation defined by equation (D-30). Note the semicircular wavefronts in the y z y z y-zy-zyz plane and the hyperbolic traveltime curves in the y t y t y-ty-tyt plane. Compare these with the response of the complete D S R D S R DSRD S RDSR operator for the nonzero-offset case in Figure D-5. The equations for the wavefront and traveltime trajectories are derived in Section D. 2 using stationary phase approximations.

D. 2 Stationary Phase Approximations

In this section, we shall use the method of stationary phase to derive the traveltime equation inferred by the double square root equation for nonzero-offset source-receiver separation. Consider the double square root operator defined by equation (D-22) with the wavenurnbers Y Y YYY and H H HHH defined by equations (D-21a,b). We want to operate on the transformed wavefield P ( k y , k h , z = 0 , ω ) P k y , k h , z = 0 , ω P(k_(y),k_(h),z=0,omega)P\left(k_{y}, k_{h}, z=0, \omega\right)P(ky,kh,z=0,ω) with the D S R D S R DSRD S RDSR operator. Subsequent inverse Fourier transformation will yield the wavefield P ( y , h , z , t ) P ( y , h , z , t ) P(y,h,z,t)P(y, h, z, t)P(y,h,z,t) :
P ( y , h , z , t ) = P ( k t , k h , z = 0 , ω ) exp ( i Φ z ) d k y d k h d ω P ( y , h , z , t ) = P k t , k h , z = 0 , ω exp ( i Φ z ) d k y d k h d ω P(y,h,z,t)=∭P(k_(t),k_(h),z=0,omega)exp(i Phi z)dk_(y)dk_(h)d omegaP(y, h, z, t)=\iiint P\left(k_{t}, k_{h}, z=0, \omega\right) \exp (i \Phi z) d k_{y} d k_{h} d \omegaP(y,h,z,t)=P(kt,kh,z=0,ω)exp(iΦz)dkydkhdω
where the total phase Φ Φ Phi\PhiΦ, normalized with respect to z z zzz, is given by
Φ = ω v D S R ( Y , H ) k y y z k h h z + ω t z Φ = ω v D S R ( Y , H ) k y y z k h h z + ω t z Phi=-(omega )/(v)DSR(Y,H)-k_(y)(y)/(z)-k_(h)(h)/(z)+omega(t)/(z)\Phi=-\frac{\omega}{v} D S R(Y, H)-k_{y} \frac{y}{z}-k_{h} \frac{h}{z}+\omega \frac{t}{z}Φ=ωvDSR(Y,H)kyyzkhhz+ωtz
The main contribution to integration in equation (D-31) occurs when the phase stays nearly constant. We therefore determine the variation of the phase with respect to variables k y , k h k y , k h k_(y),k_(h)k_{y}, k_{h}ky,kh, and ω ω omega\omegaω
Φ k y = ω v D S R Y Y k v y z Φ k h = ω v D S R H H k h h z Φ k y = ω v D S R Y Y k v y z Φ k h = ω v D S R H H k h h z {:[(del Phi)/(delk_(y))=-(omega )/(v)(del DSR)/(del Y)(del Y)/(delk_(v))-(y)/(z)],[(del Phi)/(delk_(h))=-(omega )/(v)(del DSR)/(del H)(del H)/(delk_(h))-(h)/(z)]:}\begin{aligned} & \frac{\partial \Phi}{\partial k_{y}}=-\frac{\omega}{v} \frac{\partial D S R}{\partial Y} \frac{\partial Y}{\partial k_{v}}-\frac{y}{z} \\ & \frac{\partial \Phi}{\partial k_{h}}=-\frac{\omega}{v} \frac{\partial D S R}{\partial H} \frac{\partial H}{\partial k_{h}}-\frac{h}{z} \end{aligned}Φky=ωvDSRYYkvyzΦkh=ωvDSRHHkhhz
and
Φ ω = 1 v D S R ω v [ D S R H H ω + D S R Y Y ω ] + t z Φ ω = 1 v D S R ω v D S R H H ω + D S R Y Y ω + t z (del Phi)/(del omega)=-(1)/(v)DSR-(omega )/(v)[(del DSR)/(del H)(del H)/(del omega)+(del DSR)/(del Y)(del Y)/(del omega)]+(t)/(z)\frac{\partial \Phi}{\partial \omega}=-\frac{1}{v} D S R-\frac{\omega}{v}\left[\frac{\partial D S R}{\partial H} \frac{\partial H}{\partial \omega}+\frac{\partial D S R}{\partial Y} \frac{\partial Y}{\partial \omega}\right]+\frac{t}{z}Φω=1vDSRωv[DSRHHω+DSRYYω]+tz
and set each variation to zero. Substitute equation (D-32) and carry out the differentiations in equations (D-33a,b,c) to ohtain
1 2 G 1 G 2 + 1 2 S 1 S 2 = y z 1 2 G 1 G 2 1 2 S 1 S 2 = h z 1 2 G 1 G 2 + 1 2 S 1 S 2 = y z 1 2 G 1 G 2 1 2 S 1 S 2 = h z {:[(1)/(2)(G)/(sqrt(1-G^(2)))+(1)/(2)(S)/(sqrt(1-S^(2)))=(y)/(z)],[(1)/(2)(G)/(sqrt(1-G^(2)))-(1)/(2)(S)/(sqrt(1-S^(2)))=(h)/(z)]:}\begin{aligned} & \frac{1}{2} \frac{G}{\sqrt{1-G^{2}}}+\frac{1}{2} \frac{S}{\sqrt{1-S^{2}}}=\frac{y}{z} \\ & \frac{1}{2} \frac{G}{\sqrt{1-G^{2}}}-\frac{1}{2} \frac{S}{\sqrt{1-S^{2}}}=\frac{h}{z} \end{aligned}12G1G2+12S1S2=yz12G1G212S1S2=hz
and
1 1 G 2 + 1 1 S 2 = v t z 1 1 G 2 + 1 1 S 2 = v t z (1)/(sqrt(1-G^(2)))+(1)/(sqrt(1-S^(2)))=(vt)/(z)\frac{1}{\sqrt{1-G^{2}}}+\frac{1}{\sqrt{1-S^{2}}}=\frac{v t}{z}11G2+11S2=vtz
where G G GGG and S S SSS are defined by equations (D-20a, b).
Now, elininate G G GGG and S S SSS amongst equations (D-34a,b,c) to get the final expression from stationary phase approximation to the double square root equation as
( y + h ) 2 + z 2 + ( y h ) 2 + z 2 = v t . ( y + h ) 2 + z 2 + ( y h ) 2 + z 2 = v t . sqrt((y+h)^(2)+z^(2))+sqrt((y-h)^(2)+z^(2))=vt.\sqrt{(y+h)^{2}+z^{2}}+\sqrt{(y-h)^{2}+z^{2}}=v t .(y+h)2+z2+(yh)2+z2=vt.
This is the equation of an ellipse in the y z y z y-zy-zyz plane at constant t t ttt (Section E.5). Figure D-5 shows the elliptic wavefront and the table-top traveltime trajectory described by equation (D-35).
When equation (D-35) is specialized to the zero-offset case, h = 0 h = 0 h=0h=0h=0. we obtain
y 2 + z 2 = v t 2 y 2 + z 2 = v t 2 sqrt(y^(2)+z^(2))=(vt)/(2)\sqrt{y^{2}+z^{2}}=\frac{v t}{2}y2+z2=vt2
which is a circle in the y z y z y-zy-zyz plane at constant t t ttt and a byperbola in the y t y t y-ty-tyt plane at constant z. Figure D-6 shows the circular wavefront and the hyperbolic traveltime trajectory described by equation (D-36).
by
We now consider the stacking operator defined by equation (D-27). The total phase is given
Φ = ω v S t ( H ) k h h z + ω t z Φ = ω v S t ( H ) k h h z + ω t z Phi=-(omega )/(v)St(H)-k_(h)(h)/(z)+omega(t)/(z)\Phi=-\frac{\omega}{v} S t(H)-k_{h} \frac{h}{z}+\omega \frac{t}{z}Φ=ωvSt(H)khhz+ωtz
Differentiate equation (D-37) with respect to k h k h k_(h)k_{h}kh and ω ω omega\omegaω and set the results to zero to obtein
H 1 H 2 = h z H 1 H 2 = h z (H)/(sqrt(1-H^(2)))=(h)/(z)\frac{H}{\sqrt{1-H^{2}}}=\frac{h}{z}H1H2=hz
and
1 1 H 2 = v t 2 z 1 1 H 2 = v t 2 z (1)/(sqrt(1-H^(2)))=(vt)/(2z)\frac{1}{\sqrt{1-H^{2}}}=\frac{v t}{2 z}11H2=vt2z
Now, eliminate H H HHH between equations (D-38a) and (D-38b) to obtain the stationary phase approximation to the stacking operator:
h 2 + z 2 = v t 2 h 2 + z 2 = v t 2 sqrt(h^(2)+z^(2))=(vt)/(2)\sqrt{h^{2}+z^{2}}=\frac{v t}{2}h2+z2=vt2
Definc the zero-offset time as t 0 = 2 z / v t 0 = 2 z / v t_(0)=2z//vt_{0}=2 z / vt0=2z/v and substitute into equation (D-39a) to get
h 2 + ( v t 0 2 ) 2 = v t 2 h 2 + v t 0 2 2 = v t 2 sqrt(h^(2)+((vt_(0))/(2))^(2))=(vt)/(2)\sqrt{h^{2}+\left(\frac{v t_{0}}{2}\right)^{2}}=\frac{v t}{2}h2+(vt02)2=vt2
Finally, rearrange to get the equation for normal moveout:
Δ t N M O = t 0 [ 1 + ( 2 h v t 0 ) 2 1 ] Δ t N M O = t 0 1 + 2 h v t 0 2 1 Deltat_(NMO)=t_(0)[sqrt(1+((2h)/(vt_(0)))^(2))-1]\Delta t_{N M O}=t_{0}\left[\sqrt{1+\left(\frac{2 h}{v t_{0}}\right)^{2}}-1\right]ΔtNMO=t0[1+(2hvt0)21]
where Δ t N M O = t t 0 Δ t N M O = t t 0 Deltat_(NMO)=t-t_(0)\Delta t_{N M O}=t-t_{0}ΔtNMO=tt0. This is the same equation as equation ( 3 2 b ) ( 3 2 b ) (3-2b)(3-2 \mathrm{~b})(32 b) in the main text with offset defined as x = 2 h x = 2 h x=2hx=2 hx=2h.

D. 3 The Parabolic Approximation

Start with the dispersion relation defined by equation (D-6) recast for the exploding reflectors model for which v v vvv is replaced with v / 2 v / 2 v//2v / 2v/2 to obtain
k z = 2 ω v 1 ( v k x 2 ω ) 2 k z = 2 ω v 1 v k x 2 ω 2 k_(z)=(2omega)/(v)sqrt(1-((vk_(x))/(2omega))^(2))k_{z}=\frac{2 \omega}{v} \sqrt{1-\left(\frac{v k_{x}}{2 \omega}\right)^{2}}kz=2ωv1(vkx2ω)2
Then apply Taylor series expansion and retain the first two terms:
k z = 2 ω v [ 1 1 2 ( v k x 2 ω ) 2 ] k z = 2 ω v 1 1 2 v k x 2 ω 2 k_(z)=(2omega)/(v)[1-(1)/(2)((vk_(x))/(2omega))^(2)]k_{z}=\frac{2 \omega}{v}\left[1-\frac{1}{2}\left(\frac{v k_{x}}{2 \omega}\right)^{2}\right]kz=2ωv[112(vkx2ω)2]
By simplifying, we get the dispersion relation associated with the parabolic equation
k z = 2 ω v v k x 2 4 ω k z = 2 ω v v k x 2 4 ω k_(z)=(2omega)/(v)-(vk_(x)^(2))/(4omega)k_{z}=\frac{2 \omega}{v}-\frac{v k_{x}^{2}}{4 \omega}kz=2ωvvkx24ω
By operating on the wavefield P ( x , z , t ) P ( x , z , t ) P(x,z,t)P(x, z, t)P(x,z,t) and replacing i k z P i k z P -ik_(z)P-i k_{z} PikzP with P / z P / z del P//del z\partial P / \partial zP/z, we write the corresponding differential equation as
P z = i ( 2 ω v v k x 2 4 ω ) P P z = i 2 ω v v k x 2 4 ω P (del P)/(del z)=-i((2omega)/(v)-(vk_(x)^(2))/(4omega))P\frac{\partial P}{\partial z}=-i\left(\frac{2 \omega}{v}-\frac{v k_{x}^{2}}{4 \omega}\right) PPz=i(2ωvvkx24ω)P
Derivation of equation (D-43) is bascd on the constant-velocity assumption. Nevertheless, just as we did for the 90 -degree one-way wave equation (D-10), the 15-degree onc-way wave
equation (D-43) can be recast using a vertically varying velocity function v ( z ) v ( z ) v(z)v(z)v(z). Going one step further, once equation (D-43) is inverse Fourier transformed from the horizontal wavenumber k x k x k_(x)k_{x}kx to the horizontal axis x x xxx, we will replace v ( z ) v ( z ) v(z)v(z)v(z) with a laterally varying velocity function v ( x , z ) v ( x , z ) v(x,z)v(x, z)v(x,z). Theoretically, this may not be permissible, but in practice, its validity is widely accepted.
The effect of translation is removed by retardation (Figure 4.1-18):
τ = 2 0 z d z v ¯ ( z ) τ = 2 0 z d z v ¯ ( z ) tau=2int_(0)^(z)(dz)/(( bar(v))(z))\tau=2 \int_{0}^{z} \frac{d z}{\bar{v}(z)}τ=20zdzv¯(z)
where v ¯ ( z ) v ¯ ( z ) bar(v)(z)\bar{v}(z)v¯(z) generally is chosen to be a horizontal average of v ( x , z ) v ( x , z ) v(x,z)v(x, z)v(x,z). The time shift defined by equation (D-44) is equivalent to a phase shift in the frequency domain. Therefore, the actual wavefield P P PPP is related to the time-shifted wavefield Q Q QQQ by
P = Q exp ( i ω τ ) P = Q exp ( i ω τ ) P=Q exp(-i omega tau)P=Q \exp (-i \omega \tau)P=Qexp(iωτ)
By differentiating with respect to z z zzz, we get
P z = ( z i 2 ω v ¯ ( z ) ) Q exp ( i ω τ ) P z = z i 2 ω v ¯ ( z ) Q exp ( i ω τ ) (del P)/(del z)=((del)/(del z)-i(2omega)/(( bar(v))(z)))Q exp(-i omega tau)\frac{\partial P}{\partial z}=\left(\frac{\partial}{\partial z}-i \frac{2 \omega}{\bar{v}(z)}\right) Q \exp (-i \omega \tau)Pz=(zi2ωv¯(z))Qexp(iωτ)
Finally, by substituting equations (D-45) and (D-46) into equation (D-43), we obtain
Q z = i v k x 2 4 ω Q + i 2 ω [ 1 v ¯ ( z ) 1 v ] Q Q z = i v k x 2 4 ω Q + i 2 ω 1 v ¯ ( z ) 1 v Q (del Q)/(del z)=i(vk_(x)^(2))/(4omega)Q+i2omega[(1)/(( bar(v))(z))-(1)/(v)]Q\frac{\partial Q}{\partial z}=i \frac{v k_{x}^{2}}{4 \omega} Q+i 2 \omega\left[\frac{1}{\bar{v}(z)}-\frac{1}{v}\right] QQz=ivkx24ωQ+i2ω[1v¯(z)1v]Q
The first term on the right side of this equation is called the diffraction term and the second term is called the than-lens term.
Consider the special case of v = v ¯ ( z ) v = v ¯ ( z ) v= bar(v)(z)v=\bar{v}(z)v=v¯(z). The thin-lens term then vanishes and we are left with
Q z = i v k x 2 4 ω Q Q z = i v k x 2 4 ω Q (del Q)/(del z)=i(vk_(x)^(2))/(4omega)Q\frac{\partial Q}{\partial z}=i \frac{v k_{x}^{2}}{4 \omega} QQz=ivkx24ωQ
After inverse Fourier transforming, we obtain the parabolic differential equation
2 Q z t = v 4 2 Q x 2 2 Q z t = v 4 2 Q x 2 (del^(2)Q)/(del z del t)=(v)/(4)(del^(2)Q)/(delx^(2))\frac{\partial^{2} Q}{\partial z \partial t}=\frac{v}{4} \frac{\partial^{2} Q}{\partial x^{2}}2Qzt=v42Qx2
where, in practice, velocity can be varied horizontally as well as vertically.
In some practical implementations of equation (D-48), downward continuation is performed in τ τ tau\tauτ rather than z z zzz. The migrated section then is displayed in time τ τ tau\tauτ and the process is called time migration. The two variables z z zzz and τ τ tau\tauτ are related by equation (D-44). The dispersion relation in equation (D-41) for the scalar wave equation in terms of ω τ = v k z / 2 ω τ = v k z / 2 omega_(tau)=vk_(z)//2\omega_{\tau}=v k_{z} / 2ωτ=vkz/2, the Fourier dual of τ τ tau\tauτ, takes the form
ω τ = ω 1 ( v k z 2 ω ) 2 ω τ = ω 1 v k z 2 ω 2 omega_(tau)=omegasqrt(1-((vk_(z))/(2omega))^(2))\omega_{\tau}=\omega \sqrt{1-\left(\frac{v k_{z}}{2 \omega}\right)^{2}}ωτ=ω1(vkz2ω)2
By squaring both sides, we get the equation of an ellipse in the ω r k x ω r k x omega_(r)-k_(x)\omega_{r}-k_{x}ωrkx plane.
The dispersion relation in equation (D-42b) for the parabolic equation, also expressed in terms of ω r ω r omega_(r)\omega_{r}ωr, takes the form
ω τ = ω v 2 k x 2 8 ω ω τ = ω v 2 k x 2 8 ω omega_(tau)=omega-(v^(2)k_(x)^(2))/(8omega)\omega_{\tau}=\omega-\frac{v^{2} k_{x}^{2}}{8 \omega}ωτ=ωv2kx28ω
which is the equation of a parabola in the ω τ k x 1 ω τ k x 1 omega_(tau)-k_(x_(1))\omega_{\tau}-k_{x_{1}}ωτkx1 plane. The first term is associated with a vertical time shift that can be removed by retardation. To obtain the differential equation in terns of τ τ tau\tauτ, equivalent to equation (D-48), apply the second term on the right side of equation (D-49b) to the retarded waveficld Q Q QQQ as defined by equation (D-45) and inverse Fourier transform
2 Q τ t = v 2 8 2 Q x 2 2 Q τ t = v 2 8 2 Q x 2 (del^(2)Q)/(del tau del t)=(v^(2))/(8)(del^(2)Q)/(delx^(2))\frac{\partial^{2} Q}{\partial \tau \partial t}=\frac{v^{2}}{8} \frac{\partial^{2} Q}{\partial x^{2}}2Qτt=v282Qx2
This equation is the basis for the 15-degree time migration algorithms.
The dispersion relations given by equations (D-49a) and (D-49b) are plotted in Figure D-7 for constant velocity v v vvv and input frequency ω = F E ω = F E omega=FE\omega=F Eω=FE. Curve 1 is associated with the 90-degree scalar wave equation and is the same as shown in Fignre 4.1-25, except that the latter is in terms of k z k z k_(z)k_{z}kz. Point A A AAA is mapped onto point B B BBB after migration with the 90-degree equation (D-49a). The same point A A AAA is mapped onto point C C CCC after migration with the 15 -degree equation (D-49b). The dispersion curve 2 for the parabolic equation increasingly departs from the dispersion curve 1 for the exact wave equation as the dip gets steeper. (The dip before migration is measured as the angle between the vertical axis F E F E FE\mathrm{FE}FE and radial direction F A F A FAF AFA.) Thus, the parabolic equation causes more and more undermigration as dip increases.

D. 4 Frequency-Space Implicit Schernes

Higher-order approximations to the dispersion relation (equation D-41) of the one-way equation can be found by continued fraction expansion (Claerbout, 1985). When equation (D-41) is rewritten, we have
k z = 2 ω v R k z = 2 ω v R k_(z)=(2omega)/(v)Rk_{z}=\frac{2 \omega}{v} Rkz=2ωvR
where
R = 1 X 2 R = 1 X 2 R=sqrt(1-X^(2))R=\sqrt{1-X^{2}}R=1X2
with
X = v k z 2 ω X = v k z 2 ω X=(vk_(z))/(2omega)X=\frac{v k_{z}}{2 \omega}X=vkz2ω
The various orders of approximations to equation (D-51b) are defined by the following recurrence relation
R n + 1 = 1 X 2 1 + R n R n + 1 = 1 X 2 1 + R n R_(n+1)=1-(X^(2))/(1+R_(n))R_{n+1}=1-\frac{X^{2}}{1+R_{n}}Rn+1=1X21+Rn
with the initial value R 0 = 1 R 0 = 1 R_(0)=1R_{0}=1R0=1. By setting n = 0 n = 0 n=0n=0n=0 in cquation (D-52), we have
R k = 1 X 2 2 . R k = 1 X 2 2 . R_(k)=1-(X^(2))/(2).R_{k}=1-\frac{X^{2}}{2} .Rk=1X22.
Then, substitution of equation (D-53) into equation (D-51a) yields
k z = 2 ω v ( 1 X 2 2 ) k z = 2 ω v 1 X 2 2 k_(z)=(2omega)/(v)(1-(X^(2))/(2))k_{z}=\frac{2 \omega}{v}\left(1-\frac{X^{2}}{2}\right)kz=2ωv(1X22)
which is the same equation obtained with the parabolic approximation, equation (D-42 u u uuu ).
The next higher-order expansion is obtained by setting n = 1 n = 1 n=1n=1n=1 in equation (D-52) and using equation (D-53) to obtain
R 2 = 1 X 2 2 X 2 2 R 2 = 1 X 2 2 X 2 2 R_(2)=1-(X^(2))/(2-(X^(2))/(2))R_{2}=1-\frac{X^{2}}{2-\frac{X^{2}}{2}}R2=1X22X22
This is referred to as the 45-degrce approximation to equation (D-41).
Ma (1981) discovered that the recurrence relation for the continuous fraction expansion can be expressed as ratios of two polynomials for the even-ordered expansions. He also showed that the expression can be split into the following partial fractions:
R 2 n = 1 i = 1 n α i X 2 1 β 1 X 2 R 2 n = 1 i = 1 n α i X 2 1 β 1 X 2 R_(2n)=1-sum_(i=1)^(n)(alpha_(i)X^(2))/(1-beta_(1)X^(2))R_{2 n}=1-\sum_{i=1}^{n} \frac{\alpha_{i} X^{2}}{1-\beta_{1} X^{2}}R2n=1i=1nαiX21β1X2
FIG. D-7. Dispersion relations for the 90-degree equation (D-49a), 15-degree equation (D-49b) and the 45-degree equation (D-60a) with α 1 = 0.5 α 1 = 0.5 alpha_(1)=0.5\alpha_{1}=0.5α1=0.5 and β 1 = 0.25 β 1 = 0.25 beta_(1)=0.25\beta_{1}=0.25β1=0.25, plotted on the ω τ k x ω τ k x omega_(tau)-k_(x)\omega_{\tau}-k_{x}ωτkx plane for a given input frequency, where ω = F E ω = F E omega=FE\omega=F Eω=FE and velocity is v v vvv. Input frequency ω = F E = A P ω = F E = A P omega=FE=AP\omega=F E=A Pω=FE=AP is mapped on to output frequency ω τ ω τ omega_(tau)\omega_{\tau}ωτ which is P B , P C P B , P C PB,PC\mathrm{PB}, \mathrm{PC}PB,PC, and P D P D PD\mathrm{PD}PD for the 90-degree, 15-degree, and 45-degree equations, respectively. The wavenumber at the intersection of the curves along the k x k x k_(x)k_{x}kx exis is 2 ω / v , 2 2 ω / v 2 ω / v , 2 2 ω / v 2omega//v,2sqrt2omega//v2 \omega / v, 2 \sqrt{2} \omega / v2ω/v,22ω/v, and ( 4 ω ) / ( 3 v ) ( 4 ω ) / ( 3 v ) (4omega)//(sqrt3v)(4 \omega) /(\sqrt{3} v)(4ω)/(3v) for the 90-degree, 15-degree, and 45-degree equations, respectively.
For exanple, when n = 1 n = 1 n=1n=1n=1,
R 2 = 1 α 1 X 2 1 β 1 X 2 R 2 = 1 α 1 X 2 1 β 1 X 2 R_(2)=1-(alpha_(1)X^(2))/(1-beta_(1)X^(2))R_{2}=1-\frac{\alpha_{1} X^{2}}{1-\beta_{1} X^{2}}R2=1α1X21β1X2
which is equivalent to the 45-degree expansion in equation (D-55) when α 1 = 0.5 α 1 = 0.5 alpha_(1)=0.5\alpha_{1}=0.5α1=0.5 and β 1 = 0.25 β 1 = 0.25 beta_(1)=0.25\beta_{1}=0.25β1=0.25. Note that expansions R 4 , R 6 , R 8 , R 4 , R 6 , R 8 , R_(4),R_(6),R_(8),cdotsR_{4}, R_{6}, R_{8}, \cdotsR4,R6,R8, are made up of surns of the 45 -degree term, each with a different set of coefficients, α 4 α 4 alpha_(4)\alpha_{4}α4 and β 4 β 4 beta_(4)\beta_{4}β4. Lee and Suh (1985) minimized the difference in the least-squares sense between R R RRR of equation (D-51a) and R 2 n R 2 n R_(2n)R_{2 n}R2n of equation (D-56) for a specified dip angle and derived optimal coefficients ( α 1 , β 2 ) α 1 , β 2 (alpha_(1),beta_(2))\left(\alpha_{1}, \beta_{2}\right)(α1,β2) for up to the 10th order (Table D-1).
Table D-1. Coefficients of optimized, fractioned, one-way wave equations (Lee and Suh, 1985).
Order, 2 n 2 n 2n2 n2n Accuracy Deg. α i α i alpha_(i)\alpha_{i}αi β 4 β 4 beta_(4)\beta_{4}β4
2 45 0.5 0.25
2 65 0.478242060 0.376369527
4 80 0.040315157 0.873981642
6 87 0.457289566 0 . 2 2 2 6 9 1 9 8 3 0 . 2 2 2 6 9 1 9 8 3 0.222691983\mathbf{0 . 2 2 2 6 9 1 9 8 3}0.222691983
0.004210420 0.972926132
8 90 90 90-90-90 0.081312882 0.744418059
0.414236605 0.150843924
0.000523275 0.994065088
0.014853510 0.919432661
90 0.117592008 0.614520676
0.367013245 0.105756624
0.000153427 0.997370236
0.004172967 0.964827992
0.033860918 0.824918565
0.143798076 0.483340757
Order, 2n Accuracy Deg. alpha_(i) beta_(4) 2 45 0.5 0.25 2 65 0.478242060 0.376369527 4 80 0.040315157 0.873981642 6 87 0.457289566 0.222691983 0.004210420 0.972926132 8 90- 0.081312882 0.744418059 0.414236605 0.150843924 0.000523275 0.994065088 0.014853510 0.919432661 90 0.117592008 0.614520676 0.367013245 0.105756624 0.000153427 0.997370236 0.004172967 0.964827992 0.033860918 0.824918565 0.143798076 0.483340757| Order, $2 n$ | Accuracy Deg. | $\alpha_{i}$ | $\beta_{4}$ | | :--- | :---: | ---: | ---: | | 2 | 45 | 0.5 | 0.25 | | 2 | 65 | 0.478242060 | 0.376369527 | | 4 | 80 | 0.040315157 | 0.873981642 | | 6 | 87 | 0.457289566 | $\mathbf{0 . 2 2 2 6 9 1 9 8 3}$ | | | | 0.004210420 | 0.972926132 | | 8 | $90-$ | 0.081312882 | 0.744418059 | | | | 0.414236605 | 0.150843924 | | | | 0.000523275 | 0.994065088 | | | | 0.014853510 | 0.919432661 | | | 90 | 0.117592008 | 0.614520676 | | | | 0.367013245 | 0.105756624 | | | | 0.000153427 | 0.997370236 | | | | 0.004172967 | 0.964827992 | | | | 0.033860918 | 0.824918565 | | | | 0.143798076 | 0.483340757 |
We now derive the differential equation associated with the 45-degree dispersion relation. By substituting equation (D-57) and the definition for X X XXX given by equation (51c) into equation (D-51a), we obtain
k z = 2 ω v [ 1 α x 1 v 2 k x 2 4 ω 2 1 1 β 1 v 2 k x 2 4 ω 2 ] k z = 2 ω v 1 α x 1 v 2 k x 2 4 ω 2 1 1 β 1 v 2 k x 2 4 ω 2 k_(z)=(2omega)/(v)[1-(alphax_(1)v^(2)k_(x)^(2))/(4omega^(2))(1)/(1-(beta_(1)v^(2)k_(x)^(2))/(4omega^(2)))]k_{z}=\frac{2 \omega}{v}\left[1-\frac{\alpha x_{1} v^{2} k_{x}^{2}}{4 \omega^{2}} \frac{1}{1-\frac{\beta_{1} v^{2} k_{x}^{2}}{4 \omega^{2}}}\right]kz=2ωv[1αx1v2kx24ω211β1v2kx24ω2]
The first term is a vertical shift that can be removed by retardation in the same manner as for the 15-degree approximation (equations D-42 through D-46). By simplifying the remaining terms of equation (D-58), we obtain
β 1 α 1 v 2 ω k z k x 2 k x 2 1 α 1 2 ω v k z = 0 β 1 α 1 v 2 ω k z k x 2 k x 2 1 α 1 2 ω v k z = 0 (beta_(1))/(alpha_(1))(v)/(2omega)k_(z)k_(x)^(2)-k_(x)^(2)-(1)/(alpha_(1))(2omega)/(v)k_(z)=0\frac{\beta_{1}}{\alpha_{1}} \frac{v}{2 \omega} k_{z} k_{x}^{2}-k_{x}^{2}-\frac{1}{\alpha_{1}} \frac{2 \omega}{v} k_{z}=0β1α1v2ωkzkx2kx21α12ωvkz=0
Finally, by operating on the retarded wavefield Q ( x , ω , z ) Q ( x , ω , z ) Q(x,omega,z)Q(x, \omega, z)Q(x,ω,z) (equation D-45), we obtain
i β 1 v 2 α 1 ω 3 Q z x 2 2 Q x 2 + ı 2 ω α 1 v Q z = 0 i β 1 v 2 α 1 ω 3 Q z x 2 2 Q x 2 + ı 2 ω α 1 v Q z = 0 i(beta_(1)v)/(2alpha_(1)omega)(del^(3)Q)/(del z delx^(2))-(del^(2)Q)/(delx^(2))+ı(2omega)/(alpha_(1)v)(del Q)/(del z)=0i \frac{\beta_{1} v}{2 \alpha_{1} \omega} \frac{\partial^{3} Q}{\partial z \partial x^{2}}-\frac{\partial^{2} Q}{\partial x^{2}}+\imath \frac{2 \omega}{\alpha_{1} v} \frac{\partial Q}{\partial z}=0iβ1v2α1ω3Qzx22Qx2+ı2ωα1vQz=0
Kjartansson (1979) implemented equation (D-59b) for 45-degree modeling and migration in the frequency-space domain. Migration in the frequency-space domain (commonly known as the ω x ω x omega-x\omega-xωx algorithm) involves two interleaved operations:
(a) a time shift based on equation (D-45), which is velocity-independent for time migration and velocity-dependent for depth migration, and
(b) focusing the diffraction energy using equation (D-59b).
Once you have a code for the basic 45-degree operator, it is easy to implement the higherorder approximations that are given by equation (D-56) with the associated coefficients in Table D-1. Note that the difference between the 4 5 4 5 45\mathbf{4 5}45-degree and 65 -degree algorithms is the values used for coefficients ( α 1 , β 1 ) α 1 , β 1 (alpha_(1),beta_(1))\left(\alpha_{1}, \beta_{1}\right)(α1,β1). Also note that the 15-degree equation (D-47b) is obtained from equation (D-59b) by setting α 1 = 0.5 α 1 = 0.5 alpha_(1)=0.5\alpha_{1}=0.5α1=0.5 and β 1 = 0 β 1 = 0 beta_(1)=0\beta_{1}=0β1=0.
The dispersion relation in equation (D-58) also can be expressed in terms of ω τ = v k z / 2 ω τ = v k z / 2 omega_(tau)=vk_(z)//2\omega_{\tau}=v k_{z} / 2ωτ=vkz/2, the Fourier dual of the time variable τ τ tau\tauτ associated with the migrated data:
ω r = ω α 1 ω v 2 k x 2 4 ω 2 β 1 v 2 k x 2 ω r = ω α 1 ω v 2 k x 2 4 ω 2 β 1 v 2 k x 2 omega_(r)=omega-(alpha_(1)omegav^(2)k_(x)^(2))/(4omega^(2)-beta_(1)v^(2)k_(x)^(2))\omega_{r}=\omega-\frac{\alpha_{1} \omega v^{2} k_{x}^{2}}{4 \omega^{2}-\beta_{1} v^{2} k_{x}^{2}}ωr=ωα1ωv2kx24ω2β1v2kx2
The first term is associated with a vertical time shift that can be removed by retardation as for the 15-degree equation (D-49b).
To obtais the differential equation in terms of τ τ tau\tauτ, equivalent to equation (D-59b), apply the second term on the right side of equation (D-60a) to the retarded wavefield Q Q QQQ as defined by equation (D-45) and inverse Fourier transform:
i β 1 α 1 ω 3 Q τ x 2 2 Q x 2 + i 4 ω α 1 v 2 Q τ = 0 i β 1 α 1 ω 3 Q τ x 2 2 Q x 2 + i 4 ω α 1 v 2 Q τ = 0 i(beta_(1))/(alpha_(1)omega)(del^(3)Q)/(del tau delx^(2))-(del^(2)Q)/(delx^(2))+i(4omega)/(alpha_(1)v^(2))(del Q)/(del tau)=0i \frac{\beta_{1}}{\alpha_{1} \omega} \frac{\partial^{3} Q}{\partial \tau \partial x^{2}}-\frac{\partial^{2} Q}{\partial x^{2}}+i \frac{4 \omega}{\alpha_{1} v^{2}} \frac{\partial Q}{\partial \tau}=0iβ1α1ω3Qτx22Qx2+i4ωα1v2Qτ=0
This equation is the basis for the 45 -degree and related steep-dip implicit finite-difference frequency-space time rigration algorithms.
The dispersion relation given by equation (D-60a) for the 45-degree equation, in which α 1 = 0.5 α 1 = 0.5 alpha_(1)=0.5\alpha_{1}=0.5α1=0.5 and β 1 = 0.25 β 1 = 0.25 beta_(1)=0.25\beta_{1}=0.25β1=0.25, is plotted in Figure D-7 for constant velocity v v vvv and input frequency ω = F E ω = F E omega=FE\omega=F Eω=FE. Point A A AAA is mapped onto point D D DDD after migration with the 45 -degree equation (D-60a). The dispersion curve 3 for the 45 -degree equation lies somewhere between those of the 90-degree equation (D-49a) (curve 1) and the 15-degree equation (D-49b) (curve 2).
Figure 4.4-1 shows the impulse responses of various approximations to the one-way dispersion relation based on equation (D-56). Note that the wavefronts become increasingly closer to a sernicircle as the higher-order terms are included in equation (D-56). The 15-degree approximation yields an elliptical wavefront. The 45-degree approximation yields an impulse response
of a heart shape. Refer to Section 4.4 for the practical aspects of 2-D frequency-space steep-dip time migration, and Section 7.3 for its application to 3 3 3-3-3 D migration.

D. 5 Stable Explicit Extrapolation

The exact extrapolation filter for a specific frequency ω ω omega\omegaω and velocity v v vvv is expressed in the frequency-wavenumber domain as
D ( k x ) = exp { i 2 ω v 1 ( v k x 2 ω ) 2 Δ z } D k x = exp i 2 ω v 1 v k x 2 ω 2 Δ z D(k_(x))=exp{-i(2omega)/(v)sqrt(1-((vk_(x))/(2omega))^(2))Delta z}D\left(k_{x}\right)=\exp \left\{-i \frac{2 \omega}{v} \sqrt{1-\left(\frac{v k_{x}}{2 \omega}\right)^{2}} \Delta z\right\}D(kx)=exp{i2ωv1(vkx2ω)2Δz}
The objective is to find, again for a specific frequency ω ω omega\omegaω and velocity v v vvv, an explicit filter with complex coefficients h ( x ) h ( x ) h(x)h(x)h(x) in the frequency-space domain such that, when Fourier transformed to the frequency-wavenumber domain, the difference between the actual transform H ( k x ) H k x H(k_(x))H\left(k_{x}\right)H(kx) and the desired transform D ( k x ) D k x D(k_(x))D\left(k_{x}\right)D(kx) of equation (D-61) is minimum. To ensure stability, we impose the constraint that the arnplitude of H ( k x ) H k x H(k_(x))H\left(k_{x}\right)H(kx) is never greater than unity within the propagation region k z ( 2 ω / v ) k z ( 2 ω / v ) k_(z) <= (2omega//v)k_{z} \leq(2 \omega / v)kz(2ω/v).
Consider the Fourier transform H ( k x ) H k x H(k_(x))H\left(k_{x}\right)H(kx) of the actual extrapolation filter h ( x ) h ( x ) h(x)h(x)h(x), which we will write in discrete form as h n h n h_(n)h_{n}hn :
H ( k x ) = h 0 + 2 n = 1 N h n cos ( n k x ) H k x = h 0 + 2 n = 1 N h n cos n k x H(k_(x))=h_(0)+2sum_(n=1)^(N)h_(n)cos(nk_(x))H\left(k_{x}\right)=h_{0}+2 \sum_{n=1}^{N} h_{n} \cos \left(n k_{x}\right)H(kx)=h0+2n=1Nhncos(nkx)
where 2 N + 1 2 N + 1 2N+12 N+12N+1 is the length of the symmetric filter h n h n h_(n)h_{n}hn.
To determine the filter coefficients h n h n h_(n)h_{n}hn, perform Taylor series expansion of the exact D ( k x ) D k x D(k_(x))D\left(k_{x}\right)D(kx) and the actual H ( k z ) H k z H(k_(z))H\left(k_{z}\right)H(kz) extrapolators given by equations (D-61) and (D-62), respectively, and match the coefficients of the terms in each series at k x = 0 k x = 0 k_(x)=0k_{x}=0kx=0 (Holberg, 1988). Such a direct match of the coefficients in the Taylor series results in a response H ( k x ) H k x H(k_(x))H\left(k_{x}\right)H(kx) whose amplitude is greater than unity beyond a certain k x k x k_(x)k_{x}kx, thus violating the stability constraint that the amplitude of H ( k x ) H k x H(k_(x))H\left(k_{x}\right)H(kx) is never greater than unity within the propagation region k x ( 2 ω / v ) k x ( 2 ω / v ) k_(x) <= (2omega//v)k_{x} \leq(2 \omega / v)kx(2ω/v).
A way to circumvent the unstable response of the conventional Taylor series method is to match the first M < N M < N M < NM<NM<N coefficients in the series expansion and set the remaining N M N M N-MN-MNM to zero (Hale, 1991). This modified Taylor series method proceeds as follows.
Let the filter coefficients h n h n h_(n)h_{n}hn be defined by the series
h n = c 0 + 2 m = 1 M c m b m + n h n = c 0 + 2 m = 1 M c m b m + n h_(n)=c_(0)+2sum_(m=1)^(M)c_(m)b_(m+n)h_{n}=c_{0}+2 \sum_{m=1}^{M} c_{m} b_{m+n}hn=c0+2m=1Mcmbm+n
where
b m n = 2 cos ( 2 π m n N ) b m n = 2 cos 2 π m n N b_(mn)=2cos((2pi mn)/(N))b_{m n}=2 \cos \left(\frac{2 \pi m n}{N}\right)bmn=2cos(2πmnN)
By way of equations (D-63) and (D-64), equation (D-62) takes the form
H ( k x ) = c 0 [ 1 + 2 n cos ( n k x ) ] + 2 m c m [ 1 + 2 n cos ( 2 π m n N ) cos ( n k x ) ] H k x = c 0 1 + 2 n cos n k x + 2 m c m 1 + 2 n cos 2 π m n N cos n k x {:[H(k_(x))=c_(0)[1+2sum_(n)cos(nk_(x))]],[+2sum_(m)c_(m)[1+2sum_(n)cos((2pi mn)/(N))cos(nk_(x))]]:}\begin{aligned} H\left(k_{x}\right) & =c_{0}\left[1+2 \sum_{n} \cos \left(n k_{x}\right)\right] \\ & +2 \sum_{m} c_{m}\left[1+2 \sum_{n} \cos \left(\frac{2 \pi m n}{N}\right) \cos \left(n k_{x}\right)\right] \end{aligned}H(kx)=c0[1+2ncos(nkx)]+2mcm[1+2ncos(2πmnN)cos(nkx)]
Equation (D-65) can be written as a single summation
H ( k x ) = m = 0 M c m B m ( k x ) H k x = m = 0 M c m B m k x H(k_(x))=sum_(m=0)^(M)c_(m)B_(m)(k_(x))H\left(k_{x}\right)=\sum_{m=0}^{M} c_{m} B_{m}\left(k_{x}\right)H(kx)=m=0McmBm(kx)
where
B 0 ( k x ) = 1 + 2 n cos ( n k x ) B 0 k x = 1 + 2 n cos n k x B_(0)(k_(x))=1+2sum_(n)cos(nk_(x))B_{0}\left(k_{x}\right)=1+2 \sum_{n} \cos \left(n k_{x}\right)B0(kx)=1+2ncos(nkx)
and
B m ( k x ) = 1 + 2 n cos ( 2 π m n N ) cos ( n k x ) B m k x = 1 + 2 n cos 2 π m n N cos n k x B_(m)(k_(x))=1+2sum_(n)cos((2pi mn)/(N))cos(nk_(x))B_{m}\left(k_{x}\right)=1+2 \sum_{n} \cos \left(\frac{2 \pi m n}{N}\right) \cos \left(n k_{x}\right)Bm(kx)=1+2ncos(2πmnN)cos(nkx)
61):
Now, perform the Taylor series expansion of the exact extrapolator given by equation (D-
D ( k x ) = D ( 0 ) + k x D ( k x ) k x + k x 2 2 2 D ( k x ) k x 2 + D k x = D ( 0 ) + k x D k x k x + k x 2 2 2 D k x k x 2 + D(k_(x))=D(0)+k_(x)(del D(k_(x)))/(delk_(x))+(k_(x)^(2))/(2)(del^(2)D(k_(x)))/(delk_(x)^(2))+cdotsD\left(k_{x}\right)=D(0)+k_{x} \frac{\partial D\left(k_{x}\right)}{\partial k_{x}}+\frac{k_{x}^{2}}{2} \frac{\partial^{2} D\left(k_{x}\right)}{\partial k_{x}^{2}}+\cdotsD(kx)=D(0)+kxD(kx)kx+kx222D(kx)kx2+
where the derivatives are evaluated at k x = 0 k x = 0 k_(x)=0k_{x}=0kx=0, and thus the terms associated with the odd derivatives vanish.
Matching the terms of the actual extrapolator H ( k x ) H k x H(k_(x))H\left(k_{x}\right)H(kx) with those of the desired extrapolator D ( k x ) D k x D(k_(x))D\left(k_{x}\right)D(kx) is equivalent to matching their even derivatives
m = 0 M c m B m 2 j ( 0 ) = D 2 j ( 0 ) , j = 0 , 1 , 2 , , M m = 0 M c m B m 2 j ( 0 ) = D 2 j ( 0 ) , j = 0 , 1 , 2 , , M sum_(m=0)^(M)c_(m)B_(m)^(2j)(0)=D^(2j)(0),j=0,1,2,dots,M\sum_{m=0}^{M} c_{m} B_{m}^{2 j}(0)=D^{2 j}(0), j=0,1,2, \ldots, Mm=0McmBm2j(0)=D2j(0),j=0,1,2,,M
where the derivative terms B m 2 j B m 2 j B_(m)^(2j)B_{m}^{2 j}Bm2j are
B 0 2 J ( 0 ) = ( 1 ) 3 [ 1 + 2 n = 1 n 23 ] B 0 2 J ( 0 ) = ( 1 ) 3 1 + 2 n = 1 n 23 B_(0)^(2J)(0)=(-1)^(3)[1+2sum_(n=1)n^(23)]B_{0}^{2 J}(0)=(-1)^{3}\left[1+2 \sum_{n=1} n^{23}\right]B02J(0)=(1)3[1+2n=1n23]
and
B m 2 η ( 0 ) = 2 ( 1 ) 2 [ 1 + 2 n = 1 cos ( 2 π m n N ) n 2 ] B m 2 η ( 0 ) = 2 ( 1 ) 2 1 + 2 n = 1 cos 2 π m n N n 2 B_(m)^(2eta)(0)=2(-1)^(2)[1+2sum_(n=1)cos((2pi mn)/(N))n^(2)]B_{m}^{2 \eta}(0)=2(-1)^{2}\left[1+2 \sum_{n=1} \cos \left(\frac{2 \pi m n}{N}\right) n^{2}\right]Bm2η(0)=2(1)2[1+2n=1cos(2πmnN)n2]
Equation (D-69) represents a system of M M MMM linear equations that can be solved for the coefficients c m c m c_(m)c_{m}cm. The extrapolation filter coefficients h n h n h_(n)h_{n}hn then can be computed by substituting the solution of equation (D-69) into equation (D-63).
The modified Taylor expansion yields filter coeffcients h n h n h_(n)h_{n}hn with its response H ( k x ) H k x H(k_(x))\boldsymbol{H}\left(k_{x}\right)H(kx) that vanishes beyond a cutoff value for k x k x k_(x)k_{x}kx in the wavenumber domain that depends on the scalar M M MMM. Also, the response of the extrapolator based on the modified Taylor expansion satisfies the stability constraint H ( k x ) < 1 H k x < 1 H(k_(x)) < 1H\left(k_{x}\right)<1H(kx)<1 in the passband region of the filter. The cutoff wavenumber k x k x k_(x)k_{x}kx determines the maximum dip accuracy of the extrapolation filter. The larger the number of filter coefficients 2 N + 1 2 N + 1 2N+12 N+12N+1, the steeper the dip accuracy. In practice, extrapolation filter lengths 7, 11 and 25 are often associated with 30-, 50- and 70-degree dip accuracies.
An alternative method for computing the filter coefficients h n h n h_(n)h_{n}hn with more accuracy at large wavenumbers k x k x k_(x)k_{x}kx is based on the Remez exchange algorithm (Soubaras, 1996). The objective is to minimize the error function
E ( k x ) = W ( k x ) [ D ( k x ) H ( k x ) ] , E k x = W k x D k x H k x , E(k_(x))=W(k_(x))[D(k_(x))-H(k_(x))],E\left(k_{x}\right)=W\left(k_{x}\right)\left[D\left(k_{x}\right)-H\left(k_{x}\right)\right],E(kx)=W(kx)[D(kx)H(kx)],
where W ( k x ) W k x W(k_(x))W\left(k_{x}\right)W(kx) is a weighting function, such that
E = max | E ( k x ) | E = max E k x ||E||_(oo)=max|E(k_(x))|\|E\|_{\infty}=\max \left|E\left(k_{x}\right)\right|E=max|E(kx)|
is minimum. The criterion E E ||E||_(oo)\|E\|_{\infty}E means that the actual response H ( k x ) H k x H(k_(x))H\left(k_{x}\right)H(kx) is equiripple. Specifically, the response H ( k x ) H k x H(k_(x))H\left(k_{x}\right)H(kx) has extrema of the sane absolute value with alternating signs within the passband region specified by a cutoff wavenumber k x k x k_(x)k_{x}kx. The objective of the error function is to minimize the deviation of the extrema from the desired value of unity.

D. 6 Optimum Depth Step

The objective is to specify an optimum depth step size that yields minimum-phase errors in wave extrapolation as part of the design of finite-difference migration algorithms. First, we shall review implicit and explicit schemes. Then, we shall derive equations for optimum depth size for frequency-wavenumber implicit schemes.
Start with the one-way wave equation (D-5):
z P ( k x , z , ω ) = ı k z P ( k x , z = 0 , ω ) z P k x , z , ω = ı k z P k x , z = 0 , ω (del)/(del z)P(k_(x),z,omega)=-ık_(z)P(k_(x),z=0,omega)\frac{\partial}{\partial z} P\left(k_{x}, z, \omega\right)=-\imath k_{z} P\left(k_{x}, z=0, \omega\right)zP(kx,z,ω)=ıkzP(kx,z=0,ω)
whose solution is
P ( z + Δ z ) = P ( z ) exp ( ı k z Δ z ) P ( z + Δ z ) = P ( z ) exp ı k z Δ z P(z+Delta z)=P(z)exp(-ık_(z)Delta z)P(z+\Delta z)=P(z) \exp \left(-\imath k_{z} \Delta z\right)P(z+Δz)=P(z)exp(ıkzΔz)
where, for simplicity, k x k x k_(x)k_{x}kx and ω ω omega\omegaω variables are omitted from P , and P , and  P_(", and ")P_{\text {, and }}P, and 
k x = 2 ω v 1 ( v k x 2 ω ) 2 k x = 2 ω v 1 v k x 2 ω 2 k_(x)=(2omega)/(v)sqrt(1-((vk_(x))/(2omega))^(2))k_{x}=\frac{2 \omega}{v} \sqrt{1-\left(\frac{v k_{x}}{2 \omega}\right)^{2}}kx=2ωv1(vkx2ω)2
The phase of the exact extrapolation operator
exp ( ı k z Δ z ) exp ı k z Δ z exp(-ık_(z)Delta z)\exp \left(-\imath k_{z} \Delta z\right)exp(ıkzΔz)
is
Φ = k z Δ z Φ = k z Δ z Phi=k_(z)Delta z\Phi=k_{z} \Delta zΦ=kzΔz
and its amplitude is
A = 1 . A = 1 A=1". "A=1 \text {. }A=1
Discretize the one-way wave equation (D-73):
δ P δ z = ı k z P δ P δ z = ı k z P (delta P)/(delta z)=-ık_(z)P\frac{\delta P}{\delta z}=-\imath k_{z} PδPδz=ıkzP
Apply differencing approximation using the explicit scheme
P ( z + Δ z ) P ( z ) Δ z = i k z P ( z ) P ( z + Δ z ) P ( z ) Δ z = i k z P ( z ) (P(z+Delta z)-P(z))/(Delta z)=-ik_(z)P(z)\frac{P(z+\Delta z)-P(z)}{\Delta z}=-i k_{z} P(z)P(z+Δz)P(z)Δz=ikzP(z)
and the implicit scheme
P ( z + Δ z ) P ( z ) Δ z = i k z P ( z + Δ z ) P ( z ) 2 . P ( z + Δ z ) P ( z ) Δ z = i k z P ( z + Δ z ) P ( z ) 2 . (P(z+Delta z)-P(z))/(Delta z)=-ik_(z)(P(z+Delta z)-P(z))/(2).\frac{P(z+\Delta z)-P(z)}{\Delta z}=-i k_{z} \frac{P(z+\Delta z)-P(z)}{2} .P(z+Δz)P(z)Δz=ikzP(z+Δz)P(z)2.
Rewrite the explicit equation (D-78a) as
P ( z + Δ z ) = P ( z ) ( 1 i k z Δ z ) P ( z + Δ z ) = P ( z ) 1 i k z Δ z P(z+Delta z)=P(z)(1-ik_(z)Delta z)P(z+\Delta z)=P(z)\left(1-i k_{z} \Delta z\right)P(z+Δz)=P(z)(1ikzΔz)
The phase of the explicit extrapolation operator
( 1 i k z Δ z ) 1 i k z Δ z (1-ik_(z)Delta z)\left(1-i k_{z} \Delta z\right)(1ikzΔz)
is
Φ ^ = tan 1 ( k z Δ z ) Φ ^ = tan 1 k z Δ z widehat(Phi)=tan^(-1)(k_(z)Delta z)\widehat{\Phi}=\tan ^{-1}\left(k_{z} \Delta z\right)Φ^=tan1(kzΔz)
and its amplitude is
A ^ = 1 + ( k z Δ z ) 2 A ^ = 1 + k z Δ z 2 hat(A)=sqrt(1+(k_(z)Delta z)^(2))\hat{A}=\sqrt{1+\left(k_{z} \Delta z\right)^{2}}A^=1+(kzΔz)2
Note that the amplitude of the explicit operator is greater than unity and grows from one extrapolation step to the next. In fact, large depth steps cause the operator to yield unstable results early in the extrapolation process. In general, explicit schemes tend to be unstable unless special design considerations are made (Section D.5).
Rewrite the implicit equation (D-78b) as
P ( z + Δ z ) = P ( z ) [ 1 i k z Δ z / 2 1 + ı k z Δ z / 2 ] P ( z + Δ z ) = P ( z ) 1 i k z Δ z / 2 1 + ı k z Δ z / 2 P(z+Delta z)=P(z)[(1-ik_(z)Delta z//2)/(1+ık_(z)Delta z//2)]P(z+\Delta z)=P(z)\left[\frac{1-i k_{z} \Delta z / 2}{1+\imath k_{z} \Delta z / 2}\right]P(z+Δz)=P(z)[1ikzΔz/21+ıkzΔz/2]
The phase of the implicit extrapolation operator
1 i k z Δ z / 2 1 + i k z Δ z / 2 1 i k z Δ z / 2 1 + i k z Δ z / 2 (1-ik_(z)Delta z//2)/(1+ik_(z)Delta z//2)\frac{1-i k_{z} \Delta z / 2}{1+i k_{z} \Delta z / 2}1ikzΔz/21+ikzΔz/2
is
Φ ^ = tan 1 [ k z Δ z 1 ( k z Δ z / 2 ) 2 ] Φ ^ = tan 1 k z Δ z 1 k z Δ z / 2 2 widehat(Phi)=tan^(-1)[(k_(z)Delta z)/(1-(k_(z)Delta z//2)^(2))]\widehat{\Phi}=\tan ^{-1}\left[\frac{k_{z} \Delta z}{1-\left(k_{z} \Delta z / 2\right)^{2}}\right]Φ^=tan1[kzΔz1(kzΔz/2)2]
and its amplitude is
A ^ = 1 A ^ = 1 hat(A)=1\hat{A}=1A^=1
Note that the amplitude of the implicit scheme is unity. This means that implicit schemes are unconditionally stable.
We now specialize the phase of the frequency-space implicit scheme given by equation (D80b) for the 65-degree dispersion relation as in equation (D-58) and obtain
Φ ^ = tan 1 [ k ^ z Δ z 1 ( k ^ z Δ z / 2 ) 2 ] Φ ^ = tan 1 k ^ z Δ z 1 k ^ z Δ z / 2 2 widehat(Phi)=tan^(-1)[( hat(k)_(z)Delta z)/(1-( hat(k)_(z)Delta z//2)^(2))]\widehat{\Phi}=\tan ^{-1}\left[\frac{\hat{k}_{z} \Delta z}{1-\left(\hat{k}_{z} \Delta z / 2\right)^{2}}\right]Φ^=tan1[k^zΔz1(k^zΔz/2)2]
where
k ^ z = α k ^ x 2 2 ω v β v 2 ω k ^ x 2 k ^ z = α k ^ x 2 2 ω v β v 2 ω k ^ x 2 hat(k)_(z)=(alpha hat(k)_(x)^(2))/((2omega)/(v)-beta(v)/(2omega) hat(k)_(x)^(2))\hat{k}_{z}=\frac{\alpha \hat{k}_{x}^{2}}{\frac{2 \omega}{v}-\beta \frac{v}{2 \omega} \hat{k}_{x}^{2}}k^z=αk^x22ωvβv2ωk^x2
with α α alpha\alphaα and β β beta\betaβ specified as in Table D-1 for the 65-degree scheme. Equation (D-81a) is the timeretarded form of equation (D-58) and hence corresponds to the second term of the latter. The discrete forms of the transform variables are (Claerbout, 1976):
k ^ x 2 = 4 Δ x 2 sin 2 ( ω v Δ x sin θ ) 1 4 b sin 2 ( ω v Δ x sin θ ) k ^ x 2 = 4 Δ x 2 sin 2 ω v Δ x sin θ 1 4 b sin 2 ω v Δ x sin θ hat(k)_(x)^(2)=(4)/(Deltax^(2))(sin^(2)((omega )/(v)Delta x sin theta))/(1-4bsin^(2)((omega )/(v)Delta x sin theta))\hat{k}_{x}^{2}=\frac{4}{\Delta x^{2}} \frac{\sin ^{2}\left(\frac{\omega}{v} \Delta x \sin \theta\right)}{1-4 b \sin ^{2}\left(\frac{\omega}{v} \Delta x \sin \theta\right)}k^x2=4Δx2sin2(ωvΔxsinθ)14bsin2(ωvΔxsinθ)
and
ω ^ = 2 Δ t tan ( ω Δ t 2 ) ω ^ = 2 Δ t tan ω Δ t 2 hat(omega)=(2)/(Delta t)tan((omega Delta t)/(2))\hat{\omega}=\frac{2}{\Delta t} \tan \left(\frac{\omega \Delta t}{2}\right)ω^=2Δttan(ωΔt2)
The scalar b b bbb in equation (D-81c) is set to a value between 1 / 12 1 / 12 1//121 / 121/12 and 1 / 6 1 / 6 1//61 / 61/6. The phase error for the 65 -degree implicit scheme then is given by
Δ Φ = Φ Φ Δ Φ = Φ Φ Delta^(Phi)=Phi^(⇀)-Phi\Delta \stackrel{\Phi}{ }=\stackrel{\rightharpoonup}{\Phi}-\PhiΔΦ=ΦΦ
where Φ Φ Phi\PhiΦ and Φ Φ Phi\PhiΦ are given by equations (D-81a) and (D-76a), respectively. Refer to the equations (D-81a,b,c,d) and note that the phase error depends on Δ x , Δ t , v , θ , ω Δ x , Δ t , v , θ , ω Delta x,Delta t,v,theta,omega\Delta x, \Delta t, v, \theta, \omegaΔx,Δt,v,θ,ω, and the depth step Δ z Δ z Delta z\Delta zΔz.
Figure D-8 shows contour plots of the phase error defined by equation (D-82) for three ω / v ω / v omega//v\omega / vω/v yalues as a function of dip angle and depth step size. Note the complicated behavior of the contours which indicates that the optimum depth step size is associated with a complicated interdependence of the various parameters - dip, frequency, velocity, spatial, and temporal sampling rates. Therefore, in practice, migration algoirthms that require wave extrapolation at discrete depth steps usually do not incorporate an automated estimation of optimum depth steps. Instead, a constant value between one-half and one dominant period, 20 to 40 m s 40 m s 40ms40 \mathrm{~ms}40 ms, depending on maximum reflector dip is specified in practice. See Section 4.4 for the practical aspects of frequency-space migration.
FIG. D-8. Phase error contours in degrees associated with the 65-degree implicit extrapolator (see Section D.6) for a range of dip angles θ θ theta\thetaθ versus depth step sizes Δ z Δ z Delta z\Delta zΔz, and for specific ratios of ω / v ω / v omega//v\omega / vω/v, from top to botton, 0.001 (low frequency or high velocity), 0.06 (medium frequency and velocity) and 0.2 (high frequency or low velocity). The parameter b b bbb in equation (D-81c) was set to 0.14 for all three cases. (Computation by Dave Nichols.)

D. 7 Frequency-Wavenumber Migration

We start with the solution of the scalar wave equation for the zero-offset wavefield as given by equation (D-7) and assume a horizontally layered earth model associated with a vertically varying velocity function v ( z ) v ( z ) v(z)v(z)v(z). By inverse Fourier transforming equation (D-7), we have
P ( x , z , t ) = P ( k x , 0 , ω ) exp ( i k z z ) exp ( i k x x + i ω t ) d k x d ω P ( x , z , t ) = P k x , 0 , ω exp i k z z exp i k x x + i ω t d k x d ω P(x,z,t)=∬P(k_(x),0,omega)exp(-ik_(z)z)exp(-ik_(x)x+i omega t)dk_(x)d omegaP(x, z, t)=\iint P\left(k_{x}, 0, \omega\right) \exp \left(-i k_{z} z\right) \exp \left(-i k_{x} x+i \omega t\right) d k_{x} d \omegaP(x,z,t)=P(kx,0,ω)exp(ikzz)exp(ikxx+iωt)dkxdω
where k z k z k_(z)k_{z}kz is defined by equation (D-6) adapted to the exploding reflectors model by replacing v v vvv with v / 2 v / 2 v//2v / 2v/2 :
k z = 2 ω v 1 ( v k z 2 ω ) 2 k z = 2 ω v 1 v k z 2 ω 2 k_(z)=(2omega)/(v)sqrt(1-((vk_(z))/(2omega))^(2))k_{z}=\frac{2 \omega}{v} \sqrt{1-\left(\frac{v k_{z}}{2 \omega}\right)^{2}}kz=2ωv1(vkz2ω)2
The inaging principle t = 0 t = 0 t=0t=0t=0 then is applied to get the migrated section P ( x , z , t = 0 ) P ( x , z , t = 0 ) P(x,z,t=0)P(x, z, t=0)P(x,z,t=0),
P ( x , z , t = 0 ) = P ( k x , 0 , ω ) exp ( i k x x i k z z ) d k x d ω P ( x , z , t = 0 ) = P k x , 0 , ω exp i k x x i k z z d k x d ω P(x,z,t=0)=∬P(k_(x),0,omega)exp(-ik_(x)x-ik_(z)z)dk_(x)d omegaP(x, z, t=0)=\iint P\left(k_{x}, 0, \omega\right) \exp \left(-i k_{x} x-i k_{z} z\right) d k_{x} d \omegaP(x,z,t=0)=P(kx,0,ω)exp(ikxxikzz)dkxdω
This is the equation for the phase-shift method (Gazdag, 1978). Equation (D-84) involves integration over frequency and inverse Fourier transformation along midpoint axis x x xxx. Refer to Figure 4.1-29 for a flow diagram of phase-shift migration.
We now consider the special case of constant velocity v v vvv. Stolt (1978) devised a migration technique that involves an efficient mapping in the 2-D Fourier transform domain from temporal frequency ω ω omega\omegaω to vertical wavenumber k z k z k_(z)k_{z}kz. We rewrite equation (D-83b) to get
ω = v 2 k x 2 + k z 2 ω = v 2 k x 2 + k z 2 omega=(v)/(2)sqrt(k_(x)^(2)+k_(z)^(2))\omega=\frac{v}{2} \sqrt{k_{x}^{2}+k_{z}^{2}}ω=v2kx2+kz2
By keeping the horizontal wavenumber k x k x k_(x)k_{x}kx unchanged and differentiating, we obtain
d ω = v 2 k z k x 2 + k z 2 d k z d ω = v 2 k z k x 2 + k z 2 d k z d omega=(v)/(2)(k_(z))/(sqrt(k_(x)^(2)+k_(z)^(2)))dk_(z)d \omega=\frac{v}{2} \frac{k_{z}}{\sqrt{k_{x}^{2}+k_{z}^{2}}} d k_{z}dω=v2kzkx2+kz2dkz
When equations (D-85) and (D-86) are substituted into equation (D-84), we get
P ( x , z , t = 0 ) = [ v 2 k z k x 2 + k z 2 ] P [ k x , 0 , v 2 k x 2 + k z 2 ] exp ( i k x x i k z z ) d k x d k z . P ( x , z , t = 0 ) = v 2 k z k x 2 + k z 2 P k x , 0 , v 2 k x 2 + k z 2 exp i k x x i k z z d k x d k z . P(x,z,t=0)=∬[(v)/(2)(k_(z))/(sqrt(k_(x)^(2)+k_(z)^(2)))]P[k_(x),0,(v)/(2)sqrt(k_(x)^(2)+k_(z)^(2))]exp(-ik_(x)x-ik_(z)z)dk_(x)dk_(z).P(x, z, t=0)=\iint\left[\frac{v}{2} \frac{k_{z}}{\sqrt{k_{x}^{2}+k_{z}^{2}}}\right] P\left[k_{x}, 0, \frac{v}{2} \sqrt{k_{x}^{2}+k_{z}^{2}}\right] \exp \left(-i k_{x} x-i k_{z} z\right) d k_{x} d k_{z} .P(x,z,t=0)=[v2kzkx2+kz2]P[kx,0,v2kx2+kz2]exp(ikxxikzz)dkxdkz.
This is the equation for constant-velocity Stolt migration. It involves two operations in the f k f k f-kf-kfk domain. First, the temporal frequency ω ω omega\omegaω is mapped onto the vertical wavenumber k z k z k_(z)k_{z}kz via equation (D-85). This is the same as mapping point B B B^(')B^{\prime}B onto point B B BBB in Figure 4.1-25. Second, the amplitudes are scaled by the quantity
S = v 2 k z k z 2 + k ¯ z 2 S = v 2 k z k z 2 + k ¯ z 2 S=(v)/(2)(k_(z))/(sqrt(k_(z)^(2)+ bar(k)_(z)^(2)))S=\frac{v}{2} \frac{k_{z}}{\sqrt{k_{z}^{2}+\bar{k}_{z}^{2}}}S=v2kzkz2+k¯z2
which is equivalent to the obliquity factor associated with Kirchhoff migration (Section 4.1). Refer to Figure 4.1-30 for a flow djagram of constant-velocity Stolt migration.
To extend the algorithm to the variable-velocity case, yet retain efficiency, Stolt (1978) did a coordinate transformation that involves stretching the time axis to make the scalar wave equation velocity independent. A summary of the theoretical procedure is given here. Consider wavefield P ( x , z , t ) P ( x , z , t ) P(x,z,t)P(x, z, t)P(x,z,t) and the transformed wavefield P ( x , d , T ) P ( x , d , T ) P(x,d,T)P(x, d, T)P(x,d,T) :
P ( x , z , t ) = P ( x , d , T ) P ( x , z , t ) = P ( x , d , T ) P(x,z,t)=P(x,d,T)P(x, z, t)=P(x, d, T)P(x,z,t)=P(x,d,T)
where T T TTT is the stretched time axis and d d ddd is the output variable (equivalent of z z zzz ) for migration in the stretched coordinate system. Here, the x x xxx variable is identical in both coordinate systems.
This coordinate transformation basically is equivalent to stretching the data using the rms velocities
T ( t ) = 1 c [ 2 0 t d t v r m s 2 ( t ) t ] 1 / 2 T ( t ) = 1 c 2 0 t d t v r m s 2 t t 1 / 2 T(t)=(1)/(c)[2int_(0)^(t)dt^(')v_(rms)^(2)(t^('))t^(')]^(1//2)T(t)=\frac{1}{\mathrm{c}}\left[2 \int_{0}^{t} d t^{\prime} v_{r m s}^{2}\left(t^{\prime}\right) t^{\prime}\right]^{1 / 2}T(t)=1c[20tdtvrms2(t)t]1/2
where
v r m s 2 ( t ) = 1 t 0 t v 2 ( t ) d t v r m s 2 ( t ) = 1 t 0 t v 2 t d t v_(rms)^(2)(t)=(1)/(t)int_(0)^(t)v^(2)(t^('))dt^(')v_{r m s}^{2}(t)=\frac{1}{t} \int_{0}^{t} v^{2}\left(t^{\prime}\right) d t^{\prime}vrms2(t)=1t0tv2(t)dt
and c c ccc is an arbitrary reference velocity used to maintain the vertical axis as time after the coordinate transformation from t t ttt to T T TTT. After some tedious algebra, the time-retarded scalar wave equation takes the following form in the stretched coordinates (Stolt, 1978):
2 P x 2 + W 2 P d 2 + 2 c 2 P d T 2 P x 2 + W 2 P d 2 + 2 c 2 P d T (del^(2)P)/(delx^(2))+W(del^(2)P)/(deld^(2))+(2)/(c)(del^(2)P)/(del d del T)\frac{\partial^{2} P}{\partial x^{2}}+W \frac{\partial^{2} P}{\partial d^{2}}+\frac{2}{c} \frac{\partial^{2} P}{\partial d \partial T}2Px2+W2Pd2+2c2PdT
where W W WWW is a complicated function of velocity and coordinate variables. In practice, it normally is set to a constant between 0 and 1 . The procedure for Stolt migration with stretch follows:
(a) Start with the stacked section, which is assumed to be a zoro-offset section P ( x , z = 0 , t ) P ( x , z = 0 , t ) P(x,z=0,t)P(x, z=0, t)P(x,z=0,t).
(b) Convert this time section to stretched section P ( x , d = 0 , T ) P ( x , d = 0 , T ) P(x,d=0,T)P(x, d=0, T)P(x,d=0,T) by the coordinate transformation (equation D-88).
(c) 2-D Fonrier transform the stretched section P ( k x , d = 0 , ω T ) P k x , d = 0 , ω T P(k_(x),d=0,omega_(T))P\left(k_{x}, d=0, \omega_{T}\right)P(kx,d=0,ωT).
(d) Apply the following mapping function to perform migration:
k d = ( 1 1 W ) ω T c 1 W ω T 2 c 2 W k x 2 k d = 1 1 W ω T c 1 W ω T 2 c 2 W k x 2 k_(d)=(1-(1)/(W))(omega_(T))/(c)-(1)/(W)sqrt((omega_(T)^(2))/(c^(2))-Wk_(x)^(2))k_{d}=\left(1-\frac{1}{W}\right) \frac{\omega_{T}}{c}-\frac{1}{W} \sqrt{\frac{\omega_{T}^{2}}{c^{2}}-W k_{x}^{2}}kd=(11W)ωTc1WωT2c2Wkx2
This equation is based on the dispersion relation of the retarded wave equation in the stretched coordinates (equation D-90). The expression for the output from migration is (omitting the heavy algebra)
P ( k x , k d , 0 ) = [ c 2 W ( 1 W + 1 K ) ] P { k x , 0 , [ c k d 2 W ( 1 W + K ) } , ( D 92 a ) P k x , k d , 0 = c 2 W 1 W + 1 K P k x , 0 , c k d 2 W ( 1 W + K ) , ( D 92 a ) P(k_(x),k_(d),0)=[(c)/(2-W)(1-W+(1)/(K))]P{k_(x),0,[(ck_(d))/(2-W)(1-W+K)},quad(D-92 a):}P\left(k_{x}, k_{d}, 0\right)=\left[\frac{c}{2-W}\left(1-W+\frac{1}{K}\right)\right] P\left\{k_{x}, 0,\left[\frac{c k_{d}}{2-W}(1-W+K)\right\}, \quad(D-92 a)\right.P(kx,kd,0)=[c2W(1W+1K)]P{kx,0,[ckd2W(1W+K)},(D92a)
where
K = 1 1 + ( 2 W ) k x 2 k d 2 K = 1 1 + ( 2 W ) k x 2 k d 2 K=(1)/(sqrt(1+(2-W)(k_(x)^(2))/(k_(d)^(2))))K=\frac{1}{\sqrt{1+(2-W) \frac{k_{x}^{2}}{k_{d}^{2}}}}K=11+(2W)kx2kd2
(e) 2-D inverse Fourier transform the migrated section in the stretched coordinates P ( x , d , T = P ( x , d , T = P(x,d,T=P(x, d, T=P(x,d,T= 0 ) 0 ) 0)0)0).
(f) Convert back to the familiar space-time coordinates P ( x , z , t = 0 ) P ( x , z , t = 0 ) P(x,z,t=0)P(x, z, t=0)P(x,z,t=0). This is the final nigrated section.
To derive the equations for Stolt migration with the output in time τ = 2 z / v τ = 2 z / v tau=2z//v\tau=2 z / vτ=2z/v, use the dispersion relation as in equation (D-49a) in lieu of equation (D-83b) and replace the vertical wavenumber k x k x k_(x)k_{x}kx with the output frequency ω τ = v k z / 2 ω τ = v k z / 2 omega_(tau)=vk_(z)//2\omega_{\tau}=v k_{z} / 2ωτ=vkz/2 in equations (D-84) through (D-88).
When W = 1 W = 1 W=1W=1W=1, equation (D-91) takes the simple form
k d = ω T 2 c 2 k x 2 k d = ω T 2 c 2 k x 2 k_(d)=sqrt((omega_(T)^(2))/(c^(2))-k_(x)^(2))k_{d}=\sqrt{\frac{\omega_{T}^{2}}{\mathrm{c}^{2}}-k_{x}^{2}}kd=ωT2c2kx2
which makes mapping of equation (D-91) equivalent to the constant-velocity Stolt algorithm.
Note that Stolt migration with stretch tries to handle velocity variations. However, it is no substitute for depth migration; it only accommodates velocity variations that can be bandled by time migration. Figure D-9 shows the flow diagram for Stolt migration with stretch. See Section 4.5 for the practical aspects of frequency-wavenumber migration.
FIG. D-9. Flowchart for Stolt migration with stretch.

D. 8 Residual Migration

The relationship between the output and input temporal frequencies for a 90 -degree time migration operator (rewritten from equation D-49a) is given by
ω τ = ω 2 v 2 k x 2 4 ω τ = ω 2 v 2 k x 2 4 omega_(tau)=sqrt(omega^(2)-(v^(2)k_(x)^(2))/(4))\omega_{\tau}=\sqrt{\omega^{2}-\frac{v^{2} k_{x}^{2}}{4}}ωτ=ω2v2kx24
where ω T = v k z / 2 ω T = v k z / 2 omega_(T)=vk_(z)//2\omega_{T}=v k_{z} / 2ωT=vkz/2 is the output frequency, ω ω omega\omegaω is the input frequency v v v\boldsymbol{v}v is the true medium velocity, and k z k z k_(z)k_{z}kz is the midpoint wavenumber. Equation (D-94) refers to single-pass migration if the migration velocity is the same as the medium velocity.
Consider a two-pass migration, first with velocity v 1 v 1 v_(1)v_{1}v1, followed by a second migration with velocity v 2 v 2 v_(2)v_{2}v2. The output frequency from the first pass is
ω 1 = ω 2 v 1 2 k x 2 4 ω 1 = ω 2 v 1 2 k x 2 4 omega_(1)=sqrt(omega^(2)-(v_(1)^(2)k_(x)^(2))/(4))\omega_{1}=\sqrt{\omega^{2}-\frac{v_{1}^{2} k_{x}^{2}}{4}}ω1=ω2v12kx24
which is the input frequency for the second pass
ω 2 = ω 1 2 v 2 2 k x 2 4 ω 2 = ω 1 2 v 2 2 k x 2 4 omega_(2)=sqrt(omega_(1)^(2)-(v_(2)^(2)k_(x)^(2))/(4))\omega_{2}=\sqrt{\omega_{1}^{2}-\frac{v_{2}^{2} k_{x}^{2}}{4}}ω2=ω12v22kx24
The horizontal wavenumber k x k x k_(x)k_{x}kx is fixed, since it is invariant under migration.
If the output frequency from the single-pass migration given by equation (D 94 ) is set equal to that from the two-pass migration given by equation (D-95b), then the necessary relationship between the residual migration velocity v 2 v 2 v_(2)v_{2}v2 and the medium velocity v v vvv can be established as
v 2 = v 1 2 + v 2 2 v 2 = v 1 2 + v 2 2 v^(2)=v_(1)^(2)+v_(2)^(2)v^{2}=v_{1}^{2}+v_{2}^{2}v2=v12+v22
One practical scheme for residual migration is implemented as follows:
(a) The constant-velocity Stolt migration with a stretch factor of W = 1 W = 1 W=1W=1W=1 is used for the first pass. Velocity v 1 v 1 v_(1)v_{1}v1 in equation (D-96a) is chosen as the minimum value in the actual velocity field.
(b) For the second pass, a dip-limited finite-difference migration can be used. The first-pass migration brings the dips down to within the range that the second-pass finite-difference migration can accommodate, accurately. Remember that the velocity field for the second pass is computed by the the relation
v 2 = v 2 v 1 2 v 2 = v 2 v 1 2 v_(2)=sqrt(v^(2)-v_(1)^(2))v_{2}=\sqrt{v^{2}-v_{1}^{2}}v2=v2v12
where v , v 1 v , v 1 v,v_(1)v, v_{1}v,v1, and v 2 v 2 v_(2)v_{2}v2 are the original, first- and second-pass migration velocities, respectively. A multiple-pass application of residual migration is referred to as cascaded migration. Refer to Sections 4.3 and 4.5 for the practical aspects of cascaded migration and residual migration, respectively.

REFERENCES

Baysal, E., Kosloff, D., and Sherwood, J.W.C., 1983, Reverse time migration: Geophysics, 48, 1514-1524.
Beasley, C., Lynn, W. S., Larner, K. L. and Nguyen, H. V., 1992, Extended Stolt f k f k f-kf-kfk migration: 62nd Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 551-553.
Beaslcy, C. and Lynn, W. S., 1992, The zero-velocity layer: migration from irregular surfeces: Geophysics, 57, 1435-1443.
Berkhout, A.J., 1980, Seismic migration - Imaging of acoustic energy by wavefield extrapolation: Elsevier Science Pub. Co., Inc.
Berryhll, J.R., 1979, Wave-equation datuming: Geophysics, 44, 1329-1333.
Chun, J.H. and Jacewitz, C., 1981, Fundamentals of frequency-doman migration: Geophysics, 46, 717-732.
Clacrbout, J.F., 1976, Fundamentals of geophysical data processing. MoGraw-Hill Book Co.
Clacrbout, J.F., 1985, Imaging the earth's interior: Blackwell Scientific Publications.
Claerbout, J.F. and Doherty, S.M., 1972, Downward continuation of moveout-corrected seismograms: Geophysics, 37, 741-768.
Clayton, R., 1978, Common midpoint migration: Stanford Expl. Proj., Rep. No. 14, Stanford University.
Clayton, R. and Engquist, B., 1980, Absorbing side boundary conditions for wave-equation migration: Geophysics, 45, 895-904.
Deregowski, S. and Rocca, F., 1981, Geometrical optics and wave theory for constant-offet sections in layered media: Geophys. Prosp., 29, 374-387.
Diet, J.P. and Lally, P., 1984, Choice of scheme and parameters for optimal finite-differenco migration in 2-D: 54th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 454-456.
Doherty, S.M. and Claerbout, J.F., 1974, Velocity analysis based on the wave equation: Stanford Expl. Proj, Rep. No. 1, Stanford University.
Gazdag, J., 1978, Wave-equation migration by phase shift: Geophysics, 43, 1342-1351.
Gazdag, J. and Squazzero, P., 1984, Migration of seismic data by phaşe shift plus interpolation: Geophysics, 49, 124-131.
Hale, I. D., 1991, Stable explicit depth extrapolation of sersme wavefields: Geophysics, 56, 17701777 .
Holberg, O., 1988, Towards optimum one-way wave propagation: Geophys. Prosp., 36, 99-114.
Kjartanson, E., 1979, Modeling and migretion by the monochromatic 45-degree cquation: Stanford Exploration Project Report, No. 15, Stanford University.
Kjartansson, E. and Rocca, F., 1979, The exploding reflector model and laterally variable media: Stanford Exploration Project Repart. No. 16, Stanford University.
Latner, K. L. and Beasley, C., 1990, Cascaded migrations: improving the accuracy of finitedifference migration: Geophysics, 52, 618-643.
Lee, M W. and Suh, S.H., 1985, Optimization of one-way wave equations: Geophysics, 50, 16341637.
Loewenthal, D., Lu, L., Roberson, R., and Sherwood, J W.C., 1976, The wave equation applied to migration: Geophys. Prosp., 24, 380-399.
Ma, Z., 1981, Finite-difference migration with higher-order approximation: Presented at the 1981 Joint Mtg. Chinese Geophys. Soc. and Soc. Explor. Geophys.
Reshef, M., 1991, Migration from icregular topography: Geophysics, 50, 1333-1335.
Rothmas, D., Levin, S., and Rocca, F., 1985, Residual meration: Applications and limitations: Geophysics, 50, 110-126.
Schneider, W., 1978, Integral formulation for migration in two and three dimensions: Gcophysics, 43 , 49 76 43 , 49 76 43,49-7643,49-7643,4976.
Soubaras, R., 1992, Explicit 3-D migration using equiripple polynomial expansion and Laplacian synthesis: 62nd Ann. Internat. Mtg., Soc. Expl. Geophys., Expandod Abstracts, 905-908.
Soubaras, R., 1996, Explicit 3-D migration using equiripple polynomial expansion and Laplacian synthesis: Geophysics, 61, 1386-1393.
Stolt, R.H., 1978, Migration by Fourier transform: Geophysics, 43, 23-48.
Stolt, R.H. and Benson, A K,, 1986, Seismic migration: theory and practice: Geophysical Press.
Taner, M.T., Cook, E.E., Neidell, N.S., 1982, Paleo-seismic and color acoustic impedance sections: applications of downward continustion in structural and stratigraphic conbext; 52 nd Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 110-111.
Taner, M.T. and Koehlor, F, 1977, Wave-equation migration: Technical brochure, Sescom-Delta, Inc.
Yilmaz, O., 1979, Presteck partial migration: Ph.D. thesis, Stanford University.

5 Dip-Moveout Correction and Prestack Migration

\begin{abstract}
- Introduction *\cdot Sait-Flank Reflections *\cdot Fault-Planc Reflections *\cdot DMO and Stacking Velocities *\cdot Turning-Wave Reflections - Principles of Dip-Moveout Correction - Prestack Partial Migration - Frequency-Wavenumber DMO Correction - Log-Stretch DMO Correction *\cdot Integral DMO Correction *\cdot Velocity Errors - Variable Velocity - Turning-Wave Migration - Dip-Moveout Correction in Practice - Salt Flanks - Fault Planes - DMO and Multiples *\cdot DMO and Coherent Linear Noise *\cdot Other Considerations *\cdot Aspects of DMO Correction - A Summary - Prestack Time Migration - DMO Correction and Common-Offset Migration - Salt Flanks - Fault Planes Common-Reflection-Point versus Common-Reflection-Surface Stacking - Migration Velocity Analysis - Prestack Stolt Migration - Common-Ofset Migration of DMO-Corrected Data - Prestack Kirchhoff Migration - Velocity Analysis Using Common-Reflection-Point Gathers - Focusing Analysis - Fowler's Velocity-Independent Prestack Migration *\cdot Exercises *\cdot Appendix E: Topics in Dip-Moveout Correction and Prestack Time Migration - Reflection Point Dispersal \bullet Equations for DMO Correction \bullet Log-Stretch DMO Correction - The DMO Ellipse Nonzero-Offset Traveltime Equation \bullet Prestack Frequency-Wavenumber Migration \bullet Velocity Analysis by Wavefield Extrapolation \bullet References
\end{abstract}

5.0 INTRODUCTION

Dip-moveout (DMO) correction is applied to normalmoveout corrected prestack data to preserve conflicting dips with different stacking velocities during stacking. As a result, DMO correction yields an improved stacked section that is a closer representation of a zero-offset section compared to conventional CMP stack based on normal-moveout correction, only. This then enables us to apply the theory of zero-offset migration discussed in Chapter 4 to stacked data with greater confidence.
We remind ourselves from Chapter 3 that stacking velocities are dip-dependent (equation 3-8). When a flat event is intersected by a dipping event, we can only choose a stacking velocity in favor of one of these events, not both. Therefore, conventional CMP stacking does not equally preserve events with conflicting dips with different stacking velocities. This is not the case for a zero-offset section, for it contains all events, regardless of dip. Thus, in the presence of conflicting dips, a stacked section is not identical to a zero-offset section.
Since a CMP-stacked section strictly is not equivalent to a zero-offset section, we expect that migration after stack would not produce a crisp image in the pres-
ence of conflicting dips with different stacking velocities. To circumvent the problem of conflicting dips, it can be suggested that migration should be done before rather than after stack.
A practical alternative to migration before stack is to correct for the dip effect on moveout velocities implied by Levin's equation (3-8) prior to stacking. It can be suggested that prestack data first can be moveout-corrected using flat-event velocities. This normal-moveout correction (NMO) then is followed by a dip-moveout correction (DMO) to account for the dip effect on moveout. Stacking of NMO- and DMO-corrected CMP gathers yields a section that is a closer approximation to a zero-offset section than a conventional CMPstacked section based on NMO correction only.
Conflicting dips with different stacking velocities often are encountered in two geological situations reflections from steeply dipping fault planes confilicting with reflections associated with gently dipping strata, and diffractions and reflections off the flank of salt domes conflicting with, again, reflections associated with gently dipping strata.
The conflicting dips problem has been investigated extensively. Doherty (1975) first introduced the wave extrapolation equations for nonzero-offset data. Sherwood et al. (1978) devised a method for mapping nonzero-offset data to zero offset in the presence of conflicting dips with different stacking velocities. Then, Yilmaz and Claerbout (1980) suggested a prestack partial migration (PSPM) technique for solving the problem of conflicting dips. Specifically, they developed a wave theory to account for the difference between migration before stack and the result of conventional processing that includes movenut correction, CMP stacking and migration after stack (Section D.1). They recognized the fact that DMO correction actually is a partial migration process applied to moveout-corrected commonoffset data. Nevertheless, the PSPM theory had one important drawback. Although valid for the layered earth velocity model, it, was besed on a small-offet approximation. Deregowski and Rocca (1981) recast the theory for PSPM in a form similar to Kirchhoff migration. Ottolini (1982) developed the PSPM equations in Snell-midpoint coordinates, the domain of constant-rayparameter sections (Section F.2). The technique is theoretically accurate for layered medium as well as for all offsets and dips. This method was followed by another unique approach that involves offset continuation (Bolondi et al., 1982, 1984; Salvador and Savelli, 1982; Bolondi and Rocca, 1985); that is, mapping a far-offset section to a near-offset section, thereby collapsing all offsets to zero offset. Hale ( 1983 , 1984 ) ( 1983 , 1984 ) (1983,1984)(1983,1984)(1983,1984) formulated a DMO method in the f k f k f-kf-kfk domain. This method is exact for constant velocity, it can handle all dips and offsets, and is accurate as long as the vertical velocity gradient is moderate. Jacubowicz (1990) developed a conceptually appealing technique that involves first dip decomposition of the input data and application of a DMO operator to each component, individually. Hale (1983), Hale and Artley (1992), and Artley and Hale (1994) extended the DMO theory to accommodate vertical velocity variations. French et al. (1984) developed a partial migration technique that tries to account for variations in source-receiver azimuths, a form particularly suitable for 3-D applications. Biondi and Ronen (1987), Cabrera and Levy (1989), Granser (1994) and Zhou et al. (1996) designed DMO operators applied to shot profiles. All of these techniques are confined to vertical velocity variations for which time migration is appropriate. However, DMO correction cannot, solve stack imperfections caused by lateral velocity variations. Principles of and techniques for DMO correction are described in Section 5.1, and practical aspects of DMO corroction are covered in Section 5.2.
While the practical solution to the problem of conflicting dips with different stacking velocities is DMO correction combined with poststack time migration, the rigorous solution is prestack time migration. A theory for imaging nonzero-offset data based on the doublesquare-root equation is provided in Section D.1. Recall from Section 4.1 that poststack migration, in principle, is based on summation of amplitudes along a zero-offset hyperbolic traveltime curve and placing the summed amplitude to the apex of the hyperbola. Similarly, prestack time migration, in principle, involves summation of amplitudes along the nonzero-offset traveltime curve in midpoint-offset coordinates and placing the summed amplitude at the apex of the surface. The nonzero-offset traveltime equation can be derived by stationary-phase approximation to the doublesquare-root equation (Section D.2). As with the zerooffset case, the welocity field dictates the curvature of the nonzero-offet summation paths. Each commonoffset section can be imaged separately; the results then can be superimposed to produce the migrated section. In practice, however, processing sequence for prestack time migration often incorporates DMO correction and repicking velocities after migration. Fowler (1984) developed a velocity-independent prestack imaging technique that incorporates a step to correct for dipdependency of stacking velocities applied to constantvelocity stacked data. Gardner et al. (1986) combined DMO correction with a velocity-independent prestack imaging technique based on constant-time slices of prestack data in midpoint-offset coordinates. Bancroft and Geiger (1994) developed a prestack imaging tech nique also based on constent-time slices of prestack data, but in shot-receiver coordinates. Practical aspects
of prestack time migration are discussed in Section 5.3, while techniques for migration velocity analysis are described in Section 5.4.

Salt-Flank Reflections

Consider the stacked section in Figure 5.0-1a. While picking velocities in favor of the flat reflections, the steep flank of the diffaction hyperbola of the tip of the salt dome and the steeply dipping reflection off the flank of the salt dome are not stacked with sufficient strength. This inadequate definition of the diffraction and the steeply dipping reflection then causes migration after stack to respond somewhat poorly (Figure 5.0-1b). The stack with dip-moveout correction preserves the diffraction and the steeply dipping reflection as well as the flat reflections (Figure 5.0-1c). As a result, migration yields an image of the salt diapir that stands out clearly in contrast with the surrounding strata (Figure 5.0 1 d 5.0 1 d 5.0-1d5.0-1 d5.01d ).
It is important to evaluate the two migrated sections (Figures 5.0-1b and d) from the viewpoint of an interpreter. Surely, by using the termination points of the nearly flat events in Figure 5.0-1b, one can trace the salt boundary without the need for proper stacking and imaging the reflection of the flank. However, by preserving this reflection on the stacked section and migrating it properly (Figure 5.0-1d), we attain a clue to migration velocity errors. Specifically, if the steeply dipping event that defines the salt boundary and the surrounding flat events cross over each other, we know that overmigration has occurred, and as a result, the salt diapir has not been delineated accurately.

Fault-Plane Reflections

The section in Figure 5.0-2a contains a major listric fault that dips down from left to right. Also, there are many auxiliary faults that intersect this main fault and several antithetic faults which do not intersect it. These fault patterns commonly occur in areas in which extension has taken place. We see reflections associated with the sedimentary strata, as well as faint indications of fault-plane reflections. Along major fault zones, such as those in Figure 5.0-2a, there is often a clear case of conflicting dips. Migration of the stacked section (Figure 5.0-2b) positions the events dipping down from right to left with an acceptable accuracy. Nevertheless, the Listric fault can be inferred and traced only by following the termination points of the dipping events.
The DMO stack shown in Figure 5.0-2c has preserved the conflicting dips associated with the listric fault and the growth faults in comparison with the conventional CMP stack (Figure 5.0-2a). Migration of the DMO stack (Figure 5,0-2d) yields a crisp image of the fault planes associated with the growth faults in contrast with the image from migration of the conventional stack (Figure 5.0-2b).

DMO and Stacking Velocities

We now closely examine an aspect of dip-moveout correction in relation to stacking velocities. Consider the CMP stack in Figure 5.0-3a and the DMO stack in Figure 5.0-3b, and note that the steeply dipping reflections are better preserved by the latter. We know from equation (3-8) that the steeper the dip the higher the stacking velocities. Figure 5.0-4 shows constantvelocity-stack (CVS) panels in the neighborhood of midpoint A A AAA as denoted in Figure 5.0-3a using CMP gathers without and with DMO correction. Note that gently dipping reflections and associated multiples stack at low velocities, whereas steeply dipping reflections stack at high velocities. After DMO correction, the velocities for the steeply dipping events have been corrected for the dip effect; hence both gently dipping and steeply dipping reflections stack with equal strength at low velocities.
Consider velocity analysis at midpoint A A AAA in Figure 5.0-3a where the steeply dipping reflections are in conflict with the reflections associated with the gently dipping strata. The dip effect on stacking velocities can be clearly observed on the velocity spectrum shown in Figure 5.0-5a. The group of semblance peaks on the spectrum in Figure 5.0-5a denoted by A A AAA represent the steeply dipping events which conflict with the nearlyflat events as sen in the stacked section in Figure 5.0 3 b 3 b 3b3 b3b in the neighborhood of milpoint A A AAA. We would have a problem when trying to pick a velocity function from this velocity spectrum. We normally would pick along the predominant velocity trend as denoted in Figure 5.0-5a. This leads to rejection of the picks associated with the steeply dipping refections and a significant reduction in their amplitudes on the stacked section (Figure 5.0-3a). Following DMO correction, the duality in velocity picks are eliminated, and the velocities are corrected for dip as shown in Figure 5.0-5b. Also, note the improved velocity trend after DMO correction.
Figure 5.0-6 shows a close-up view of the CMP gather at midpoint A A AAA as in Figure 5.0-3a without DMO correction, the velocity spectrum, and the gather after NMO correction using the velocity function denoted in the velocity spectrum. The overcorrected events on the
(a)
(b)
(c)
(d)
FIG. 5.0-1. Conflicting dips associated with salt flanks: (a) CMP stack without dip-moveout correction; (b) time migration of the stack in (a); (c) the stack with dip-moveout correction; (d) time migration of the stack in (c).

FIG. 5.0-3. (a) A CMP stack, and (b) a DMO stack. See Figures 5.0-4 through 5.0-11 for the results of velocity analy performed at midpoint locations A A AAA and B B BBB using CMP gathers before and after DMO correction.
a
b
FIG. 5.0-5. Velocity spectrum at midpoint location A A AAA as in Figure 5.0 3 5.0 3 5.0-35.0-35.03 without (a) and with (b) DMO correction. The group of semblance peaks on the spectrum in (a) denoted by A A AAA represents the steepiy dipping events which conflict with the nearly flat events as seen in the stacked section in Figure 5.0-3b in the neighborhood of midpoint A A AAA.
moveout-corrected gather represent the steeply dipping reflections, and the undercorrected events represent the multiple reflections.
The cloev-up view of the CMP gather in Figure 5.0-6 after DMO corroction is shown in Figure 5.07. Note the more rigorous delincation of the velocity trend in the spectrum as compared to that in Figure 5.0-6. The absence of the overcorrected events in the moveout-corrected gather is a convincing evidence that the velocities of the steeply dipping reflections have been corrected for the dip effect as inferred by equation (3-8). Where are the overcorrected events that we see in Figure 5.0-6c? Are they still present in the moveoutcorrected gather after DMO correction shown in Figure 5.0-7c? They should not be, because both flat events and dipping events could not be flattened simultaneously in the same gather. Moreover, the semblance peak in the velocity spectrum denoted by A A AAA in Figure 5.0 5 a 5.0 5 a 5.0-5a5.0-5 \mathrm{a}5.05a is absent in Figure 5.0-5b after dip-moveout correction. Did it merge with the semblance peaks aligned with the velocity trend denoted in Figure 5.0-5b? No, it did not; instead, the energy represented by the semblance peak A A AAA in Figure 5.0-5a actually has moved to another CMP location in the updip direction. So, we begin to have a clue to another aspect of dip-moveout correction that it may not be a moveout correction after all. We shall examine this clue closely later in Section 5.1.
The case in the neighborhood of midpoint A A AAA in Figure 5.0 3 a 5.0 3 a 5.0-3a5.0-3 \mathrm{a}5.03a is that of reflections with conflicting dips. Often, on stacked data, diffractions and reflections also form couflicting dips. Figure 5.0-8 shows constantvelocity-stack (CVS) panels in the neighborhood of midpoint B B BBB as denoted in Figure 5.0-3a using CMP gathers without and with DMO correction. Note that gently dipping reflections stack at low velocities, whereas the diffraction off the tip of the salt diapir stack at high velocities. After DMO correction, the velocities for the steeply dipping events have been corrected for the dip effect; hence both gently dipping reflections and the diffraction stack with equal strength at low velocities.
Consider velocity analysis at midpoint B B BBB as in Figure 5.0 3 a 5.0 3 a 5.0-3a5.0-3 \mathrm{a}5.03a where the diffraction off the tip of the salt diapir are in conflict with the refloctions associated with the gently dipping strata. The dip effect on stacking velocities can be clearly observed on the velocity spectrum shown in Figure 5.0-9a. The semblance peak on the spectrum denoted by B B BBB represents the diffraction off the tip of the salt dome which conflicts with the nearly flat events as soen in the stacked section in Figure 5.0 3 b 3 b 3b3 \mathrm{~b}3 b in the neighborhood of midpoint B B BBB. Again, we would normally pick along the predominant velocity trend as denoted in Figure 5.0-9a. This leads to rejection of the pick associated with the diffraction, which would mean failure of preserving it on the stacked section (Figure
a
b
C
FIG. 5.0-6. A elowe-up view of (a) the CMP gather at midpoint A A AAA as in Figure 5.0-3 without DMO correction, (b) the veiocity spectrun, and (c) the CMP gather is in (a) after NMO correction using the velocity function denoted in the velocity spertrum in (b).
a
FIG. 5.0-7. A close-up view of (a) the CMP gather at midpoint A A AAA as in Figure 5.0 3 5.0 3 5.0-35.0-35.03 with DMO correction, (b) the velocity spectrum, and (c) the CMP gather as in (a) after NMO correction using the velocity function dencted in the velocity spectrum in (b).
a
b
FIG. 5.0-9. Velocity spectrum at midpoint location B B BBB as in Figure 5.0 3 5.0 3 5.0-35.0-35.03 without (a) and with (b) DMO correction. The scmblance peak on the spectrum in (a) denoted by B B BBB represents the diffraction off the tip of the salt dome which conflicts with the nearly flat events as seen in the stacked section in Figure 5.0-3b in the neighborhood of midpoint B.
5.0-3a). Following DMO correction, the duality in velocity picks is eliminated, and the velocities are corrected for dip as shown in Figure 5.0-9b.
Figure 5.0-10 shows a close-up view of the CMP gather at midpoint B B BBB as in Figure 5.0-3a without DMO correction, the velocity spectrum, and the gather after NMO correction using the velocity function denoted in the velocity spectrum. The overcorrerted event at 3.75 s 3.75 s 3.75s3.75 \mathrm{~s}3.75 s on the moveout-corrected gather represents the diffraction, and the undercorrected events represent the multiple reflections.
The close-up view of the CMP gather as in Figure 5.0-10 after DMO correction is shown in Figure 5.011. Note the more rigorous delineation of the velocity trend in the spectrum as compared to that in Figure 5.010. The overcorrected event associated with the diffraction is absent in the moveout-corrected gather once again, convincing evidence that the diffraction velocity has been corrected for the dip effect. The diffraction energy, however, that gave rise to the peak denoted by B B BBB in Figure 5.0-9a is absent in the moveout-corrected gather after DMO correction shown in Figure 5.0-11c. Dip-moveout correction, unlike cotventional normalmoveout correction, has caused energy to move from one CMP location to another.
Figure 5.0-12 shows time migrations of the CMP. stacked and DMO-stacked sections in Figure 5.0-3. Be- cause the steep events associated with the diffraction energy and the dipping reflections have been preserved in the DMO stack (Figure 5.0-3b), time migration of this section produces an image of the salt dipair with its boundaries clearly delitueated (Figure 5.0-12b). In contrast, the boundaries of the salt diapir in the CMP stack can be delineated only by the terminations of the gently dipping strata (Figure 5.0-12a).

Turning-Wave Reflections

When salt tectonism is at an advanoed stage, it can cause overhang structures. If velocities within the surrounding sedimentary strata increase rapidly with depth, it is possible to record reflections from the underside of the salt overhang. These reflections are associated with turning vaves that first travel downward after they bounce off the underside of the salt overhang before returning to the surface. Turning-wave reflections give rise to a dipping event on the stacked section that conflicts with the refloctions nssociated with the: surrounding gently dipping strata. Nevertheless, dipmoveout correction alone does not strictly preserve the dipping event associated with the turning waves, since these waves propagate at angles greater than 90 degrees.
a
b
c c c\mathbf{c}c
FIG. 5.0-10. A close-up view of (a) the CMP gather at midpoint B B BBB as in Figure 5.0-3 without DMO correction, (b) the velocity spectrum, and (c) the CMP gather as in (a) after NMO correction using the velocity function depicted in the velocity spectrum in (b).
FIG. 5.0-11. A close-up view of (a) the CMP gather at midpoint B B BBB as in Figure 5.0 3 5.0 3 5.0-35.0-35.03 with DMO correction, (b) the velocity spectrum, and (c) the CMP gather as in (a) after NMO onroction using the velocity function depicted in the vilocity spoctrum in (b).
s
1
FIG. 5.0-12. Time migrations of (a) the CMP stack, and (b) the DMO stack as in Figure 5.0-3.
a
b
FIG. 5.0-13. (a) Conventional poststack time migration; (b) turning-wave migration. (Courtesy Schlumberger Geco-Prakla.)
They can be preserved only by making use of its abnormal moveout behavior during stacking and imaged properly by making use of the evanescent energy associated with dips greater than 90 degrees during migration (Section 5.1).
Figure 5.0-13 shows a field data example of turningwave migration. The salt boundary from the image based on phase-shift migration of the conventional stack can be inferred only from the termination of the reflectors associated with the surrounding sedimentary soquence. Whereas, the image based on the turning-wave migration of the stack that preserves the turning-wave energy shows the overhang structure on either side of the salt intrusion, distinctively.

5.1 PRINCIPLES OF DIP-MOVEOUT CORRECTION

The objective we want to achieve with the combination of normal-moveout and dip-moveout correction is mapping nonzero-offset data to the plane of zero-offset section. Once each common-offset section is mapped to zero-offset, the data can then be migrated either before or after stack using the zero-ofiset theory for migration as described in Chapter 4.
Figure 5.1-1a depicts the nonzero-offset recording geometry associated with a dipping reflector. The nonzero-offset traveltime t = S R G / v t = S R G / v t=SRG//vt=S R G / vt=SRG/v is measured along the raypath from source S S SSS to reflection point R R RRR to reociver G G GGG, where v v vvv is the velocity of the medium above the dipping reflector. This arrival time is depicted on the time section in Figure 5.1-1b by point A A AAA on the trace that coincides with midpoint y n y n y_(n)y_{n}yn. We want to map the amplitude at time t t ttt denoted by the sample A A AAA on the trace at midpoint y n y n y_(n)y_{n}yn of the common-offset section with offset 2 h 2 h 2h2 h2h to time τ 0 τ 0 tau_(0)\tau_{0}τ0 denoted hy the sample C C CCC on the trace at midpoint y 0 y 0 y_(0)y_{0}y0 of the zero-ofiset section. We achieve this mapping in two steps:
(a) Normal-moveout corroction that maps the amplitude at time t t ttt denoted by the sample A A AAA on the trace at midpoint y n y n y_(n)y_{n}yn of the common-offset section with offset 2 h 2 h 2h2 h2h to time t n t n t_(n)t_{n}tn denoted by the sample B B BBB on the same trace at midpoint y n y n y_(n)y_{n}yn of the same common-offset section.
FIG. 5.1-1, (a) The geometry of a nonzero-offset recording of reflections from a dipping layer boundary; (b) a sketch of the time section depicting the varnous traveltimes. NMO correction involves corordinate transformation from y n t y n t y_(n)-ty_{n}-tynt to y n t n y n t n y_(n)-t_(n)y_{n}-t_{n}yntn by mapping amplitude A A AAA at time t t ttt to B B BBB at time t n t n t_(n)t_{n}tn on the same trace. DMO correction involves coordinate transformation from y n t n y n t n y_(n)-t_(n)y_{n}-t_{n}yntn to y 0 τ 0 y 0 τ 0 y_(0)-tau_(0)y_{0}-\tau_{0}y0τ0 by mapping amplitude B B BBB at time t n t n t_(n)t_{n}tn on the trace at midpoint location y n y n y_(n)y_{n}yn of the moveout-corrccted common-ofiset section to amplitude C C CCC at tirne τ 0 τ 0 tau_(0)\tau_{0}τ0 on the trace at midpoint location y 0 y 0 y_(0)y_{0}y0 of the zero-offset section. Zero-offset migration involves coordinate transformation from y 0 τ 0 y 0 τ 0 y_(0)-tau_(0)y_{0}-\tau_{0}y0τ0 to y m τ y m τ y_(m)-tauy_{m}-\tauymτ by mapping amplitude C C CCC at time τ 0 τ 0 tau_(0)\tau_{0}τ0 on the trace at. midpoint location y 0 y 0 y_(0)y_{0}y0 of the zero-offset section to amplitude D D DDD at time τ τ tau\tauτ on the trace at midpoint location y m y m y_(m)y_{m}ym of the migrated section. Migration before stack involves direct mapping of amplitude A A AAA at time t t t\boldsymbol{t}t on the trace at midpoint. location y n y n y_(n)y_{n}yn of the common-offset section to amplitude D D DDD at time r r rrr on the trace at midpoint location y m y m ym\mathrm{ym}ym of the migrated section. Sec text for the rcla tionships between the coordinate variables.
(b) Dip-moveout correction that maps the amplitude at time t n t n t_(n)t_{n}tn denoted by the sample B B BBB on the trace at midpoint y n y n y_(n)y_{n}yn of the moveout-corrected commonoffset section with offset 2 h 2 h 2h2 h2h to time τ 0 τ 0 tau_(0)\tau_{0}τ0 denoted by the sample C C CCC on the trace at midpoint y 0 y 0 y_(0)y_{0}y0 of the zero-offset section.
Zero-offset migration then maps the amplitude at time τ 0 τ 0 tau_(0)\tau_{0}τ0 denoted by the sample C C CCC on the trace at midpoint y 0 y 0 y_(0)y_{0}y0 of the zero-ofiset section to the amplitude at time τ τ tau\tauτ denoted by the sample D D DDD on the trace at midpoint y m y m y_(m)y_{m}ym of the migrated section. Note that the combination of NMO correction, DMO correction, and zero-offset migration achieves the same objective as direct mapping of the amplitude at time t t ttt denoted by the sample A A AAA on the trace at nidpoint y n y n y_(n)y_{n}yn of the common-offset section with offset 2 h 2 h 2h2 h2h to the amplitude at time τ τ tau\tauτ denoted by the sample D D DDD on the trace at midpoint y m y m y_(m)y_{m}ym of the migrated section. This direct mapping procedure is the basis of algorithms for migration before stack (Section 5.3).
The important point to note is that the normalmoveout correction in step (a) is performed using the velocity of the medium above the dipping reflector.
The NMO equation (3-8) defines the traveltime t t ttt from source location S S SSS to the reflection point R R RRR to the receiver location G G GGG. This equation, written in prestack data coordinates, is
t 2 = t 0 2 + 4 h 2 cos 2 ϕ v 2 t 2 = t 0 2 + 4 h 2 cos 2 ϕ v 2 t^(2)=t_(0)^(2)+(4h^(2)cos^(2)phi)/(v^(2))t^{2}=t_{0}^{2}+\frac{4 h^{2} \cos ^{2} \phi}{v^{2}}t2=t02+4h2cos2ϕv2
where 2 h 2 h 2h2 h2h is the offsct, v v vvv is the medium velocity above the reflector, ϕ ϕ phi\phiϕ is the reflector dip, and t 0 t 0 t_(0)t_{0}t0 is the two-way zero-offset time at midpoint location y n y n y_(n)y_{n}yn.
Dip-moveout correction of step (b) is preceded by zero-dip normal-moveout correction of step (a) using the dip-independent velocity v v vvv :
t 2 = t n 2 + 4 h 2 v 2 t 2 = t n 2 + 4 h 2 v 2 t^(2)=t_(n)^(2)+(4h^(2))/(v^(2))t^{2}=t_{n}^{2}+\frac{4 h^{2}}{v^{2}}t2=tn2+4h2v2
where t n t n t_(n)t_{n}tn is the event time at midpoint y n y n y_(n)y_{n}yn after the NMO correction. Event time t n t n t_(n)t_{n}tn after the NMO correction and event time t 0 t 0 t_(0)t_{0}t0 are related as follows (Section E.2)
t π 2 = t 0 2 4 h 2 sin 2 ϕ v 2 t π 2 = t 0 2 4 h 2 sin 2 ϕ v 2 t_(pi)^(2)=t_(0)^(2)-(4h^(2)sin^(2)phi)/(v^(2))t_{\pi}^{2}=t_{0}^{2}-\frac{4 h^{2} \sin ^{2} \phi}{v^{2}}tπ2=t024h2sin2ϕv2
At first glance, equations (5-2) and (5-3) suggest a two-step approach to moveout corrction:
(a) Apply a d u d u dud udu-zndependent moveout correction using equation (5-2) to map the amplitude at time t t ttt denoted by the sample A A AAA on the trace at midpoint y n y n y_(n)y_{n}yn of the common-offset section with offset 2 h 2 h 2h2 h2h to time t n t n t_(n)t_{n}tn denoted by the sample B B BBB on the same trace at midpoint y n y n y_(n)y_{n}yn of the same common-offset section.
(b) Apply a dop-dependent moveout correction using equation (5-3) to map the amplitude at time t n t n t_(n)t_{n}tn denoted by the sample B B BBB on the trace at midpoint y n y n y_(n)y_{n}yn of the moveout-corrected common-olfset section with offset 2 h 2 h 2h2 h2h to time t 0 t 0 t_(0)t_{0}t0 denoted by the sample
B B B^(')B^{\prime}B on the same trace at midpoint y n y n y_(n)y_{n}yn of the same common-offset section.
This two-step moveout correction is equivalent to the one-step moveout correction using equation (5-1) to map event time t t ttt directly to event time t 0 t 0 t_(0)t_{0}t0.
Our goal, however, is to map event time t t ttt not to t 0 t 0 t_(0)t_{0}t0 - the two-way zero-offset time associated with midpoint y n y n y_(n)y_{n}yn between source S S SSS and receiver G G GGG, but to τ 0 τ 0 tau_(0)\tau_{0}τ0 - the two-way zero-offset time at midpoint location y 0 y 0 y_(0)y_{0}y0 associated with the normal-incidence reflection point R R RRR (Figure 5.1-1). The relationships between ( y n , t n ) y n , t n (y_(n),t_(n))\left(y_{n}, t_{n}\right)(yn,tn) coordinates of the normal-moveout-corrected data and ( y 0 , τ 0 ) y 0 , τ 0 (y_(0),tau_(0))\left(y_{0}, \tau_{0}\right)(y0,τ0) coordinates of the dip-moveout-corrected data are given by (Section E.2):
y 0 = y n h 2 t n A ( 2 sin ϕ v ) y 0 = y n h 2 t n A 2 sin ϕ v y_(0)=y_(n)-(h^(2))/(t_(n)A)((2sin phi)/(v))y_{0}=y_{n}-\frac{h^{2}}{t_{n} A}\left(\frac{2 \sin \phi}{v}\right)y0=ynh2tnA(2sinϕv)
and
τ 0 = t n A τ 0 = t n A tau_(0)=(t_(n))/(A)\tau_{0}=\frac{t_{n}}{A}τ0=tnA
where
A = 1 + h 2 t n 2 ( 2 sin ϕ v ) 2 A = 1 + h 2 t n 2 2 sin ϕ v 2 A=sqrt(1+(h^(2))/(t_(n)^(2))((2sin phi)/(v))^(2))A=\sqrt{1+\frac{h^{2}}{t_{n}^{2}}\left(\frac{2 \sin \phi}{v}\right)^{2}}A=1+h2tn2(2sinϕv)2
For completeness, the relationship between event times t n t n t_(n)t_{n}tn and t 0 t 0 t_(0)t_{0}t0 is given by (Section E.2)
t 0 = t n A t 0 = t n A t_(0)=t_(n)At_{0}=t_{n} At0=tnA
Note from equation (5-5) that A 1 A 1 A >= 1A \geq 1A1; thereforc, τ 0 t n τ 0 t n tau_(0) <= t_(n)\tau_{0} \leq t_{n}τ0tn (equation 5-4b) and t 0 t n t 0 t n t_(0) >= t_(n)t_{0} \geq t_{n}t0tn (equation 5-6).
Refer to Figure 5.1-1 and note that the normalmoveout correction that precedes the dip-moveout correction maps the amplitude at sumple A A AAA with coordinates ( y n , t ) y n , t (y_(n),t)\left(y_{n}, t\right)(yn,t) to sample B B BBB with coordinates ( y n , t n ) y n , t n (y_(n),t_(n))\left(y_{n}, t_{n}\right)(yn,tn). So, the midpont coordznate as invarnant under NMO cornectron. The difference between the input time t t ttt and the output time t n t n t_(n)t_{n}tn is defined by
Δ t N M O = t t n , Δ t N M O = t t n , Deltat_(NMO)=t-t_(n),\Delta t_{N M O}=t-t_{\mathrm{n}},ΔtNMO=ttn,
which can be expressed by way of equation (5-2) as follows
Δ t N M O = t n ( A n 1 ) Δ t N M O = t n A n 1 Deltat_(NMO)=t_(n)(A_(n)-1)\Delta t_{N M O}=t_{n}\left(A_{n}-1\right)ΔtNMO=tn(An1)
where
A n = 1 + h 2 t n 2 ( 2 v ) 2 A n = 1 + h 2 t n 2 2 v 2 A_(n)=sqrt(1+(h^(2))/(t_(n)^(2))((2)/(v))^(2))A_{n}=\sqrt{1+\frac{h^{2}}{t_{n}^{2}}\left(\frac{2}{v}\right)^{2}}An=1+h2tn2(2v)2
Again, refer to Figure 5.1-1 and note that the dipmoveout correction maps the amplitude at sample B B BBB with coordinates ( y n , t n ) y n , t n (y_(n),t_(n))\left(y_{n}, t_{n}\right)(yn,tn) to sample C C CCC with coordinates ( y 0 , τ 0 ) y 0 , τ 0 (y_(0),tau_(0))\left(y_{0}, \tau_{0}\right)(y0,τ0). So, the midpoint coordinate is varzant under D M O D M O DMOD M ODMO correction. The lateral excursion associated with the DMO correction is given by
Δ y D M O = | y n y 0 | , Δ y D M O = y n y 0 , Deltay_(DMO)=|y_(n)-y_(0)|,\Delta y_{D M O}=\left|y_{n}-y_{0}\right|,ΔyDMO=|yny0|,
which can be expressed by way of equations (5-4a) and ( 5 5 ) ( 5 5 ) (5-5)(5-5)(55) as
Δ y D M O = h 2 t n A ( 2 sin ϕ v ) Δ y D M O = h 2 t n A 2 sin ϕ v Deltay_(DMO)=(h^(2))/(t_(n)A)((2sin phi)/(v))\Delta y_{D M O}=\frac{h^{2}}{t_{n} A}\left(\frac{2 \sin \phi}{v}\right)ΔyDMO=h2tnA(2sinϕv)
The difference between the input time t n t n t_(n)t_{n}tn and the output time τ 0 τ 0 tau_(0)\tau_{0}τ0 is defined by
Δ t D M O = t n τ 0 , Δ t D M O = t n τ 0 , Deltat_(DMO)=t_(n)-tau_(0),\Delta t_{D M O}=t_{n}-\tau_{0},ΔtDMO=tnτ0,
which can be expressed by way of equations ( 5 4 b ) ( 5 4 b ) (5-4b)(5-4 \mathrm{~b})(54 b) and ( 5 5 ) ( 5 5 ) (5-5)(5-5)(55) as
Δ t D M O = t n ( 1 1 A ) Δ t D M O = t n 1 1 A Deltat_(DMO)=t_(n)(1-(1)/(A))\Delta t_{D M O}=t_{n}\left(1-\frac{1}{A}\right)ΔtDMO=tn(11A)
Finally, as sketched in Figure 5.1-1, the reflection point dispersal Δ = N R Δ = N R Delta=NR\Delta=N RΔ=NR is defined by the distance along the dipping reflector between the normalincidence points N N NNN and R R RRR associated with midpoints y n y n y_(n)y_{n}yn and 30 , respectively. By way of cquations (E-18) ard (5-8a) it follows that (Section E.1)
Δ = h 2 t n A ( sin 2 ϕ v ) Δ = h 2 t n A sin 2 ϕ v Delta=(h^(2))/(t_(n)A)((sin 2phi)/(v))\Delta=\frac{h^{2}}{t_{n} A}\left(\frac{\sin 2 \phi}{v}\right)Δ=h2tnA(sin2ϕv)
Note from equation (5-10) that reflection point dispersal is nill for zero offset, and increases with the square of the offset. Also, the larger the dip and shallower the reflector, the larger the dispersal.
A direct consequence of equation (5-10) is that a reflection event on a CMP gather is associated with more than one reflection point on the reflector. Following DMO correction, reflection-point dispersal is eliminated and, hence, the reflection event is associated with a single reflection point at normal-incidence (point R R RRR in Figure 5.1-1). While prestack data before DMO correction can be associated with common madponts, and thus sorted into common-midyont (CMP) gathers; after DMO correction, the data can be associated with common reflection ponts, and thus can be considered in the form of common-reflection-point (CRP) gathers.

Prestack Partial Migration

While conventional normal-moveout correction involves only a time shift given by equation (5-7b), dip-moveout correction involves mapping both in time and space given by equations ( 5 8 b ) ( 5 8 b ) (5-8b)(5-8 \mathrm{~b})(58 b) and (5-9b), respectively. This means that dip-moveout correction, strictly speaking, is not a moveout correction in conventional terms; rather, it is a process of partal magration before stack applied
to common-offset data. We therefore may speak of a dip-moveont operntor with a specific impulse response as for the migration process itself. Following this partial migration to map nonzero-offset data to the plane of zero-offset, each common-offset section is then fully migrated using a zero-offset migration operator.
A dip-moveout operator maps amplitudes on a moveout-corrected trace of a common-offset section along its impulse response trajectory. Before we derive the expression for its impulse response, we shall first make some inferences about the DMO process based on equations (5-8b) and (5-9b). Tables 5-1, 5-2, and 5-3 show horizontal ( y D M O ) y D M O (/_\y_(DMO))\left(\triangle y_{D M O}\right)(yDMO) and vertical ( Δ t D M O ) Δ t D M O (Deltat_(DMO))\left(\Delta t_{D M O}\right)(ΔtDMO) displacements associated with dip-moveout correction described by equations (5-8b) and (5-9b), respectively. Combined with equations ( 5 8 b ) ( 5 8 b ) (5-8b)(5-8 b)(58b) and ( 5 9 b ) ( 5 9 b ) (5-9b)(5-9 b)(59b), we make the following observations:
(a) Set ϕ = 0 ϕ = 0 phi=0\phi=0ϕ=0 in equations (5-8b) and (5-10b), and note that Δ y D M O = 0 Δ y D M O = 0 Deltay_(DMO)=0\Delta y_{D M O}=0ΔyDMO=0 and Δ t D M O = 0 Δ t D M O = 0 Deltat_(DMO)=0\Delta t_{D M O}=0ΔtDMO=0. Hence, the DMO operator has no effect on a flat reflector, irrespective of the offet. The steeper the dip, the larger the DMO correction.
(b) Note from Table 5-1 that the horizontal displacement Y D M O Y D M O /_\Y_(DMO)\triangle Y_{D M O}YDMO and the vertical displacement Δ t D m o Δ t D m o Deltat_(Dmo)\Delta t_{D m o}ΔtDmo decrecse with time t n t n t_(n)t_{n}tn. This means that the spatial aperture of the dip-moveout operator, in contrast with a migration operator, actually decreases with event time.
(c) Substitute equation (5-5) into equation (5-8b) and note that, in the limit t n = 0 t n = 0 t_(n)=0t_{n}=0tn=0, y D M O = h D M O = h _(DMO)=h_{D M O}=hDMO=h. This means that the largest spatial extent of the DMO operator equals the offset 2 h 2 h 2h2 h2h associated with the moveout-corrected trace at t n = 0 t n = 0 t_(n)=0t_{n}=0tn=0.
Table 5-1. Horizontal ( y D M O ) y D M O {:/_\y_(DMO))\left.\triangle y_{D M O}\right)yDMO) and vertical ( Δ t D M O ) Δ t D M O (Deltat_(DMO))\left(\Delta t_{D M O}\right)(ΔtDMO) displacements associated with dip-moveout correction described by equations (5-8b) and (5-9b), respectively, for a given moveout-corrected time varjable t n t n t_(n)t_{n}tn and velocity v v vvv. The dip angle ϕ = 30 ϕ = 30 phi=30\phi=30ϕ=30 degrees, half-offset h = 1500 m h = 1500 m h=1500mh=1500 \mathrm{~m}h=1500 m. Also given are the corresponding values for the reflection point smear Δ Δ Delta\DeltaΔ as in equation (5-10).
t n t n t_(n)t_{n}tn
( s ) ( s ) (s)(\mathrm{~s})( s)
t_(n) (s)| $t_{n}$ | | :--- | | $(\mathrm{~s})$ |
v v vvv
( m / s ) ( m / s ) (m//s)(\mathrm{~m} / \mathrm{s})( m/s)
v (m//s)| $v$ | | :---: | | $(\mathrm{~m} / \mathrm{s})$ |
Δ y D M O Δ y D M O Deltay_(DMO)\Delta y_{D M O}ΔyDMO
( m ) ( m ) (m)(\mathrm{~m})( m)
Deltay_(DMO) (m)| $\Delta y_{D M O}$ | | ---: | | $(\mathrm{~m})$ |
Δ t D M O Δ t D M O Deltat_(DMO)\Delta t_{D M O}ΔtDMO
( s ) ( s ) (s)(\mathrm{~s})( s)
Deltat_(DMO) (s)| $\Delta t_{D M O}$ | | ---: | | $(\mathrm{~s})$ |
Δ Δ Delta\DeltaΔ
( m ) ( m ) (m)(\mathrm{m})(m)
Delta (m)| $\Delta$ | | :---: | | $(\mathrm{m})$ |
0.5 2400 1,170 0.188 1,013
1.0 2400 793 0.152 687
1.5 2400 575 0.115 497
2.0 2400 446 0.090 386
2.5 2400 363 0.075 314
3.0 2400 305 0.063 264
4.0 2400 230 0.008 199
"t_(n) (s)" "v (m//s)" "Deltay_(DMO) (m)" "Deltat_(DMO) (s)" "Delta (m)" 0.5 2400 1,170 0.188 1,013 1.0 2400 793 0.152 687 1.5 2400 575 0.115 497 2.0 2400 446 0.090 386 2.5 2400 363 0.075 314 3.0 2400 305 0.063 264 4.0 2400 230 0.008 199| $t_{n}$ <br> $(\mathrm{~s})$ | $v$ <br> $(\mathrm{~m} / \mathrm{s})$ | $\Delta y_{D M O}$ <br> $(\mathrm{~m})$ | $\Delta t_{D M O}$ <br> $(\mathrm{~s})$ | $\Delta$ <br> $(\mathrm{m})$ | | ---: | ---: | ---: | ---: | ---: | | 0.5 | 2400 | 1,170 | 0.188 | 1,013 | | 1.0 | 2400 | 793 | 0.152 | 687 | | 1.5 | 2400 | 575 | 0.115 | 497 | | 2.0 | 2400 | 446 | 0.090 | 386 | | 2.5 | 2400 | 363 | 0.075 | 314 | | 3.0 | 2400 | 305 | 0.063 | 264 | | 4.0 | 2400 | 230 | 0.008 | 199 |
(d) Compare the values for y D M O y D M O /_\y_(DMO)\triangle y_{D M O}yDMO and Δ t D M O Δ t D M O Deltat_(DMO)\Delta t_{D M O}ΔtDMO in Tables 5-1 and 5-2, and note that the lower the velocity, the larger the DMO correction. This also implies that the shallower the event. the more significant the DMO term, since lower velocities generally are found in shallow parts of the seismic data.
(e) For a specific reflector dip ϕ ϕ phi\phiϕ, compare the values for Δ y D M O Δ y D M O Deltay_(DMO)\Delta y_{D M O}ΔyDMO and Δ t D M O Δ t D M O Deltat_(DMO)\Delta t_{D M O}ΔtDMO in Tables 5-2 and 5-3, and note that the larger the offset 2 h 2 h 2h2 h2h, the more the DMO correction. Whatever the reflector dip, DMO correction has no effect on zero-offset data with h = 0 h = 0 h=0h=0h=0.
Table 5-2. Horizontal ( /_\\triangle VDMO ) and vertical ( Δ t D M O Δ t D M O Deltat_(DMO)\Delta t_{D M O}ΔtDMO ) displacements associated with dip-moveout correction described by equations (5-8b) and ( 5 9 b 5 9 b 5-9b5-9 b59b ), respectively, for a given moveout-corrected time variable t n t n t_(n)t_{n}tn and velocity v v vvv. The dip angle ϕ = 30 ϕ = 30 phi=30\phi=30ϕ=30 degrees, half-offset h = 1500 m h = 1500 m h=1500mh=1500 \mathrm{~m}h=1500 m. Also given are the corresponding values for the reflection point smear Δ Δ Delta\DeltaΔ as in equation (5-10).
t n t n t_(n)t_{n}tn
( s ) ( s ) (s)(\mathrm{~s})( s)
t_(n) (s)| $t_{n}$ | | :--- | | $(\mathrm{~s})$ |
v v vvv
( m / s ) ( m / s ) (m//s)(\mathrm{~m} / \mathrm{s})( m/s)
v (m//s)| $v$ | | :---: | | $(\mathrm{~m} / \mathrm{s})$ |
y D M O y D M O /_\y_(DMO)\triangle y_{D M O}yDMO
( m i ) ( m i ) (mi)(\mathrm{mi})(mi)
/_\y_(DMO) (mi)| $\triangle y_{D M O}$ | | ---: | | $(\mathrm{mi})$ |
Δ t D M O Δ t D M O Deltat_(DMO)\Delta t_{D M O}ΔtDMO
(s)
Deltat_(DMO) (s)| $\Delta t_{D M O}$ | | ---: | | (s) |
Δ Δ Delta\DeltaΔ
( m ) ( m ) (m)(\mathrm{m})(m)
Delta (m)| $\Delta$ | | ---: | | $(\mathrm{m})$ |
0.5 1800 1,284 0.243 1,111
1.0 2000 900 0.200 779
1.5 2200 620 0.135 536
2.0 2400 446 0.090 386
2.5 2700 324 0.060 280
3.0 3000 246 0.036 213
4.0 4000 140 0.016 121
"t_(n) (s)" "v (m//s)" "/_\y_(DMO) (mi)" "Deltat_(DMO) (s)" "Delta (m)" 0.5 1800 1,284 0.243 1,111 1.0 2000 900 0.200 779 1.5 2200 620 0.135 536 2.0 2400 446 0.090 386 2.5 2700 324 0.060 280 3.0 3000 246 0.036 213 4.0 4000 140 0.016 121| $t_{n}$ <br> $(\mathrm{~s})$ | $v$ <br> $(\mathrm{~m} / \mathrm{s})$ | $\triangle y_{D M O}$ <br> $(\mathrm{mi})$ | $\Delta t_{D M O}$ <br> (s) | $\Delta$ <br> $(\mathrm{m})$ | | :---: | :---: | :---: | :---: | :---: | | 0.5 | 1800 | 1,284 | 0.243 | 1,111 | | 1.0 | 2000 | 900 | 0.200 | 779 | | 1.5 | 2200 | 620 | 0.135 | 536 | | 2.0 | 2400 | 446 | 0.090 | 386 | | 2.5 | 2700 | 324 | 0.060 | 280 | | 3.0 | 3000 | 246 | 0.036 | 213 | | 4.0 | 4000 | 140 | 0.016 | 121 |
Table 5-3. Horizontal ( /_\\triangle у D M O D M O _(DMO)_{D M O}DMO ) and vertical ( Δ t D M O Δ t D M O Deltat_(DMO)\Delta t_{D M O}ΔtDMO ) displacements associated with dip-moveout correction described by equations ( 5 8 b 5 8 b 5-8b5-8 b58b ) and (5-9b), respectively, for a given moveout-corrected time variable t n t n t_(n)t_{n}tn and velocity v v vvv, The dip angle ϕ = 30 ϕ = 30 phi=30\phi=30ϕ=30 degrees, half-offset h = 500 m h = 500 m h=500mh=500 \mathrm{~m}h=500 m. Also given are the corresponding values for the reflection point smear Δ Δ Delta\DeltaΔ as in equation (5-10).
t n t n t_(n)t_{n}tn v v vvv Δ y D M O Δ y D M O Deltay_(DMO)\Delta y_{D M O}ΔyDMO Δ t D M O Δ t D M O Deltat_(DMO)\Delta t_{D M O}ΔtDMO Δ Δ Delta\DeltaΔ
( s ) ( s ) (s)(\mathrm{s})(s) ( m / s ) ( m / s ) (m//s)(\mathrm{m} / \mathrm{s})(m/s) ( m ) ( m ) (m)(\mathrm{m})(m) ( s ) ( s ) (s)(\mathrm{s})(s) ( m ) ( m ) (m)(\mathrm{m})(m)
0.5 1800 241 0.064 209
1.0 2000 121 0.030 105
1.5 2200 74 0.015 64
2.0 2400 51 0.010 44
2.5 2700 37 0.008 32
3.0 3000 27 0.004 23
4.0 4000 15 0.000 13
t_(n) v Deltay_(DMO) Deltat_(DMO) Delta (s) (m//s) (m) (s) (m) 0.5 1800 241 0.064 209 1.0 2000 121 0.030 105 1.5 2200 74 0.015 64 2.0 2400 51 0.010 44 2.5 2700 37 0.008 32 3.0 3000 27 0.004 23 4.0 4000 15 0.000 13| $t_{n}$ | $v$ | $\Delta y_{D M O}$ | $\Delta t_{D M O}$ | $\Delta$ | | ---: | ---: | ---: | ---: | ---: | | $(\mathrm{s})$ | $(\mathrm{m} / \mathrm{s})$ | $(\mathrm{m})$ | $(\mathrm{s})$ | $(\mathrm{m})$ | | | | | | | | 0.5 | 1800 | 241 | 0.064 | 209 | | 1.0 | 2000 | 121 | 0.030 | 105 | | 1.5 | 2200 | 74 | 0.015 | 64 | | 2.0 | 2400 | 51 | 0.010 | 44 | | 2.5 | 2700 | 37 | 0.008 | 32 | | 3.0 | 3000 | 27 | 0.004 | 23 | | 4.0 | 4000 | 15 | 0.000 | 13 |
(f) Finally, note from Tables 5-1, 5-2 and 5-3 that the reflection point smear Δ Δ Delta\DeltaΔ given by equation (5-10) decreases in time and for small offsets.

Frequency-Wavenumber DMO Correction

Refer to Figure 5.1-1 and recall that our objective with DMO correction is to transform the normal-moveoutcorrected prestack data P n ( y n , t n ; h ) P n y n , t n ; h P_(n)(y_(n),t_(n);h)P_{n}\left(y_{n}, t_{n} ; h\right)Pn(yn,tn;h) from y n t n y n t n y_(n)-t_(n)y_{n}-t_{n}yntn coordinates to y 0 τ 0 y 0 τ 0 y_(0)-tau_(0)y_{0}-\tau_{0}y0τ0 coordinates so as to obtain the dipmoveout-corrected zero-offset data P 0 ( y 0 , τ 0 ; h ) P 0 y 0 , τ 0 ; h P_(0)(y_(0),tau_(0);h)P_{0}\left(y_{0}, \tau_{0} ; h\right)P0(y0,τ0;h). Note, however, the transformation equations (5-4a) and (54b) require knowledge of the reflector dip ϕ dip ϕ dip phi\operatorname{dip} \phidipϕ to perform the DMO correction. To circumvent this requirement, Hale (1984) developed a method for DMO correction in the frequency-wavenumber domain. First, we use the relation from Section D. 1
sin ϕ = v k y 2 ω 0 sin ϕ = v k y 2 ω 0 sin phi=(vk_(y))/(2omega_(0))\sin \phi=\frac{v k_{y}}{2 \omega_{0}}sinϕ=vky2ω0
which states that the reflector dip ϕ ϕ phi\phiϕ can be expressed in terms of wavenumber k y k y k_(y)k_{y}ky and frequency ω 0 ω 0 omega_(0)\omega_{0}ω0, which are the Fourier duals of midpoint y 0 y 0 y_(0)y_{0}y0 and event time τ 0 τ 0 tau_(0)\tau_{0}τ0, respectively. By way of equation (5-11), the transformation equations (5-4a) and (5-4b) are recast explicitly independent of reflector dip as
and
y 0 = y n h 2 k y t n A w 0 y 0 = y n h 2 k y t n A w 0 y_(0)=y_(n)-(h^(2)k_(y))/(t_(n)Aw_(0))y_{0}=y_{n}-\frac{h^{2} k_{y}}{t_{n} A w_{0}}y0=ynh2kytnAw0
τ 0 = t n A τ 0 = t n A tau_(0)=(t_(n))/(A)\tau_{0}=\frac{t_{n}}{A}τ0=tnA
where A A AAA of equation (5-5) now is of the form
A = 1 + h 2 k z 2 t n 2 ω 0 2 A = 1 + h 2 k z 2 t n 2 ω 0 2 A=sqrt(1+(h^(2)k_(z)^(2))/(t_(n)^(2)omega_(0)^(2)))A=\sqrt{1+\frac{h^{2} k_{z}^{2}}{t_{n}^{2} \omega_{0}^{2}}}A=1+h2kz2tn2ω02
The frequency-wavenumber domain dip-moveout correction process that transforms the normal-moveoutcorrected prestack data with a specific offset 2 h 2 h 2h2 h2h from y n t n y n t n y_(n)-t_(n)y_{n}-t_{n}yntn domain to y 0 τ 0 y 0 τ 0 y_(0)-tau_(0)y_{0}-\tau_{0}y0τ0 domain is achieved by the integral
P 0 ( k y , ω 0 ; h ) = 2 A 2 1 A 3 × P n ( k y i t n ; h ) cxp ( i ω 0 t n A ) d t n . P 0 k y , ω 0 ; h = 2 A 2 1 A 3 × P n k y i t n ; h cxp i ω 0 t n A d t n . {:[P_(0)(k_(y),omega_(0);h)=int(2A^(2)-1)/(A^(3))],[ xxP_(n)(k_(y_(i))t_(n);h)cxp(-iomega_(0)t_(n)A)dt_(n).]:}\begin{aligned} P_{0}\left(k_{y}, \omega_{0} ; h\right) & =\int \frac{2 A^{2}-1}{A^{3}} \\ & \times P_{n}\left(k_{y_{i}} t_{n} ; h\right) \operatorname{cxp}\left(-i \omega_{0} t_{n} A\right) d t_{n} . \end{aligned}P0(ky,ω0;h)=2A21A3×Pn(kyitn;h)cxp(iω0tnA)dtn.
Derivation of the integral transform of equation (5-14a) is given in Section E. 2
Once dip-moveout correction is applied, the data are inverse Fourier transformed
P 0 ( y 0 , τ 0 ; h ) = P 0 ( k y , ω 0 ; h ) × exp ( ı k y η 0 + i ω 0 τ 0 ) d k y d ω 0 P 0 y 0 , τ 0 ; h = P 0 k y , ω 0 ; h × exp ı k y η 0 + i ω 0 τ 0 d k y d ω 0 {:[P_(0)(y_(0),tau_(0);h)=∬P_(0)(k_(y),omega_(0);h)],[ xx exp(-ık_(y)eta_(0)+iomega_(0)tau_(0))dk_(y)domega_(0)]:}\begin{aligned} P_{0}\left(y_{0}, \tau_{0} ; h\right) & =\iint P_{0}\left(k_{y}, \omega_{0} ; h\right) \\ & \times \exp \left(-\imath k_{y} \eta_{0}+i \omega_{0} \tau_{0}\right) d k_{y} d \omega_{0} \end{aligned}P0(y0,τ0;h)=P0(ky,ω0;h)×exp(ıkyη0+iω0τ0)dkydω0
The amplitude scaling ( 2 A 2 1 ) / A 3 2 A 2 1 / A 3 (2A^(2)-1)//A^(3)\left(2 A^{2}-1\right) / A^{3}(2A21)/A3 in equation (5-14a) is by Black et al. (1993), and is represented by A 1 A 1 A^(-1)A^{-1}A1 in the original derivation by Hale (1984). The difference is due to the fact that Hale (1984) defined the output time variable for DMO correction as t 0 t 0 t_(0)t_{0}t0 of equation (56), whereas Black et al. (1993) correetly defined the output time variable as τ 0 τ 0 tau_(0)\tau_{0}τ0 of equation (5-4b). Fortunately, the phase term exp ( i ω 0 t n A ) exp i ω 0 t n A exp(-iomega_(0)t_(n)A)\exp \left(-i \omega_{0} t_{n} A\right)exp(iω0tnA) as in cquation (5-14a) is identical in the case of both derivations. There is one other variation of the amplitude term by Liner (1989) and Bleistein (1990) given by ( 2 A 2 1 ) / A 2 A 2 1 / A (2A^(2)-1)//A\left(2 A^{2}-1\right) / A(2A21)/A. Nevertheless, within the context of a conventional processing sequence which includes geometric spreading correction prior to DMO correction, the amplitude scaling ( 2 A 2 1 ) / A 3 2 A 2 1 / A 3 (2A^(2)-1)//A^(3)\left(2 A^{2}-1\right) / A^{3}(2A21)/A3 described here preserves relative amplitudes.
We now outline the steps in dip-moveout correction in the frequency-wavenumber domain:
(a) Start with prestack data in midpoint-offset y h y h y-hy-hyh coordinates, P ( y , h , t ) P ( y , h , t ) P(y,h,t)P(y, h, t)P(y,h,t) and apply normal moveout correction using a dip-independent velocity v v vvv.
(b) Sort the data from moveout-corrected CMP gathers P n ( y n , h , t n ) P n y n , h , t n P_(n)(y_(n),h,t_(n))P_{n}\left(y_{n}, h, t_{n}\right)Pn(yn,h,tn) to common-offset sections P n ( y n , t n ; h ) P n y n , t n ; h P_(n)(y_(n),t_(n);h)P_{n}\left(y_{n}, t_{n} ; h\right)Pn(yn,tn;h).
(c) Perform Fourier transform of each common-offset section in midpoint y n y n y_(n)y_{n}yn direction, P n ( k y , t n ; h ) P n k y , t n ; h P_(n)(k_(y),t_(n);h)P_{n}\left(k_{y}, t_{n} ; h\right)Pn(ky,tn;h).
(d) For each output frequency ω 0 ω 0 omega_(0)\omega_{0}ω0, apply the phase-shift exp ( i ω 0 t n A ) exp i ω 0 t n A exp(-iomega_(0)t_(n)A)\exp \left(-i \omega_{0} t_{n} A\right)exp(iω0tnA), scale by ( 2 A 2 1 ) / A 3 2 A 2 1 / A 3 (2A^(2)-1)//A^(3)\left(2 A^{2}-1\right) / A^{3}(2A21)/A3, and sum the resulting output over input time t n t n t_(n)t_{n}tn as described by equation (5-14a).
(e) Finally, perform 2-D inverse Fourier transform to obtain the dip-moveout corrected common-offset section P 0 ( y 0 , τ 0 ; h ) P 0 y 0 , τ 0 ; h P_(0)(y_(0),tau_(0);h)P_{0}\left(y_{0}, \tau_{0} ; h\right)P0(y0,τ0;h) (equation 5-14b).
A flowchart of the dip-moveout correction described above is presented in Figure 5.1-2.
We shall now test the frequency-wavenumber DMO correction using modeled data for point scatterers and dipping events. Figure 5.1-3 depicts six point scatterers buried in a constant-velocity medium. A synthetic data set that comprises 32 common-offset sections, each with 63 midpoints, was created. The offsets range is from 0 to 1550 m 1550 m 1550m1550 \mathrm{~m}1550 m with an increment of 50 m 50 m 50m50 \mathrm{~m}50 m.
Figure 5.1-4 shows two constant-velocity stacks (CVS) of the CMP gathers from the synthetic data sct associated with the velocity-depth model depicted in Figure 5.1-3. The offset range used in stacking is 50 1550 m 50 1550 m 50-1550m50-1550 \mathrm{~m}501550 m. At the apex of the traveltime trajectory for each point scatterer, the event dip is zero. Thereforc, stack response is best with moveout velocity equal to the medium velocity ( 3000 m / s ) ( 3000 m / s ) (3000m//s)(3000 \mathrm{~m} / \mathrm{s})(3000 m/s). Along the flanks
FIG. 5.1-2. A flowchart for frequency-wavenumber dipmoveout correction algorsthm. The scalar A A AAA is given by equation (5-13) and B = ( 2 A 2 1 ) / A 3 B = 2 A 2 1 / A 3 B=(2A^(2)-1)//A^(3)B=\left(2 A^{2}-1\right) / A^{3}B=(2A21)/A3 as in equation (5-14a).
of the traveltime trajectories, optimum stack response varies as the event dip changes. The steeper the dip, the higher the moveout (or stacking) velocity.
Selected common-offset sections associated with the subsurface model in Figure 5.1-3 are shown in Figure 5.1-5a. The well-known nonhyperbolic table-top trajectories are apparent at large offsets. Selected CMP gathers from the model of Figure 5.1-3 are shown in Figure 5.1-5b. Only selected gathers that span the right side of the center midpoint are displayed, since the common-offset sections are symmetric with respect to the center midpoint (CMP 32). Note that the traveltimes at the center midpoint are perfectly hyperbolic, while the traveltimes at CMP gathers away from the center are increasingly nonhyperbolic.
The following DMO processing is applied to the data as in Figure 5.1-5a:
(1) Figure 5.1-5c shows the NMO-corrected gathers, with stretch muting applied. The medium velocity ( 3000 m / s ( 3000 m / s (3000m//s(3000 \mathrm{~m} / \mathrm{s}(3000 m/s ) was used for NMO correction (eriuation 5-2), an essential requirement for subsequent DMO correction. As a result, the events at and in the vicinity of the center midpoint (CMP 32) are flat after NMO correction, while the events at midpoints away from the center midpoint are increasingly overcorrected.
FIG. 5.1-3. Depth model of six point scatterers buried in a constant-velocity medium. The asterisks indicate the positions of the point scatterers.
(2) The stacked section derived from these gathers (Figure 5.1-5c) is shown in Figure 5.1-4b. Because medium velocity was used for NMO correction, the stack response is best for zero dip. Note the poor stack response along the steeply dipping flanks. The desired section is the zero-offset section in Figure 5.1-4a.
(3) We sort the NMO-corrected gathers (Figure 5.1-5c) into common-offset sections for DMO processing. These are shown in Figure 5.1-6a.
(4) Each common-offset section is individually corrected for dip moveout. The impulse responses of the dip-moveout operator for the corresponding offsets are shown in Figure 5.1-6b, and the resulting common-offset sections are shown in Figure 5.1-6c. Note the following effects of DMO:
(a) DMO is a partial migration process. The flanks of the nonhyperbolic trajectories have been moved updip just enough to make them look like zerooffset trajectories, which are hyperbolic. As a result, each common-offset section after NMO and DMO corrections is approximately equivalent to the zero-offset section (Figure 5.1-4a).
(b) This partial migration is subtly different from conventional migration in one respect. Unlike conventional migration, note from the impulse responses in Figure 5.1-6b that the dip-moveout correction becomes greater at increasingly shallow depths.
(c) While it does nothing to the zero-offset section, dipmoveout correction also is greater at increasingly large offsets (Figure 5.1-6c).
(d) Finally, as with conventional migration, the steeper the event, the greater partial migration takes place,
(a)
(b)
(c)
FIG. 5.1-4. Stack response of six point scatterers buried in a constant-velocity earth model ( 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s ) as depicted in Figure 5 1-3: (a) zero-offset section, (b) stack with NMO velocity of 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s, (c) stack with NMO velocity of 3600 m / s 3600 m / s 3600m//s3600 \mathrm{~m} / \mathrm{s}3600 m/s.
a
b
FJG. 5.1-5. Intermediate results from DMO processing the nonzero-ofiset synthetic data derived from the depth model in Figure 5 1-3: (a) common-offset sections with offset range from 50 to 1550 m 1550 m 1550m1550 \mathrm{~m}1550 m and an increment of 300 m 300 m 300m300 \mathrm{~m}300 m; (b) CMP gathers sorted from the common-offset sections as in (a) at midpoint locations from 32 to 63 as denoted in Figure 5. I-3 with an increment of 3; (c) the CMP gathers as in (b) after NMO correction and muting.
FIG. 5.1-6. Intermediate results from DMO processing the nonzero-ofiset synthetic date derived from the depth model in Figure 5.1-3: (a) common-offet sections with offset range from 50 to 1550 m 1550 m 1550m1550 \mathrm{~m}1550 m and an thcrement of 300 m 300 m 300m300 \mathrm{~m}300 m sorted from the NMO-corrected gathers as in Figure 5.1-4c; (b) impulse responses of the DMO operators appled to the comnon-oflset gathers; (c) cornuron-offet sections as in (a) after DMO correction; (d) CMP gathers sorted from the common-offset sections as in (c) at midpoint locations from 32 to 63 as denoted in Figure 5.1-3 with an increment of 3.
a
6
C
FIG. 5.1-7. (a) Zero-offset section associated with the depth model in Figure 5.1-3, (b) stack derived from the CMP gathers as in Figure 5.1-5c, (c) DMO stack derived from the CMP gathers as in Figure 5.1-fd.
(a)
(c)
(b)
(d)
FIG. 5.1-8. DMO processing of dipping events: (a) zero-offset section with the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s; (b) stack using optamum velocity preks from velocity spectra along the line, such as that shown in Figure 5.1-12a; (c) stack using the medium velocity of 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s; (d) DMO stack using velocity picks from velocity spectra along the line, such as that shown in Figure 5.1-12b. Location A refers to an example of events with conflicting dips.
with flat events remaining unaltered (Figure 5.1 6 c ) 6 c ) 6c)6 c)6c).
(5) Following the DMO correction, the dath are sorted back to CMP gathers (Figure 5.1-6d). Compare the gathers in Figure 5.1-6d to the CMP gathers without DMO correction (Figure 5.1-5b). The DMO correction has left the zero-dip events unchanged (at and in the vicinity of CMP 32), while it substantially corrected steeply dipping events on the CMP gathers away from the center midpoint (CMP 32). The events on the CMP gathers now are flattened (Figure 5.1-6d). Also, since DMO correction is a migration-like process, it causes the energy to move from one CMP gather to neighboring gathers in the updip direction. Energy depletion at the CMP gathers in Figure 5.1-6d farther from the center midpoint occurred because there was no other CMP gather to contribute energy beyond CMP 63 .
(6) Stacking the NMO- and DMO-corrected gathers (Figure 5.1-6d) yields a section (Figure 5.1-7c) that more closely represents the zero-offset section
(Figure 5.1-7a) than the stacked section without the DMO correction (Figure 5.1-7b). Note the enhanced stack response along the steeply dipping flanks in Figure 5.1-7c. (The sections all have the same display gain.)
We now examine results of DMO processing of a modeled data set for dipping events. Figure 5. I-8a shows a zero-offset section that consists of events with dips from 0 to 45 degrees with a 5 -degree increment. Medium velocity is constant ( 3500 m / s ) ( 3500 m / s ) (3500m//s)(3500 \mathrm{~m} / \mathrm{s})(3500 m/s). Several velocity analyses were performed along the line; an example is shown in Figure 5.1-9a. Note the dip-dependent semblance peaks. Selected CMP gathers are shown in Figure 5.1-10a. By using the optimum stacking velocities picked from the densely spaced velocity analyses, we apply NMO correction to the CMP gathers (Figure 5.110b), then stack them (Figure 5.1-8b). Aside from the conflicting dips at location A A AAA, stack response is close to the zero-offset section (Figure 5.1-8a). The DMO processing requires NMO correction using medium velocity (Figure 5.1-10c). Stack response using the medium ve-
(a) (b)
FIG. 5.1-9. Velocity analysis (a) without and (b) with DMO correction at analysis. The stacked sections without and with DMO correction are shown in Figures 5.1-8b and d d d\mathrm{d}d.
locity (Figure 5.1-8c) clearly degrades at steep dips. By applying DMO correction (Figure 5.1-10d) to the NMOcorrected gathers (Figure 5.1-10b), we get the improved stacked section in Figure 5.1-8d. The DMO stack is closest to the zero-offset section (Figure 5.1-8a).
DMO correction also yields dip-corrected velocity functions that can be used in subsequent migration. Refer to the velocity analysis in Figure 5.1-9b and note that all events have semblance peaks at 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s, which is the medium velocity for this model data set.

Log-Stretch DMO Correction

The frequency-wavenumber DMO correction (Hale, 1984; Black et al. 1993) described in this section is computationally intensive. Specifically, for each output frequency ω 0 ω 0 omega_(0)\omega_{0}ω0, one has to apply the phase-shift exp ( i n t n A ) exp i n t n A exp(-i_(n)t_(n)A)\exp \left(-i_{n} t_{n} A\right)exp(intnA), scale by ( 2 A 2 1 ) / A 3 2 A 2 1 / A 3 (2A^(2)-1)//A^(3)\left(2 A^{2}-1\right) / A^{3}(2A21)/A3, and sum the resulting output over input time t n t n t_(n)t_{n}tn as described by equation (5-14a). A computationally more efficient DMO correction can be formulated in the logarithmic time domain (Bolondi et al., 1982; Bale and Jacubowicz, 1987; Notfors and Godfrey, 1987; Liner, 1990; Zhou et al., 1996). The log-stretch time variable enables linearization of the coordinate transform equation ( 5 12 b ) 5 12 b ) 5-12 b)5-12 b)512b), and
as a result, the DMO correction is achieved by a sinple multiplication of the input data with a phase-shift operator in the Fourier transform domain.
Define the following logarithmic variables that correspond to the time variables τ 0 τ 0 tau_(0)\tau_{0}τ0 and t n t n t_(n)t_{n}tn of equation (5 12 b ) : 12 b ) : 12 b):12 b):12b):
T 0 = ln T 0 T 0 = ln T 0 T_(0)=ln T_(0)T_{0}=\ln T_{0}T0=lnT0
and
T n = ln t n , T n = ln t n , T_(n)=ln t_(n),T_{n}=\ln t_{n},Tn=lntn,
where, for convenience, a constant scalar with its unit in time is omitted. Hence, the inverse relationships are given by
τ 0 = e T 0 τ 0 = e T 0 tau_(0)=e^(T_(0))\tau_{0}=e^{T_{0}}τ0=eT0
and
t n = e T n t n = e T n t_(n)=e^(T_(n))t_{n}=e^{T_{n}}tn=eTn
Our goal is to derive equations for DMO correction in the log-stretch coordinates ( y 0 , T 0 ) y 0 , T 0 (y_(0),T_(0))\left(y_{0}, T_{0}\right)(y0,T0). The transform relation between the input log-stretch time variable T n T n T_(n)T_{n}Tn and the output log log log\loglog-stretch time variable T 0 T 0 T_(0)T_{0}T0 is given by
T 0 = T n ln A e , T 0 = T n ln A e , T_(0)=T_(n)-ln A_(e),T_{0}=T_{n}-\ln A_{e},T0=TnlnAe,
and the expression for the midpoint variable y 0 y 0 y_(0)y_{0}y0 in the log-stretch domain is given by
y 0 = y n h 2 k y A e Ω 0 y 0 = y n h 2 k y A e Ω 0 y_(0)=y_(n)-(h^(2)k_(y))/(A_(e)Omega_(0))y_{0}=y_{n}-\frac{h^{2} k_{y}}{A_{e} \Omega_{0}}y0=ynh2kyAeΩ0
where
A e = 1 + h 2 k y 2 Ω 0 2 A e = 1 + h 2 k y 2 Ω 0 2 A_(e)=sqrt(1+(h^(2)k_(y)^(2))/(Omega_(0)^(2)))A_{e}=\sqrt{1+\frac{h^{2} k_{y}^{2}}{\Omega_{0}^{2}}}Ae=1+h2ky2Ω02
The variable Ω 0 Ω 0 Omega_(0)\Omega_{0}Ω0 is the Fourier transform dual of the variable T 0 T 0 T_(0)T_{0}T0 in the log log log\loglog-stretch domain. Equations (5 17 a , b ) 17 a , b ) 17 a,b)17 a, b)17a,b) and (5-18) correspond to equations (5-12a,b) and (5-13) in the log-stretch domain. Mathematical details of the derivation of equations ( 5 17 a , b ) ( 5 17 a , b ) (5-17 a,b)(5-17 a, b)(517a,b) are left to Section E.3.
The log-stretch dip-moveout correction process is achieved by the following relationship (Section E.3):
P 0 ( k y , Ω 0 ; h ) = exp ( i h 2 k y 2 A e Ω 0 + i Ω 0 ln A e ) P n ( k y , Ω 0 ; h ) P 0 k y , Ω 0 ; h = exp i h 2 k y 2 A e Ω 0 + i Ω 0 ln A e P n k y , Ω 0 ; h P_(0)(k_(y),Omega_(0);h)=exp(-i(h^(2)k_(y)^(2))/(A_(e)Omega_(0))+iOmega_(0)ln A_(e))P_(n)(k_(y),Omega_(0);h)P_{0}\left(k_{y}, \Omega_{0} ; h\right)=\exp \left(-i \frac{h^{2} k_{y}^{2}}{A_{e} \Omega_{0}}+i \Omega_{0} \ln A_{e}\right) P_{n}\left(k_{y}, \Omega_{0} ; h\right)P0(ky,Ω0;h)=exp(ih2ky2AeΩ0+iΩ0lnAe)Pn(ky,Ω0;h)
Note that the relationship of input P n ( k y , Ω 0 ; h ) P n k y , Ω 0 ; h P_(n)(k_(y),Omega_(0);h)P_{n}\left(k_{y}, \Omega_{0} ; h\right)Pn(ky,Ω0;h) to output P 0 ( k y , Ω 0 ; h ) P 0 k y , Ω 0 ; h P_(0)(k_(y),Omega_(0;)h)P_{0}\left(k_{y}, \Omega_{0 ;} h\right)P0(ky,Ω0;h) given by equation (5-19) computationally is much simpler than that of equation (5-14a). The log-stretch domain implementation of DMO correction involves application of a phase-shift given by the exponential in equation (5-19) to the input data; whereas, the frequency-wavenumber implementation involves an integral transform given by equation (5-14a).
(b) NMO Correction using medlum

ty = 3500 m / s e c = 3500 m / s e c =3500m//sec=3500 \mathrm{~m} / \mathrm{sec}=3500 m/sec

(c) NMO Correction using picked optlmum stacking velocities
(d) DMO Corrections on (b)
FIG. 5.1-10. (a) Selected CMP gathers from the dipping-events model shown in Figure 5.1-8; (b) NMO-corrected gathers using medium velocity ( 3500 m / s 3500 m / s 3500m//s3500 \mathrm{~m} / \mathrm{s}3500 m/s ); (c) NMO-corrected gathers using optimum stacking velocities picked from velocity spectra along the line, such as that shown in Figure 5. I-9a; (d) DMO-corrected gathers.
To circumvent the logarithmic computation, a variation of the phase-shift term in equation (5-19) is given by Notfors and Godfrey (1987). As in most log log log\loglog-stretch formulations of DMO correction, this reference assumes that under DMO correction the midpoint variable is invariant; hence, by way of equation ( 5 17 b 5 17 b 5-17b5-17 \mathrm{~b}517 b ), the first term in the exponential of equation (5-19) drops out. A further approximation, ln A e = A e 1 ln A e = A e 1 ln A_(e)=A_(e)-1\ln A_{e}=A_{e}-1lnAe=Ae1, and use of the definition for A e A e A_(e)A_{e}Ae given by equation (5-18) then lead to the following expression for DMO correction:
P 0 ( k y , Ω 0 ; h ) = exp [ ı Ω 0 ( 1 + h 2 k y 2 Ω 0 2 1 ) ] P n ( k y , Ω 0 ; h ) P 0 k y , Ω 0 ; h = exp ı Ω 0 1 + h 2 k y 2 Ω 0 2 1 P n k y , Ω 0 ; h P_(0)(k_(y),Omega_(0);h)=exp[ıOmega_(0)(sqrt(1+(h^(2)k_(y)^(2))/(Omega_(0)^(2)))-1)]P_(n)(k_(y),Omega_(0);h)P_{0}\left(k_{y}, \Omega_{0} ; h\right)=\exp \left[\imath \Omega_{0}\left(\sqrt{1+\frac{h^{2} k_{y}^{2}}{\Omega_{0}^{2}}}-1\right)\right] P_{n}\left(k_{y}, \Omega_{0} ; h\right)P0(ky,Ω0;h)=exp[ıΩ0(1+h2ky2Ω021)]Pn(ky,Ω0;h)
We now outline the steps in dip-moveout correction in the log-stretch domain:
(a) Start with prestack data in midpoint-offset y h y h y-hy-hyh coordinates, P ( y , h , t ) P ( y , h , t ) P(y,h,t)P(y, h, t)P(y,h,t) and apply normal moveout correction using a dip-independent velocity v v vvv.
(b) Sort the data from moveout-corrected CMP gathers P n ( y n , h , t n ) P n y n , h , t n P_(n)(y_(n),h,t_(n))P_{n}\left(y_{n}, h, t_{n}\right)Pn(yn,h,tn) to common-offset sections P n ( y n , t n ; h ) P n y n , t n ; h P_(n)(y_(n),t_(n);h)P_{n}\left(y_{n}, t_{n} ; h\right)Pn(yn,tn;h).
(c) Apply the logarithmic stretch in the time direction based on equation (5-15b) so as to map each common-offset section P n ( y n , t n ; h ) P n y n , t n ; h P_(n)(y_(n),t_(n);h)P_{n}\left(y_{n}, t_{n} ; h\right)Pn(yn,tn;h) in y n t n y n t n y_(n)-t_(n)y_{n}-t_{n}yntn coordinates to P n ( y n , T n ; h ) P n y n , T n ; h P_(n)(y_(n),T_(n);h)P_{n}\left(y_{n}, T_{n} ; h\right)Pn(yn,Tn;h) in y n T n y n T n y_(n)-T_(n)y_{n}-T_{n}ynTn cordinates.
(d) Perform 2-D Fourier transform of each commonoffset section in the log-stretch domain.
(e) Apply the phase-shift given by the exponential in equation (5-20) to each common-offset section P n ( k y , Ω 0 ; h ) P n k y , Ω 0 ; h P_(n)(k_(y),Omega_(0);h)P_{n}\left(k_{y}, \Omega_{0} ; h\right)Pn(ky,Ω0;h), and obtain the dip-moveoutcorrected data P 0 ( k y , Ω 0 ; h ) P 0 k y , Ω 0 ; h P_(0)(k_(y),Omega_(0);h)P_{0}\left(k_{y}, \Omega_{0} ; h\right)P0(ky,Ω0;h) in the log log log\loglog-stretch Fourier transform domain.
(f) Perform 2-D inverse Fourier transform to obtain the dip-moveout corrected common-offset section P 0 ( y 0 , T 0 ; h ) P 0 y 0 , T 0 ; h P_(0)(y_(0),T_(0);h)P_{0}\left(y_{0}, T_{0} ; h\right)P0(y0,T0;h) in the log 0 log 0 log_(0)\log _{0}log0 stretch domain.
(g) Undo the logarithmic stretch as in step (c) in the time direction based on equation ( 5 16 a 5 16 a 5-16 a5-16 a516a ) so as to obtain the dip-moveout-corrected data P ( y 0 , τ 0 ; h ) P y 0 , τ 0 ; h P(y_(0),tau_(0);h)P\left(y_{0}, \tau_{0} ; h\right)P(y0,τ0;h).
Figure 5.1-11 shows the impulse responses of a log log log\loglog stretch DMO operator based on equation (5-20) for 1000 m , 2000 m 1000 m , 2000 m 1000m,2000-m1000 \mathrm{~m}, 2000-\mathrm{m}1000 m,2000m and 3000 m 3000 m 3000-m3000-\mathrm{m}3000m offsets. The impulse responses greatly resemble those of the frequency-wavenumber DMO correction described earlier (Figure 5.16b). Field data examples of DMO correction presented in this chapter mostly have been created using a logstretch algorithm.

Integral DMO Correction

In Section 4.1, we reviewed the migration process based on Kirchboff summation. Dip-moveout correction also can be formulated as an integration process (Deregowski and Rocca, 1981; Deregowski, 1987; Black et al., 1993). The integral DMO correction is particularly the preferred method for data with irregular spatial sampling and 3-D data with large variations in source-receiver azimuths (Section 7.2).
The traveltime trajectory associated with the dipmoveout correction operator is given by the following equation (Section E.3):
y 0 2 h 2 + τ 0 2 t n 2 = 1 y 0 2 h 2 + τ 0 2 t n 2 = 1 (y_(0)^(2))/(h^(2))+(tau_(0)^(2))/(t_(n)^(2))=1\frac{y_{0}^{2}}{h^{2}}+\frac{\tau_{0}^{2}}{t_{n}^{2}}=1y02h2+τ02tn2=1
Equation (5-21) describes an ellipse with the following properties (Figure 5.1-12):
(a) Semi-major axis in midpoint y 0 y 0 y_(0)y_{0}y0 direction: a = h a = h a=ha=ha=h.
(b) Semi-minor axis in time τ 0 τ 0 tau_(0)\tau_{0}τ0 direction: b = t n b = t n b=t_(n)b=t_{n}b=tn
The ellipse of equation (5-21) in the y 0 τ 0 y 0 τ 0 y_(0)-tau_(0)y_{0}-\tau_{0}y0τ0 plane describes the impulse response of a dip-moveout operator applied to nonzero-offset data with offset 2 h 2 h 2h2 h2h. In Figure 5.1-12, the coordinate of midpoint M M MMM is y n y n y_(n)y_{n}yn and y 0 y 0 y_(0)y_{0}y0 coordinate is referenced to y n y n y_(n)y_{n}yn. Note also that the maximum lateral extent of the ellipse the aperture of the DMO operator, is equal to offset 2 h 2 h 2h2 h2h. Figures 5.1-6b and 5.111 show the DMO ellipses associated with the impulse responses of the frequency-wavenumber and log log log\loglog-stretch DMO operators.
Analogous to the semicircle superposition technique for migration (Section 4.1), DMO correction can be viewed as mapping of an amplitude A 0 A 0 A_(0)A_{0}A0 at time t n t n t_(n)t_{n}tn on a normal-moveout-corrected trace at midpoint y n y n y_(n)y_{n}yn to an amplitude A 1 A 1 A_(1)A_{1}A1 at time τ 0 τ 0 tau_(0)\tau_{0}τ0 on a trace at midpoint y 0 y 0 y_(0)y_{0}y0. The vertical excursion Δ t D M O Δ t D M O Deltat_(DMO)\Delta t_{D M O}ΔtDMO and the horizontal excursion Δ y D M O Δ y D M O Deltay_(DMO)\Delta y_{D M O}ΔyDMO denoted in Figure 5.1-12 are given by equations ( 5 9 a , b ) ( 5 9 a , b ) (5-9a,b)(5-9 a, b)(59a,b). If trace spacing in the midpoint direction is Δ y 1 Δ y 1 Deltay_(1)\Delta y_{1}Δy1 then the lateral excursion is Δ y D M O / Δ y Δ y D M O / Δ y Deltay_(DMO)//Delta y\Delta y_{D M O} / \Delta yΔyDMO/Δy traces, the maximum excursion being h / Δ y h / Δ y h//Delta yh / \Delta yh/Δy traces.
While the kinematics of the DMO correction operator is given by equation (5-21), the question remains as to the amplitude and the phase of the operator. Although the method was first described by Deregowski and Rocca (1981), a formal derivation of integral DMO correction with amplitude preserving characteristics is given by Black et al. (1903). Mathematical treatise of the problem is quite involved, and we shall only refer to the results of the analysis.
Rewrite equation (5-21) explicitly in terms of the normal-moveout-corrected time variable t n t n t_(n)t_{n}tn as
t n = α τ 0 t n = α τ 0 t_(n)=alphatau_(0)t_{n}=\alpha \tau_{0}tn=ατ0
where
FIG. 5.1-12. The DMO ellipse. See text for details.
α = 1 1 y 0 2 h 2 α = 1 1 y 0 2 h 2 alpha=(1)/(sqrt(1-(y_(0)^(2))/(h^(2))))\alpha=\frac{1}{\sqrt{1-\frac{y_{0}^{2}}{h^{2}}}}α=11y02h2
and y 0 h y 0 h y_(0) <= hy_{0} \leq hy0h. Given the output sample time τ 0 τ 0 tau_(0)\tau_{0}τ0 on the DMO ellipse, equation (5-22) gives the input sample time t n t n t_(n)t_{n}tn (Figure 5.1-12). The output sample value P out ( y 0 , τ 0 ; h ) P out  y 0 , τ 0 ; h P_("out ")(y_(0),tau_(0);h)P_{\text {out }}\left(y_{0}, \tau_{0} ; h\right)Pout (y0,τ0;h) is computed by summing over the input sample values P n n ( y n , t n ; h ) P n n y n , t n ; h P_(nn)(y_(n),t_(n);h)P_{n n}\left(y_{n}, t_{n} ; h\right)Pnn(yn,tn;h) over the DMO operator aperture
P out = Δ y 2 π y [ 2 α 2 1 h 7 0 ρ ( t n ) P t n ] P out  = Δ y 2 π y 2 α 2 1 h 7 0 ρ t n P t n P_("out ")=(Delta y)/(2pi)sum_(y)[(2alpha^(2)-1)/(h)sqrt(7_(0))rho(t_(n))**P_(tn)]P_{\text {out }}=\frac{\Delta y}{2 \pi} \sum_{y}\left[\frac{2 \alpha^{2}-1}{h} \sqrt{7_{0}} \rho\left(t_{n}\right) * P_{t n}\right]Pout =Δy2πy[2α21h70ρ(tn)Ptn]
where Δ y Δ y Delta y\Delta yΔy is the trace spacing in midpoint direction.
Equation (5-23) is adapted from Black et al. (1993) and is similar to equation (4-5) which describes the Kirchhoff summation. For the 2-D application of DMO correction, the ρ ( t n ) ρ t n rho(t_(n))\rho\left(t_{n}\right)ρ(tn) filter has an amplitude spectrum of the form ω n ω n sqrt(omega_(n))\sqrt{\omega_{n}}ωn, with ω n ω n omega_(n)\omega_{n}ωn being the temporal frequency associated with the input time variable t n t n t_(n)t_{n}tn, and a phase spectrum equal to π / 4 π / 4 pi//4\pi / 4π/4.
In the integral implementation of DMO correction by Deregowski and Rocca (1981), and Deregowski (1987), the term α α alpha\alphaα is set to unity in equation (5-24). Moreover, in the Liner (1990) and Bleistein (1990) implementation of integral DMO correction, the term 2 α 2 1 2 α 2 1 2alpha^(2)-12 \alpha^{2}-12α21 in equation (5-24) is replaced with α 2 ( 2 α 2 1 ) α 2 2 α 2 1 alpha^(2)(2alpha^(2)-1)\alpha^{2}\left(2 \alpha^{2}-1\right)α2(2α21). Nevertheless, within the context of a conventional processing sequence which includes geometric spreading
correction prior to DMO correction, the amplitude scaling ( 2 a 2 1 ) / h 2 a 2 1 / h (2a^(2)-1)//h\left(2 a^{2}-1\right) / h(2a21)/h described here preserves relative amplitudes. Other DMO amplitude scaling strategies inchde those suggested by Sorin and Ronen (1989), and Gardner and Forel (1990).
In practical implementations of the integral DMO correction, a user-defined aperture commonly is imposed on the operator to avoid aliasing along the steep flanks of the DMO ellipse, especially a.t late times. When the DMO ellipse is truncated before it reaches its fullest lateral extent, anplitude distribution along the elliptic trajectory is adjusted accordingly, such that the amplitude is tapered to zero at the truncation point on the ellipse. Figure 5.1-13 shows the impulse responses of an integral DMO operator based on equation (5-24) for 1000 m , 2000 m 1000 m , 2000 m 1000-m,2000-m1000-\mathrm{m}, 2000-\mathrm{m}1000m,2000m, and 3000 m 3000 m 3000-m3000-\mathrm{m}3000m offsets. Compare with the impulse responses in Figure 5.1-11 and note the truncation at steep flanks of the DMO ellipses. The problem of spatial aliasing due to undersampling and the adverse effect of irregular sampling on DMO correction are particularly relevant for 3 D 3 D 3-D3-D3D data; as such, these issues will be dealt with in Section 7.2.

Velocity Errors

What happens if the NMO correction that precedes the DMO correction were applied with the wrong velocity?

(C) Common Offset Sections N M O 1 + N M O 1 + NMO_(1)+\mathrm{NMO}_{1}+NMO1+ DMO
(d) CMP Gathers N M O 1 + N M O 1 + NMO_(1)+\mathrm{NMO}_{1}+NMO1+ DMO
(e) CMP Galhers N M O 1 + D M O 2 N M O 1 1 N M O 1 + D M O 2 N M O 1 1 NMO_(1)+DMO^(2)NMO_(1)^(-1)\mathrm{NMO}_{1}+\mathrm{DMO}^{2} \mathrm{NMO}_{1}^{-1}NMO1+DMO2NMO11
FIG. 5.1-14. Intermediate results from DMO processing the nonzero-offset synthetic data derived from the depth model in Figure 5.1-3. See text for details.
(a)
(b)
(c)
FIG. 5.1-15. (a) Zero-offet section associated with the depth model in Figure 5.1-3; (b) stack derived from the CMP gathers in Figure 5.1-14E; (c) DMO stack derived from the CMP gathers in Figure 5.1-14d.
The DMO process requires an input that is NMO corrected using the medium velocity (equation 5-2). Thus, we try to pick a vertically varying velocity function from the flattest part of the section for NMO correcting the data. The optimum stacking velocities are not used because they depend on dip. However, it is the stacking velocities that are picked from conventional velocity analyses. There is always the possibility that an accurate dip-independent velocity function will not be determined for NMO correcting the input data before DMO correction. The constart-velocity model in Figure 5.1-3 is used to examine this problem.
Assume that the velocity used for NMO correction is 20 percent higher than the velocity that should be used the 3000 m / s 3000 m / s 3000-m//s3000-\mathrm{m} / \mathrm{s}3000m/s medium velocity. Start with the CMP gathers in Figure 5.1-5b and apply the NMO correction using the incorrect velocity ( 3600 m / s ) ( 3600 m / s ) (3600m//s)(3600 \mathrm{~m} / \mathrm{s})(3600 m/s). The results are shown in Figure 5.1-14a. Note the undercorrection at some gathers due to the high velocity used. Follow the DMO processing sequence described earlier. Note that events no longer are aligned after the first NMO and DMO corrections (Figure 5.1-14d). Therefore, the stack obtained from these gathers is not expected to be any better than the conventional stack derived from the gathers in Figure 5.1-14a. The stacked sections are shown in Figure 5.1-15.
Perhaps the CMP stack can be improved by repicking the velocities after DMO correction. To test this idea, consider the following procedure. First, apply inverse NMO correction (Figure 5.1-14e) to the gathers with the velocity function that was used in the first NMO correction step (Figure 5.1-14a). Then, assuming we pick the correct velocity function, use it on the second NMO correction (Figure 5.1-14f). Significant improvement is seen when these gathers are stacked (Figure 5.1-16c). For a fair comparison, refer to the conventional stack with the 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s repicked velocity in Figure 5.1-16b. Although not shown, similar conclusions are reached from tests using velocities that are too low for NMO correction before DMO processing.

Variable Velocity

The preceding discussion was based on a constantvelocity assumption. To be of practical use, DMO must be applicable to data with velocity gradients. Figure 5.1-17 shows the depth model we will use to investigate DMO correction in the case of vertical velocity variation. The depth model consists of three point scatterers buried beneath the center midpoint (CMP 32) in a medium with a horizontally layered velocity-depth model. Mathematical aspects of the variable-velocity DMO theory is quite involved and we shall only refer to the results of the experiments with the synthetic data associated with the depth model in Figure 5.1-17.
Selected common-offet sections and CMP gathers associated with this subsurface model are shown in Figures 5.1-18 and 5.1-18b. The same processing sequence is followed as that used for the constant-velocity model (Figure 5.1-3). The NMO correction (Figure 5.1-18c) before DMO correction is done using the rms velocity function indicated in Figure 5.1-17. Selected moveoutcorrected common-offset sections are shown in Figure 5.1-19a. We shall apply both constant-velocity DMO correction and variable-velocity DMO correction (Hale
(a)
(b)
(c)
FIG. 5.1-16. (a) Zero-offset section associated with the depth model in Figure 5.1-3; (b) stack derived from the CMP gathers in Figure 5.1-5c; (c) DMO stack derived from the CMP gathers in Figure 5.1-14f.
and Artley, 1992; Artley and Hale, 1994) to these data. The corresponding impulse responses are shown in Figures 5.1-19b,c. Consider the common case of velocities increasing with depth in practice. As noted earlier, the higher the velocity the less the action of the DMO operator. Note that at late times the lateral extent of the impulse response of the variable-velocity DMO operator is less than that of the constant-velocity DMO operator. This is equivalent to modifying the offset value for the common-offet section under consideration - making it smaller than it is so as to decrease the action of the DMO operator.
Results of constant-velocity and variable-velocity DMO corrections are shown in Figures 5.1-20 and 5.121, respectively. Events on the selected C M P C M P CMP\mathrm{CMP}CMP gathers are better flattened with the variable-velocity DMO correction. The corresponding stacked sections accompanied with the zero-offset conventional stacked sections without DMO correction are shown in Figure 5.1-22. The improvement with the depth-variable velocity also is evident on the stacked section (Figure 5.1-22d). Specifically, note that the flanks of the diffaction events are enhanced with the depth-variable velocity, making it resemble much more closely the zero-offset section (Figure 5.1-22a) as compared to the constant-velocity DMO stack (Figure 5.1-22c).
In practice, constant-velocity DMO correction aften yields acceptable results so long as the vertical velocity gradient is reasonably small and does not change rapidly in depth. The constant-velocity DMO correction also has the bonus effect of attenuating coherent linear noise as demonstrated in the next section.

Thrning-Wave Migration

In an extensional basin, such as the Gulf of Mexico, salt tectonism in its advanced stage can cause the formation of salt diapirs with overhang structures. Consider such a salt structure as sketched in Figure 5.1-23. If velocities in the surrounding sedimentary sequence increase rapidly in depth, downward traveling waves change their direction at some depth and travel upward. When these turning waves, in their upward travel path, encounter a salt overhang, they reflect from the underside of the structure and follow a downgoing path before turning back upward to the surface. The turningwave reflection then gives rise to a dipping event on the stacked section which conflict with the reflections associated with the surrounding gently dipping strata. The concept of imaging turning waves was introduced by Claerbout (1985) and first demonstrated on field data
CMP
pepth,
CMP pepth,| CMP | | :---: | | pepth, |
Interval Velocity,
m / s m / s m//s\mathrm{m} / \mathrm{s}m/s
Interval Velocity, m//s| Interval Velocity, | | :---: | | $\mathrm{m} / \mathrm{s}$ |
RMS Velocity,
n/s
RMS Velocity, n/s| RMS Velocity, | | :---: | | n/s |
Twomay Time,
ms
Twomay Time, ms| Twomay Time, | | :---: | | ms |
400 2000 400 2000 400-(2000)/()400-\frac{2000}{}4002000 2000 400
650 2500 650 2500 650-2500650-25006502500 2190 600
950 3000 2410 800
"CMP pepth," "Interval Velocity, m//s" "RMS Velocity, n/s" "Twomay Time, ms" 400-(2000)/() 2000 400 650-2500 2190 600 950 3000 2410 800| CMP <br> pepth, | Interval Velocity, <br> $\mathrm{m} / \mathrm{s}$ | RMS Velocity, <br> n/s | Twomay Time, <br> ms | | :---: | :---: | :---: | :---: | | $400-\frac{2000}{}$ | 2000 | 400 | | | $650-2500$ | 2190 | 600 | | | 950 | 3000 | 2410 | 800 |
FIG. 5.1-17. Depth model of three point scatterers buried in a vertically varying velocity medium. The asterisks indicate the positions of the point scatterers.
FIG. 5.1-18. Intermediate results from DMO processing the nonzero-offset synthetic data derived from the depth model in Figure 5 1-17: (a) common-offset sections with offset range from 50 to 1550 m 1550 m 1550m1550 \mathrm{~m}1550 m and an increment of 300 m 300 m 300m300 \mathrm{~m}300 m; (b) CMP gathers sorted from the common-offet sections as in (a) at midpoint locations from 32 to 63 as denoted in Figure 5.1-17 with an increment of 3; (c) the CMP gathers as in (b) after NMO correction and muting.
by Hale et al. (1992). Many examples of turning-wave imaging of salt overhang structures from the Gulf of Mexico are given by Ratcliff et al. (1992).
Dip-moveout correction alone, even if it accounts for vertical velocity variations, does not preserve the turning-wave energy on stacked data. This is because the normal moveout associated with the turning raypaths exhibit an abnormal behavior as sketched in Figure 5.1-23. Consider a reflection point E E E\mathrm{E}E that represents all dips on the salt flank. Sketched in Figure 5.1-23 are the zero-offset raypaths for the reflector dip of less than 90 degrees (raypath that emerges at location C), exactly 90 degrees (raypath that emerges at location B B BBB ), and greater than 90 degrees (raypath that emerges at location A).
Note that when the CMP raypaths do not have an upward component (location C), the moveout trajectory in the CMP gather exhibits the usual behavior described by the hyperbolic traveltime equation:
t 2 = t 0 2 + 4 h 2 v N M O 2 t 2 = t 0 2 + 4 h 2 v N M O 2 t^(2)=t_(0)^(2)+(4h^(2))/(v_(NMO)^(2))t^{2}=t_{0}^{2}+\frac{4 h^{2}}{v_{N M O}^{2}}t2=t02+4h2vNMO2
where t t ttt is the two-way traveltime associated with a source-receiver separation 2 h , t 0 2 h , t 0 2h,t_(0)2 h, t_{0}2h,t0 is the two-way zerooffset time, and v N M O v N M O v_(NMO)v_{N M O}vNMO is the velocity that best flattens the event after normal-moveout correction.
When, however, the CMP raypaths have an upward component associated with turning waves (location A), the moveout trajectory in the CMP gather exhibits an abnormal behavior which may be described by the traveltime equation (Hale et al., 1992)
t 2 = t 0 2 4 h 2 v N M O 2 t 2 = t 0 2 4 h 2 v N M O 2 t^(2)=t_(0)^(2)-(4h^(2))/(v_(NMO)^(2))t^{2}=t_{0}^{2}-\frac{4 h^{2}}{v_{N M O}^{2}}t2=t024h2vNMO2
Note that the abnormal moveout equation (5-25b) differs from the normal moveout equation (5-25a) by a change in the sign of the moveout term 4 h 2 / v N M O 2 4 h 2 / v N M O 2 4h^(2)//v_(NMO)^(2)4 h^{2} / v_{\mathrm{NMO}}^{2}4h2/vNMO2 -
FIG. 5.1-19. Intermediate results from DMO processing the nonzero-offset synthetic data derived from the depth model in Figure 5.1-17: (a) common-ofset sections with ofset range from 50 to 1550 m 1550 m 1550m1550 \mathrm{~m}1550 m and an increment of 300 m 300 m 300m300 \mathrm{~m}300 m sorted from the NMO-orrected gathers as in Figure 5,1-4c; (b) impulse responses of the constant-velocity DMO operators applied to the common-oftset gathers; (c) impulse responses of the variable-velocity DMO operators applied to the common-ofiset gathers.
FIG. 5.1-20. Intermediate resuits from DMO processing the nonzero-ofset synthetic data derived from the depth model in Figure 5.1-17: (a) common-offset sections as in Figure 5.1-19a after the constant-velocity DMO corection; (b) CMP gathers sorted from the common-ofset sections as in (a) at midpoint locations from 32 to 63 as denoted in Figure 5.1-17 with an increment of 3.
FIG. 5.1-21. Intermediate results from DMO processing the nonzero-nfset synthetic data derived from the depth model in Figure 5.1-17: (a) common-offset sections as in Figure 5.1-19a after the variable-velocity DMO corection; (b) CMP gathers sorted from the common-offset sections as in (a) at midpoint locations from 32 to 63 as denoted in Figure 5.1-17 with an increment of 3.
a
b
C C C\mathbf{C}C
d
FIG. 5.1-22. (a) Zero-ffset section associated with the depth model in Figure 5.1-17; (b) stack derived from the CMP gathers as in Figure 5.1-18c; (c) DMO stack derived from the CMP gathers as in Figure 5.1-20b; (d) DMO stack derived from the CMP gathers as in Figure 5.1-21b.
There can also exist a circumstance where the reflection off the salt flank does not exhibit any moveout (location B B BBB in Figure 5.1-23).
To make use of the turning-wave energy in imaging salt overhang structures, we must.
(a) preserve the reflections with abnormal moveout as- sociated with the turning waves during stacking, and
(b) migrate the stacked data using an algorithm that can handle dips beyond 90 degrees.
To derive a stacked section that preserves reflections associated with both normal (nonturning) and
FIG. 5.1-23. Geometry of turning rays in a medium with velocities increasing in depth, and the CMP traveltime trajectories depicted above at three locations, A , B A , B A,BA, BA,B, and C C CCC. At location A A AAA, the turning raypaths such as A D E A D E ADEA D EADE causes an abnormal moveout. At location C C CCC, the raypaths yield a normal moveout, and at location B B BBB no moveout is observed on the CMP gather. (Adapted from Hale et al, 1992).
turning waves, consider the stacking process in two parts. First, use equation (5-25a) with positive v N M O 2 v N M O 2 v_(NMO)^(2)v_{N M O}^{2}vNMO2 to handle events with normal moveout and derive a stack associated with the normal waves. Second, use equation (5-25a) with negative v N M O 2 v N M O 2 v_(NMO)^(2)v_{N M O}^{2}vNMO2 to handle events with ab. normal moveout and derive a stack associated with the turning waves. Finally, add the two sections to obtain the composite-wave stack.
Reflections off the flank of a salt dome, whether they are associated with normal waves or turning waves, and reflections associated with the surrounding sedimentary sequence constitute dipping events with different moveout velocities on a stacked section. As such, DMO correction needs to be applied to data prior to stacking both the normal and turning waves. The DMO operator preferably should account for the strong vertical velocity variations that give rise to turning waves (Hale and Artley, 1992; Artley and Hale, 1994).
Figure 5.1-24 (left column) shows a normal-wave stack, a turning-wave stack, and the composite-wave stack. Note that the normal-wave stack actually contains a significant portion of the turning wave energy represented by the steeply dipping event in the turningwave stack. This is because the turning-wave energy is predominantly of low frequency. Therefore, despite its a.bnormal moveout behavior, nuch of the turning-wave energy is preserved during conventional stacking based on normal moveout.
Note from Figure 5.1-23 that turning waves propagate at angles greater than 90 degrees. This means that turning waves are evanescent waves and need to be imaged using a migration algorithm that can handle dips beyond 90 degrees. Reversetime migration (Brysal et al., 1984) described in Section 4.1 is based on such an algorithm. The field data example shown in Figure 4,322 suggests that the salt dome at its root at about 3 s 3 s 3s3 \mathrm{~s}3 s has a gentle overhang. This character is not identifiable in the image obtained by an algorithm that only handles waves propagating at less than 90 degrees (Figure 4.4-24).
Kirchhoff migration (Ratcliff et al., 1992) and the phase-shift method (Claerbout, 1985) also can be adapted to image turning waves. To develop the conceptual basis of turning-wave migration, consider the raypath segments D A D A DAD ADA and E D E D EDE DED as denoted in Figure 5.1-23. The raypath segment D A D A DAD ADA is associated with the upcoming wave energy contained in the normal-wave stack and the raypath segment E D E D EDE DED is associated with the downgoing wave energy contained in the turningwave stack (Figure 5.1-24).
Just as the stacking process was treated in two parts, the innaging process also can be treated in
FIG. 5.1-24. Left column: Normal-wave stack (top), turning-wave stack (middle) and composite-wave stack (bottom) created by adding the normal-wave and turning-wave stacks. Right column: Migrations of the sections on the left column. (Hale et al., 1992).
two parts. First, perform phase-shift migration of the normal-wave stack; this involves downward extrapolation of the upcoming wave energy along the raypath C E C E CEC ECE from the surface z = 0 z = 0 z=0z=0z=0 to a depth z E z E z_(E)z_{E}zE where the wave originates (location E E EEE in Figure 5.1-23). The equation for the wave extrapolation is (Section D.1):
P ( k y , z = z E , ω ) = P ( k y , z = 0 , ω ) exp ( i k z z E ) P k y , z = z E , ω = P k y , z = 0 , ω exp i k z z E P(k_(y),z=z_(E),omega)=P(k_(y),z=0,omega)exp(-ik_(z)z_(E))P\left(k_{y}, z=z_{E}, \omega\right)=P\left(k_{y}, z=0, \omega\right) \exp \left(-i k_{z} z_{E}\right)P(ky,z=zE,ω)=P(ky,z=0,ω)exp(ikzzE)
where k y , k z k y , k z k_(y),k_(z)k_{y}, k_{z}ky,kz, and ω ω omega\omegaω are the Fourier transform variables associated with the coordinate variables for midpoint y y yyy, depth z z zzz, and two-way zero-offset traveltime t r t r t_(r)t_{\mathrm{r}}tr respectively, and P ( k y , z = 0 , ω ) P k y , z = 0 , ω P(k_(y),z=0,omega)P\left(k_{y}, z=0, \omega\right)P(ky,z=0,ω) is the 2-D Fourier transform of the upconing wavefield at the surface z = 0 z = 0 z=0z=0z=0 represented by the stacked data P ( y , z = 0 , t ) P ( y , z = 0 , t ) P(y,z=0,t)P(y, z=0, t)P(y,z=0,t). The vertical wavenumber k z k z k_(z)k_{z}kz is defined in terms of the horizontal wavenumber k y k y k_(y)k_{y}ky and frequency ω ω omega\omegaω by the dispersion reJation (Section D.1):
k z = 2 v ω 2 v 2 k v 2 4 k z = 2 v ω 2 v 2 k v 2 4 k_(z)=(2)/(v)sqrt(omega^(2)-(v^(2)k_(v)^(2))/(4))k_{z}=\frac{2}{v} \sqrt{\omega^{2}-\frac{v^{2} k_{v}^{2}}{4}}kz=2vω2v2kv24
where v v vvv is the medium velocity. In equation (5-27), the region of propagation at angles less than 90 degrees is associated with ω > ( v / 2 ) | k y | ω > ( v / 2 ) k y omega > (v//2)|k_(y)|\omega>(v / 2)\left|k_{y}\right|ω>(v/2)|ky|, and the region of evanescense at angles greater than 90 degrees is associated with ω < ( v / 2 ) | k y | ω < ( v / 2 ) k y omega < (v//2)|k_(y)|\omega<(v / 2)\left|k_{y}\right|ω<(v/2)|ky|.
Next, perform phase-shift migration of the turningwave stack; this involves downward extrapolation of the upcoming wave energy along the raypath A D A D ADA DAD from the surface z = 0 z = 0 z=0z=0z=0 to a depth z D z D z_(D)z_{D}zD where the wave turns (location D D DDD in Figure 5.1-23). The equation for the wave extrapolation is
P ( k y , z = z D , ω ) = P ( k y , z = 0 , ω ) exp ( ı k z z D ) P k y , z = z D , ω = P k y , z = 0 , ω exp ı k z z D P(k_(y),z=z_(D),omega)=P(k_(y),z=0,omega)exp(-ık_(z)z_(D))P\left(k_{y}, z=z_{D}, \omega\right)=P\left(k_{y}, z=0, \omega\right) \exp \left(-\imath k_{z} z_{D}\right)P(ky,z=zD,ω)=P(ky,z=0,ω)exp(ıkzzD)
Since the journey of the turning waves does not end at the turning point D D DDD, we nust continue with the wave extrapolation until we reach the point where the waves originate on the salt flank (location E E EEE in Figure 5.1-23). Hence, perform upward extrapoiation of the downgoing wave energy along the raypath D E D E DED EDE from the depth level z D z D z_(D)z_{D}zD to location E E EEE on the sait flank:
P ( k y , z = z E , ω ) = P ( k y , z = z D , ω ) exp [ i k z ( z D z E ) ] , P k y , z = z E , ω = P k y , z = z D , ω exp i k z z D z E , P(k_(y),z=z_(E),omega)=P(k_(y),z=z_(D),omega)exp[-ik_(z)(z_(D)-z_(E))],P\left(k_{y}, z=z_{E}, \omega\right)=P\left(k_{y}, z=z_{D}, \omega\right) \exp \left[-i k_{z}\left(z_{D}-z_{E}\right)\right],P(ky,z=zE,ω)=P(ky,z=zD,ω)exp[ikz(zDzE)],
The wave extrapolations described by equations (5 28 a , b 28 a , b 28a,b28 \mathrm{a}, \mathrm{b}28a,b ) are performed in the transform domain only using the evanescent energy that corresponds to the region ω < ( v / 2 ) | k y | ω < ( v / 2 ) k y omega < (v//2)|k_(y)|\omega<(v / 2)\left|k_{y}\right|ω<(v/2)|ky|.
Just as the stacking of normal waves and turning waves is combined to obtain the composite-wave stack (Figure 5.1-24), the migration processes based on the extrapolation equations (5-26) and (5-28a,b) can also be combined (Hale et al., 1992). First, substitute equation (5-28a) into equation (5-28b) to obtain
P ( k y , z = z E , ω ) = P ( k y , z = 0 , ω ) × { exp [ ı k z z D ı k z ( z D z E ) ] } P k y , z = z E , ω = P k y , z = 0 , ω × exp ı k z z D ı k z z D z E {:[P(k_(y),z=z_(E),omega)=P(k_(y),z=0,omega)],[ xx{exp[-ık_(z)z_(D)-ık_(z)(z_(D)-z_(E))]}]:}\begin{aligned} P\left(k_{y}, z=z_{E}, \omega\right) & =P\left(k_{y}, z=0, \omega\right) \\ & \times\left\{\exp \left[-\imath k_{z} z_{D}-\imath k_{z}\left(z_{D}-z_{E}\right)\right]\right\} \end{aligned}P(ky,z=zE,ω)=P(ky,z=0,ω)×{exp[ıkzzDıkz(zDzE)]}
Then, combine equations (5-26) and (5-29a) to obtain the exptrapolation equation for the conposite-wave stack:
P ( k y , z = z E , ω ) = P ( k y , z = 0 , ω ) × { exp ( ı k z z E ) + exp [ ı k z ( 2 z D z E ) ] } ( 5 29 b ) P k y , z = z E , ω = P k y , z = 0 , ω × exp ı k z z E + exp ı k z 2 z D z E ( 5 29 b ) {:[P(k_(y),z=z_(E),omega)=P(k_(y),z=0,omega)],[ xx{exp(-ık_(z)z_(E))+exp[-ık_(z)(2z_(D)-z_(E))]}],[(5-29 b)]:}\begin{aligned} & P\left(k_{y}, z=z_{E}, \omega\right)=P\left(k_{y}, z=0, \omega\right) \\ & \times\left\{\exp \left(-\imath k_{z} z_{E}\right)+\exp \left[-\imath k_{z}\left(2 z_{D}-z_{E}\right)\right]\right\} \\ & (5-29 b) \end{aligned}P(ky,z=zE,ω)=P(ky,z=0,ω)×{exp(ıkzzE)+exp[ıkz(2zDzE)]}(529b)
Based on the concepts described above, we now outline the steps involved in a turning-wave migration algorithm that makes use of the phase-shift method (Claerbout, 1985; Hale et al., 1992). First, consider inaging the normal waves. The process involves downward continution of the upcoming waves from the surface z = 0 z = 0 z=0z=0z=0 to the maximum specified depth z max z max  z_("max ")z_{\text {max }}zmax  at discrete depth steps Δ z Δ z Delta z\Delta zΔz.
(a) Start with the composite-wave stack an approximation to the zero-offset section P ( y , z = 0 , t ) P ( y , z = 0 , t ) P(y,z=0,t)P(y, z=0, t)P(y,z=0,t) and apply 2 -D Fourier transform to get the transformed wavefield P ( k y , z = 0 , ω ) P k y , z = 0 , ω P(k_(y),z=0,omega)P\left(k_{y}, z=0, \omega\right)P(ky,z=0,ω).
(b) For each frequency ω > ( v / 2 ) | k y | ω > ( v / 2 ) k y omega > (v//2)|k_(y)|\omega>(v / 2)\left|k_{y}\right|ω>(v/2)|ky| and ω ( v / 2 ) | k y | ω ( v / 2 ) k y omega <= (v//2)|k_(y)|\omega \leq(v / 2)\left|k_{y}\right|ω(v/2)|ky| in the transform domain, extrapolate the wavefield P ( k y , z , ω ) P k y , z , ω P(k_(y),z,omega)P\left(k_{y}, z, \omega\right)P(ky,z,ω) at depth z z zzz with a phase-shift operator exp ( t k z Δ z ) exp t k z Δ z exp(-tk_(z)Delta z)\exp \left(-t k_{z} \Delta z\right)exp(tkzΔz) to get the wavefield P ( k y , z + Δ z , ω ) P k y , z + Δ z , ω P(k_(y),z+Delta z,omega)P\left(k_{y}, z+\Delta z, \omega\right)P(ky,z+Δz,ω) at depth z + Δ z z + Δ z z+Delta zz+\Delta zz+Δz. At each depth, a new extrapolation operator with the velocity v ( z ) v ( z ) v(z)v(z)v(z) defined for that z z zzz value is computed.
(c) Split the wavefield P ( k ν , z + Δ z , ω ) P k ν , z + Δ z , ω P(k_(nu),z+Delta z,omega)P\left(k_{\nu}, z+\Delta z, \omega\right)P(kν,z+Δz,ω) into its propagating P u ( k y , z + Δ z , ω ) P u k y , z + Δ z , ω P_(u)(k_(y),z+Delta z,omega)P_{u}\left(k_{y}, z+\Delta z, \omega\right)Pu(ky,z+Δz,ω) and evanescent P d ( k y , z + P d k y , z + P_(d)(k_(y),z+:}P_{d}\left(k_{y}, z+\right.Pd(ky,z+ Δ z , ω ) Δ z , ω ) Delta z,omega)\Delta z, \omega)Δz,ω) components, corresponding to the normal and turning waves, respectively,
(d) Save the wavefield P d ( k y , z + Δ z , ω ) P d k y , z + Δ z , ω P_(d)(k_(y),z+Delta z,omega)P_{d}\left(k_{y}, z+\Delta z, \omega\right)Pd(ky,z+Δz,ω) for use later in turning-wave imaging.
(e) As for any other migration algorithm, invoke the inaging principle t = 0 t = 0 t=0t=0t=0 upon the wavefield P u ( k y , z + Δ z , w ) P u k y , z + Δ z , w P_(u)(k_(y),z+Delta z,w)P_{u}\left(k_{y}, z+\Delta z, w\right)Pu(ky,z+Δz,w) at each extrapolation step to obtain the nigrated section from the normal waves P u ( k y , z , t = 0 ) P u k y , z , t = 0 P_(u)(k_(y),z,t=0)P_{u}\left(k_{y}, z, t=0\right)Pu(ky,z,t=0) in the transform domain. The imaging condition t = 0 t = 0 t=0t=0t=0 is met by summing over all frequency components of the extrapolated wavefield at each depth step (equation D-84).
(f) Repeat steps (b) through (d) for all depth steps down to a specified z = z m a x z = z m a x z=z_(m)axz=z_{m} a xz=zmax to obtain the normalwave intage in the transform domain P u ( k y , z , t = P u k y , z , t = P_(u)(k_(y),z,t=:}P_{u}\left(k_{y}, z, t=\right.Pu(ky,z,t= 0 ) 0 ) 0)0)0).
(g) Apply inverse Fowier transform in the ruidpoint y y yyy direction to obtain the inage P u ( y , z , t = 0 ) P u ( y , z , t = 0 ) P_(u)(y,z,t=0)P_{u}(y, z, t=0)Pu(y,z,t=0) from the normal waves.
Now consider imaging the turning waves. The process involves upward continuation of the downgoing waves from the maximum specified depth z max z max z_(max)z_{\max }zmax to the surface z = 0 z = 0 z=0z=0z=0 at discrete depth steps Δ z Δ z Delta z\Delta zΔz. At each depth, the downgoing waves are updated by adding the evansecent wave P d ( k y , z , ω ) P d k y , z , ω P_(d)(k_(y),z,omega)P_{d}\left(k_{y}, z, \omega\right)Pd(ky,z,ω) saved in step (d) during the downward extrapolation of the composite-wave stack. We shall assume that the downgoing wave at z = z max z = z max z=z_(max)z=z_{\max }z=zmax is null.
(a) Add the evanescent wave saved at depth z z zzz to the downgoing wave at the same depth, and for each frequency ω ( v / 2 ) | k y | ω ( v / 2 ) k y omega <= (v//2)|k_(y)|\omega \leq(v / 2)\left|k_{y}\right|ω(v/2)|ky| in the evansecent region of the transform domain, extrapolate the new downgoing wave with a phase-shift operator exp ( i k z Δ z ) exp i k z Δ z exp(-ik_(z)Delta z)\exp \left(-i k_{z} \Delta z\right)exp(ikzΔz) to get the wavefield P d ( k y , z Δ z , ω ) P d k y , z Δ z , ω P_(d)(k_(y),z-Delta z,omega)P_{d}\left(k_{y}, z-\Delta z, \omega\right)Pd(ky,zΔz,ω) at depth z Δ z z Δ z z-Delta zz-\Delta zzΔz.
(b) Invoke the imaging principle t = 0 t = 0 t=0t=0t=0 upon the wavefield P d ( k y , z Δ z , ω ) P d k y , z Δ z , ω P_(d)(k_(y),z-Delta z,omega)P_{d}\left(k_{y}, z-\Delta z, \omega\right)Pd(ky,zΔz,ω) at each extrapolation step to obtain the migrated section from the turning waves P d ( k y , z , t = 0 ) P d k y , z , t = 0 P_(d)(k_(y),z,t=0)P_{d}\left(k_{y}, z, t=0\right)Pd(ky,z,t=0) in the transform domain.
(d) Repeat steps (a) and (b) for all depth steps to obtain the turning-wave image in the transform domain P d ( k y , z , t = 0 ) P d k y , z , t = 0 P_(d)(k_(y),z,t=0)P_{d}\left(k_{y}, z, t=0\right)Pd(ky,z,t=0).
(e) Apply inverse Fourier transform in the midpoint y y yyy direction to obtain the image P d ( y , z , t = 0 ) P d ( y , z , t = 0 ) P_(d)(y,z,t=0)P_{d}(y, z, t=0)Pd(y,z,t=0) from the turning waves.
(e) Add the normal-wave image and turning-wave image to obtain the composite-wave image.
As described above, it is important to emphasize that the turning-wave energy can be preserved only by making use of its abnormal moveout behavior during stacking and imaged properly by making use of the evanescent energy during migration.
Figure 5.1-24 (right column) shows migration of a normal-wave stack using the phase-shift equation (528), migration of a turning-wave stack using the phaseshift equation (5-31a), and migration of the compositewave stack using the phase-shift equation (5-31b). Note the distinctively defined salt boundary obtained from imaging the compsite-wave stack.

5.2 DIP-MOVEOU'T CORRECTION IN PRACTICE

Results of the previous section suggest the general DMO processing sequence shown in Figure 5.2-1.
(a) Perform velocity analysis at sparse intervals and pick just a few velocity functions with minimal dip effects.
  1. Velocity Analysis
  2. NMO Correction using Flat-Event Velocities

3. DMO Correction

4. Inverse NMO Correction with Velocities used in Step 2

5. Velocity Analysis6. NMO Correction usingOptimum Stacking Velocities

7. Stacking

  1. Migration
FIG. 5.2-1. DMO processing flowchart.
(b) Apply NMO correction using the these flat-event velocities.
(c) Sort data to common-offset sections, apply DMO correction and sort back to CMP gathers.
(d) Apply inverse NMO correction using the flat-event velocities from step (a).
(e) Perform velocity analysis at frequent intervals as needed to derive an optimum stacking velocity field.
(f) Apply NMO correction using the optimum satcking velocity field.
(g) Stack the data and migrate using an edited and appropriately smoothed version of the optimum satcking velocity field.
Note that this processing sequence is similar to the sequence for residual statics corrections described in Figure 3.3-12. Both residual statics and DMO corrections are followed by a revision of velocities so as to get the most out of these corrections during stacking. In this section, we shall apply the sequence outlined above to two common cases of conflicting dips with different stacking velocities - salt flanks and fault planes.

Salt Flanks

Figure 5.2-2 shows selected CMP gathers along a marine line over a salt structure. CMP gathers 1381 (at 1.5
s), 1461 (at 2.2 s 2.2 s 2.2s2.2 \mathrm{~s}2.2 s ), and 170I (at 1.55 s 1.55 s 1.55s1.55 \mathrm{~s}1.55 s ) exhibit cases of conflicting dips associated with two events with signifcantly different moveouts.
The DMO processing sequence includes the following steps.
(a) Perform velocity analysis sparsely along the line at locations with prominently flat events and create an initial velocity field.
(b) Apply normal-moveout correction using lat-event velocities. Note the events associated with steep dips have been overcorrected as demonstrated in Figure 5.2-3, whereas reflections with no dip or negligibly small dip have been flattened.
(c) Apply partial stacking to CMP gathers to reduce the fold from 60 to 30 . A partial stack up to a 4:1 reduction in fold usually is acceptable before DMO correction. While fold reduction provides significant computational savings, it must not be done excessively. Following the fold reduction, sort the moveout-corrected gathers (Figure 5.2-3) to common-offet sections and perform dip-moveout correction. Then, sort back to CMP gathers. Compare the selected gathers after DMO correction (Figure 5.2-4) with the same gathers without DMO correction (Figure 5.2-3), and note that the duality in event moveout on CMP gathers 1381 (at 1.5 s), 1461 (at 2.2 s 2.2 s 2.2s2.2 \mathrm{~s}2.2 s ), and 1701 (at 1.55 s 1.55 s 1.55s1.55 \mathrm{~s}1.55 s ) bas been removed. This is a direct result of the partial migration effect of the DMO correction.
(d) Apply inverse moveout correction (Figure 5.2-5) with the same velocity field that was used for the NMO correction prior to DMO correction (Figure 5.2-3).
(e) Perform velocity analysis at frequent intervals along the line and pick velocity functions which now are supposed to have been corrected for the dip effect. Refer to the velocity analysis at midpoint 1381 shown in Figure 5.2-6. Note the improved velocity trend after DMO correction. Close-up displays of the semblance spectrum and the moveoutcorrected gather before and after DMO correction are shown in Figure 5.2-7 and 5.2-8, respectively. Note the two semblance peaks at 1.5 g 1.5 g 1.5g1.5 \mathrm{~g}1.5 g - one at 2050 m / s 2050 m / s 2050m//s2050 \mathrm{~m} / \mathrm{s}2050 m/s and the other at 2750 m / s 2750 m / s 2750m//s2750 \mathrm{~m} / \mathrm{s}2750 m/s. Because the gather was moveout corrected using the denoted velocity function that includes the 2050 m / s 2050 m / s 2050m//s2050 \mathrm{~m} / \mathrm{s}2050 m/s peak, the event associated with the 2750 m / s 2750 m / s 2750-m//s2750-\mathrm{m} / \mathrm{s}2750m/s peak has been overcorrected (Figure 5.2-7). DMO correction has removed the duality in the velocity spectrum at about 1.5 s 1.5 s 1.5s1.5 \mathrm{~s}1.5 s and yielded a more distinctive trend (Figure 5.2-8) compared to the spectrum derived from the gather with no D M O D M O DMOD M ODMO correction. The distinctive trend is a direct result of the fact that DMO correction removes reflection-point smearing by mapping reflection points on a dipping reflector associated with nonzero source-receiver separation onto normal-incidence reflection point. The partial migration effect of DMO correction has actually moved the dipping event with the 2750 m / s 2750 m / s 2750m//s2750 \mathrm{~m} / \mathrm{s}2750 m/s peak to a different midpoint location.
(f) Create a velocity field using the velocity functions picked from the velocity spectra computed from the DMO-corrected gathers (Figure 5.2-9b). This velocity field has more detail than the initial field (Figure 5.2-9a) used for NMO correction prior to DMO correction (step b). This initial velocity field also was used to apply the inverse NMO correction as in step (d).
(g) Apply moveout correction to the DMO-corrected gathers using the velocity field as in Figure 5.29b. Selected CMP gathers are shown in Figure 5.210 , and the corresponding CMP stack is shown in Figure 5.2-11. As a result of DMO correction, the steeply dipping salt-flank reflections have been stacked with as much power as the flat events associated with the surrounding strata. Since a DMO stack is a closer approximation to a zero-offset section in comparison with a CMP stack, time migration of the DMO stack yields an image of the salt diapirs with their flanks clearly delineated, especially between 1-1.5 s (Figure 5.2-12). For comparison, conventional CMP stack and its migration are shown in Figures 5.2-13 and 5.2-14, respectively. Because the reflections of the flanks of the salt diapirs have not been preserved with adequate strength on the CMP stack (Figure 5.2-13), time migration yields a poor definition of the salt boundaries (Figure 5.2-14).

Fault Planes

Figure 5.2-15 shows selected CMP gathers along a marine line over a structure with fault blocks. CMP gather at midpoint location 1688 (at 2.5 s 2.5 s 2.5s2.5 \mathrm{~s}2.5 s ) exhibits a clear case of conflicting dips associated with two events with significantly different moveouts.
The DMO processing sequence includes the following steps.
(a) Perform velocity analysis sparsely along the line at locations with prominently flat events and create an initial velocity field.
a
b
FIG. 5.2-6. Velocity spectrum computed from a CMP gather (a) without, and (b) with DMO correction, as in Figures 5.2-2 and 5.2 5 5.2 5 5.2-55.2-55.25, respectively.
a
b
FIG. 5.2-7. A close-up view of the velocity spectrum shown in Figure 5.2-6a and the associated CMP gather withont DMO correction followed by moveout correction using the velocity function depicted in (a).
FIG. 5.2-8. A close-up view of the velocity spectrum shown in Figure 5.2-6b and the associated CMP gather with DMO correction followed by moveout correction using the velocity function depicted in (a).
a
b
FIG. 5.2-9. The velocity field used to stack the CMP gathers (a) as in Figure 5.2-3 without DMO corroction, and (b) as in Figure 5.2-5 with DMO currection.
FIG. 5.2-11. DMO stack derived from CMP gathers as in Figure 5.2-10. Compare with Figure 5.2-13.
FIG. 5.2-12. Migration of the DMO stack shown in Figure 5 2-11. Compare with Figure 5.2-14.
FIG. 5.2-13. CMP stack derived from CMP gathers as in Figure 5.2-3. Compare with Figure 5.2-11.
FIG. 5.2-14. Migration of the CMP stack shown in Figure 5.2-13. Compare with Figure 5.2-12.
(b) Apply normal-moveout correction using flat-event velocities. Note the event at 2.5 s 2.5 s 2.5s2.5 \mathrm{~s}2.5 s on CMP gather 1688 associated with steep fault-plane reflections has been overcorrected as demonstrated in Figure 5.2-16, whereas reflections with no dip or negligibly small dip have been flattened.
(c) Apply partial stacking to CMP gathers to reduce the fold from 60 to 30 , and sort the moveoutcorrected gathers (Figure 5.2-16) to commonoffset sections and perform dip-moveout correction. Then, sort back to CMP gathers and compare the selected gathers after DMO correction (Figure 5.217) with the same gathers without DMO correction (Figure 5.2-16). Note that the overcorrected event at 2.5 s 2.5 s 2.5s2.5 \mathrm{~s}2.5 s on CMP gather 1688 has been removed. Again, this is a direct result of the partial migration effect of the DMO correction.
(d) Apply inverse moveout correction (Figure 5.2-18) with the same velocity field that was used for the NMO correction prior to DMO correction (Figure 5.2-16).
(e) Perform velocity analysis at frequent intervals along the line and pick velocity functions which now are supposed to have been corrected for the dip effect. Refer to the velocity analysis at midpoint 1688 shown in Figure 5.2-19. Refer to the velocity spectrum (Figure 5.2-19b) associated with the gather without DMO correction (Figure 5.219a) and note the two semblance peaks at 2.5 s 2.5 s 2.5s-2.5 \mathrm{~s}-2.5 s one at 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s and the other at 2750 m / s 2750 m / s 2750m//s2750 \mathrm{~m} / \mathrm{s}2750 m/s. The gather was moveout corrected using the denoted velocity function that includes the 2500 m / s 2500 m / s 2500-m//s2500-\mathrm{m} / \mathrm{s}2500m/s peak, rather than the 2750 m / s 2750 m / s 2750m//s2750 \mathrm{~m} / \mathrm{s}2750 m/s peak. DMO correction has partially migrated the steeply dipping event to another midpoint location, and as a direct consequence, has removed the duality in the velocity spectrum at 2.5 s 2.5 s 2.5s2.5 \mathrm{~s}2.5 s and yielded a more distinctive trend (Figure 5.2-19d) compared to the spectrum derived from the gather with no DMO correction (Figure 5.2-19b).
(f) Create a velocity field using the velocity functions picked from the velocity spectra computed from the DMO-corrected gathers.
(g) Apply moveout correction to DMO-corrected gathers using this velocity field. Selected CMP gathers are shown in Figure 5.2-20 and the corresponding CMP stack is shown in Figure 5.2-21. As a result of DMO correction, the steeply dipping faultplane reflections have been preserved during stacking. Since a DMO stack is a closer approximation to a zero-offset section in comparison with a CMP stack, time migration of the DMO stack yields an image which shows clearly delineated fault blocks in the vicinity of CMP 1688 (Figure 5.2-22). For comparison, conventional CMP stack and its migration are shown in Figures 5.2-23 and 5.2-24, re spectively. Because the fault-plane reflections have not been preserved with adequate strength on the CMP stack (Figure 5.2-23), time migration yields a blurred inage of the fault blocks (Figure 5.2-24).

DMO and Multiples

Multiples can be enhanced or attenuated by DMO correction. Consider the situation depicted in the velocity spectrum shown in Figure 5.2-25. Suppose you have a flat primary and a flat multiple. After DMO correction, the velocity contrast Δ v Δ v Delta v\Delta vΔv between the primary and the multiple would not change; therefore, DMO correction does not have any impact on the success or failure of a multiple attenuation technique in such a case. A similar situation exists for a dipping primary and a dipping multiple. If you have a dipping primary and a flat multiple a case where the multiple associated with a fat water-bottom interferes with a deeper dipping primary, then, after DMO correction the flat multiple will not be affected. However, the dipping primary will shift to the left on the velocity spectrum, causing a decrease in the velocity contrast between the two events. This suggests that multiple attenuation based on velocity discrimination between primaries and multiples would be less effective on DMO corrected gathers. Finally, the situation would favor multiple attenuation when you have a flat primary conflicting with a dipping multiple.
A field data example is shown in Figure 5.2-26. Note the conflicting primary and multiple events below midpoint 1716 at 1 s 1 s 1s1 \mathrm{~s}1 s on the section without DMO correction (Figure 5.2-26a). In this case, following DMO correction, the velocity contrast between the primary and multiple event has increased, and thus has led to attenuation of the latter during stacking of the DMOcorrected gathers (Figure 5.2-26b).
The practical question as to whether a multiple attenuation technique should be applied before or after DMO correction is an important one. This question is relevant only for multiple attenuation techniques based on velocity discrimination (Chapter 6). Often, for reasons of efficiency, the multiple attenuation step precedes DMO correction. This is especially the case in processing 3-D data following 3-D DMO correction, data often are stacked concurrently without creating DMOcorrected gathers.

FIG. 5.2-25. A velocity spectrum which indicates a primary event ( P P P\mathbf{P}P ) and a multiple event (M) arriving at about the same zero-offset time. The multiple event is associated with a shallow primary. Depending on the flat or dipping character of the primary and multiple reflection, the velocity contrast Δ v Δ v Delta v\Delta vΔv between the two changes after DMO correction (see text for details).

DMO and Coherent Linear Noise

The constant-velocity assumption underlying the most commonly used DMO algorithms can sometimes attenuate dipping events. This is the case with a shallow dipping event and a deep flat event (Black et al., 1985). If velocity increases with depth (the usual case), then these two events can arrive about the same time and have similar moveouts (Figure 5.2-27). In terms of velocities, this implies that the moveout (or stacking) velocity v 1 / cos θ v 1 / cos θ v_(1)//cos thetav_{1} / \cos \thetav1/cosθ for the shallow, dipping reflector is approximately equal to the moveout velocity v 2 v 2 v_(2)v_{2}v2 associated with the deep, flat reflector. Following the DMO correction, nothing happens to the flat event, while the dipping event shifts to a lower velocity value v 1 v 1 v_(1)v_{1}v1. The dipping event, that may be associated with coherent linear noise, drifts away from the velocity function for flat events and thus is attenmated during stacking.
This characteristic response of DMO can be used to our advantage in attenuating coherent linear noise associated with shallow point scatterers in the water bottom. A field data example is shown in Figure 5.2-28.
While the diffactions associated with the steep flanks of the salt diapir are better preserved by DMO correction, the steep coherent linear noise is attenuated by this process.

Other Considerations

Dip-moveout correction is most effective at shallow times where velocities usually are low. Figure 5.2-29 shows a shallow portion of a CMP stack with and without DMO correction. Note that DMO correction has preserved the diffractions associated with the fault blocks and the fault-plane reflections. As a result, migration then has better imaged the subtle faults in the subsurface.
Albeit dip-moveout correction becomes relatively less significant at late times just the opposite situation with migration, it can still produce a better stack than conventional CMP stacking. Figure 5.2-30 shows a moderately deep portion of a CMP stack with and without DMO correction. DMO correction has visibly enhanced the deep reflections and diffractions. Migrated sections (Figure 5.2-31) exhibit comparable imaging of the dipping events and the unconformity which envelopes these events from below. On the other hand, the crispness of the image from DMO stack (Figure 5.2-31b) also is noticeable.
The response of DMO correction to random noise is examined in Figure 5.2-32. Typically, random noise is more prominent at late times. Since DMO correction becomes increasingly less effective at late times, it may be concluded that it hes minimal impact on random noise. On the other hand, random noise at shallow times may seemingly be attenuated by DMO correction. This action of the DMO process can be attributed to the fact that it is a migration process involving spreading of amplitudes along elliptical trajectories. Nevertheless, DMO correction should not be viewed and used as a process to attenuate noise.
DMO correction becomes insignificant in a medium with high velocities. Figure 5.2-33 shows a CMP stack with and without DMO correction. Velocities vary from 4000 m / s 4000 m / s 4000m//s4000 \mathrm{~m} / \mathrm{s}4000 m/s at the surface to 6000 m / s 6000 m / s 6000m//s6000 \mathrm{~m} / \mathrm{s}6000 m/s at the bottom of the section. Note that, diffractions and nearly flat. reflections with conflicting dips appear to stack equally, with or without DMO correction. A way to distinguish between the two sections is the relative attenuation of the shallow coherent linear noise by DMO correction.
DMO correction must always be considered within the framework of time migration. Specifically, DMO correction is not meant to solve the problem of nonhyperbolic moveout of reflections below complex overburden structures which often are accompanied with strong
FIG. 5.2-26. A portion of CMP stack, (a) without, and (b) with DMO correction.
FIG. 5.2-27. Response of DMO correction to a deep flat reflector (F) and a shallow dipping reflector (D). See text for details.
lateral velocity variations. While it is not expected to solve this problem, fortuitously, DMO correction may not harm such events. The base-salt event in Figure 5.2-28 exemplifies this observation. Note that, the two diffraction-like segments of the base-salt event below midpoint 1116 between 1.8 2 s 1.8 2 s 1.8-2s1.8-2 \mathrm{~s}1.82 s does not appear to be influenced by DMO correction.
For land data, DMO correction can be applied before statics corrections. Specifically, land data processing sequence that includes DMO correction is as follows:
(a) Estimate a model for the near-surface layer using refracted arrivals. The model parameters include the shape of the refractor (base of the weathering layer) and the bedrock velocity.
(b) Assume a value for the weathering velocity and use the near-surface layer to apply the shot and receiver refraction statics (Section 3.4) so as to replace the near-surface layer with the bedrock and move the shots and receivers from the topographic surface to a floating datum, which is a smoothed version of the surface topography.
(c) Perform preliminary velocity analysis and apply moveout corrections.
(d) Apply datum corrections to move the shots and receivers from the floating datum to a flat datum to which the CMP stack is referenced.
(e) Apply DMO correction.
(f) Estimate surface-consistent shot and receiver residual static shifts using methods described in Section 3.3 . (g) Apply residual statics corrections to CMP gathers.
(h) Apply the inverse of step (d) to move the shots and receivers from the flat reference datum back to the floating datum.
(i) Apply inverse moveout correction using velocities from step (c).
(j) Perform velocity analysis and apply roveout correction.
(k) Apply datum corrections to move the shots and receivers from the floating datum to the reference flat datum as in step (d).
(l) Apply mute and stack the data. The stacked section is referenced to the flat datum level specified in step (d).
The above sequence enables performing velocity antalysis after statics and DMO corrections so as to obtain an improved velocity field for the subsequent stacking and migration.
Can DMO be used for trace interpolation? Consider the constant-velocity synthetic data set associated with the earth model shown in Figure 5.1-3. Throw away every other trace on each of the common-ofiset sections and simulate a coarser trace spacing (Figure 5.2-34b). The selected CMP gathers shown in Figure 5.2-34a also exhibit the discarded traces replaced with zero traces. Apply DMO correction to all of the common-offset sections (Figure 5.2-34c) and sort back to CMP gathers (Figure 5.2-34d). Note that on the
(b)
FIG. 5.2-28. A portion of a CMP stack, (a) without, and (b) with DMO correction. Note the attenuation of coherent linear noise by DMO correction.
(a)
(b)
FIG. 5.2-30. A moderately deep portion of CMP stack, (a) without DMO correction, and (b) with DMO correction. Migrated sections are shown in Figure 5.2-31.
(a)
(b)
FIG. 5.2-31. Migrated sections, (a) without DMO correction, and (b) with DMO correction. Stacked sections input to migration are shown in Figure 5.2-30.
FIG. 5.2-32. A deep portion of a CMP stack, (a) without DMO correction, and (b) with DMO correction.
common-offset sections, the zero traces are filled in at large offsets by DMO correction, whereas they are not quite filled in at small offsets. So, the amplitude distribution after DMO correction will not be uniform from one common-offset section to another. Note also the aliased energy on the CMP gathers. Stack the DMO-corrected gathers and compare the resulting section with the desired zero-offset section (Figure 5.2-35). These data have not been subjected to any gain treatment after stack; hence, the relative amplitudes have been preserved. The amplitude imbalance in the DMO stack from the gathers with missing traces is quite apparent (Figure 5.2-35c).

Aspects of DMO Correction - A Summary

We discussed the principles of DMO correction and studied its practical aspects using synthetic and field data. It now is appropriate to compile aspects of DMO correction.
FIG. 5.2-33. A portion of a CMP stack, (a) without DMO correction, and (b) with DMO correction.
(a)
(b)
(c)
(d)
FIG. 5.2-34. (a) Selected moveout-corrected CMP gathers associated with the earth model of point scatteres depicted in Figure 5.1-3, with amplitudes on every other trace zeroed out; (b) selected common-offset sections; (c) same common-offset sections after DMO correction; (d) selected gathers as in (a) after DMO correction.
(a) The process of dip-moveout corrects for the dip effect on stacking velocities.
(b) Thus, it preserves conflicting dips with different stacking velocities during CMP stacking.
(c) The DMO stack, therefore, is a closer representation of a zero-offset section as compared to a conventional CMP stack based on normal-moveout correction, only.
(d) The DMO stack can then be migrated using a zerooffset migration algorithm with greater accuracy.
(e) Conflicting dips with different stacking velocities give rise to multivalued velocity picks from velocity spectra. Velocity analysis of DMO-corrected data alleviates this problem and increases the accuracy of picking an unambiguous velocity function from a velocity spectrum.
(f) Velocities estimated from DMO-corrected data are dip independent; therefore, they are more suitable to derive a migration velucity field as compared to velocities estimated from data without DMO correction.
(g) Dip-moveout correction actually is a process of partial migration before stack. Specifically, it maps normal-moveout-corrected data to normal-
(a)
(b)
(c)
FIG. 5.2-35. (a) Zera-offset section associated with the earth model of point scatteres depicted in Figure 5.1-3; (b) the DMO stack same as in figure 5.1 7 c 5.1 7 c 5.1-7c5.1-7 \mathrm{c}5.17c from the gathers as in Figure 5.1-6d without missing alternate traces; (c) the DMO stack from the gathers with missing alternate traces as in Figure 5 2-34d.
incidence reflection points in the subsurface. As a result, midpoint coordinate is variant under DMO correction.
(h) As a direct consequence of aspect (g), DMO correction removes the reflection point dispersal associated with nonzero-offset recording in the presence of dipping reflectors.
(i) Following DMO correction, prestack data can be migrated so as to create CMP gathers in their migrated position (next section). This then enables us to conduct velocity analysis to derive a migration velocity field with greater confidence.
(j) Finally, the CMP gathers from prestack time migration of DMO-corrected data can be used for amplitude variation with offset analysis.
In this chapter, we discussed the dip-moveout process within the context of 2-D seismic data. Threedimensional aspects of DMO correction are discussed in Section 7.2 .

5.3 PRESTACK TIME MIGRATION

As stated early in the chapter, the rigorous solution to the problem of conflicting dips with different stacking velocities is prestack time migration. The robust alternative in practice is to apply N M O N M O NMO\mathrm{NMO}NMO and DMO corrections followed by poststack time migration. The migration step can, however, be moved up to precede CMP stacking. Specifically, by migrating each of the NMOand DMO-corrected common-offset sections, one has the opportunity to update the velocity field and generate CMP gathers which can be used for analysis of amplitude variation with offset as well as to obtain an improved migrated stack.
We now review the kinematics of prestack time migration. The theory of extrapolation of nonzerooffset wavefields is provided in Section D.1, while the stationary-phase traveltime trajectory associated with nonzero-offset wave propagation is given in Section E.5. Figure E-2 shows a sketch of a nonzero-offset raypath in a constant-velocity medium from a source location S S SSS to a reflection point R R RRR and to a receiver location G G GGG. The traveltime equation associated with the raypath S R G S R G SRGS R GSRG is given by (Section E.5)
v t = x 2 + ( y + h ) 2 + z 2 + ( y h ) 2 v t = x 2 + ( y + h ) 2 + z 2 + ( y h ) 2 vt=sqrt(x^(2)+(y+h)^(2))+sqrt(z^(2)+(y-h)^(2))v t=\sqrt{x^{2}+(y+h)^{2}}+\sqrt{z^{2}+(y-h)^{2}}vt=x2+(y+h)2+z2+(yh)2
where v v vvv is the medium velocity, t t ttt is the total traveltime from S S SSS to R R RRR to G G GGG. The medium is represented by the midpoint y y yyy and depth z z zzz coordinates.
Equation (5-32) can be put into the following alternative form (Section E.5):
y 2 ( v t / 2 ) 2 + z 2 ( v t / 2 ) 2 h ¯ 2 = 1 y 2 ( v t / 2 ) 2 + z 2 ( v t / 2 ) 2 h ¯ 2 = 1 (y^(2))/((vt//2)^(2))+(z^(2))/((vt//2)^(2)- bar(h)^(2))=1\frac{y^{2}}{(v t / 2)^{2}}+\frac{z^{2}}{(v t / 2)^{2}-\bar{h}^{2}}=1y2(vt/2)2+z2(vt/2)2h¯2=1
which represents an ellipse in the y z y z y-zy-zyz plane for a constant t t ttt with the following parameters:
(a) Semi-major axis in midpoint y y yyy direction: a = v t / 2 a = v t / 2 a=vt//2a=v t / 2a=vt/2.
(b) Semi-minor axis in depth z z zzz direction: b = b = b=b=b= ( v t / 2 ) 2 h 2 ( v t / 2 ) 2 h 2 sqrt((vt//2)^(2)-h^(2))\sqrt{(v t / 2)^{2}-h^{2}}(vt/2)2h2
(c) Distance from center to either focus: a 2 b 2 = h a 2 b 2 = h sqrt(a^(2)-b^(2))=h\sqrt{a^{2}-b^{2}}=ha2b2=h.
(d) Distance from one focus to a point on the ellipse to the other focus: v t v t vtv tvt.
From its properties, note that this ellipse in the y y y-y-y z z zzz plane can be associated with a recording geometry
for a source-recejver pair which is situated at the foci with a separation equal to the offset 2 h 2 h 2h2 h2h (Figure E-2). The ellipse itself describes the geometry of a reflecting interface such that the reflections recorded by a sourcereceiver pair situated at the foci have the same arrival time t t ttt. This means that the nonzero-offset traveltime section from such a recording would contain traces with zero amplitudes, except for one sample at time t t ttt on the trace at a midpoint location that coincides with the center of the ellipse. Hence, the ellipse of equation (533) in the y z y z y-zy-zyz plane describes the impulse response of a prestack migration operator applied to nonzero-offset data.
Equation (5-32) describes the nonzero-offset traveltime trajectory in the y t y t y-ty-tyt plane for a constant z z zzz associated with a point scatterer. Figure D-5 (Section D.1) shows the elliptic wayefront in the y z y z y-zy-zyz plane equivalent to the elliptic reflector geometry described here, and the table-top traveltime trajectory in the y t y t y-ty-tyt plane.
When equation (5-33) is specialized to the zerooffset case, h = 0 h = 0 h=0h=0h=0, we obtain
y 2 ( v t / 2 ) 2 + z 2 ( v t / 2 ) 2 = 1 y 2 ( v t / 2 ) 2 + z 2 ( v t / 2 ) 2 = 1 (y^(2))/((vt//2)^(2))+(z^(2))/((vt//2)^(2))=1\frac{y^{2}}{(v t / 2)^{2}}+\frac{z^{2}}{(v t / 2)^{2}}=1y2(vt/2)2+z2(vt/2)2=1
which describes a circle in the y z y z y-zy-zyz plane for a constant t t ttt with a radius u t / 2 u t / 2 ut//2u t / 2ut/2. This circle represents the impulse response of a poststack migration operator applied to zero-offset data.
When equation (5-32) is specialized to the zerooffset case, h = 0 h = 0 h=0h=0h=0, we obtain
v t = 2 y 2 + z 2 v t = 2 y 2 + z 2 vt=2sqrt(y^(2)+z^(2))v t=2 \sqrt{y^{2}+z^{2}}vt=2y2+z2
which describes the well-known diffraction hyperbola in the y t y t y-ty-tyt plane for a constant z z zzz. Figure D-6 (Appendix D) shows the circular wavefront in the y z y z y-zy-zyz plane equivalent to the circular reflector geometry described here, and the zero-ofset hyperbolic traveltime trajectory in the y t y t y-ty-tyt plane.
In Section 4.1, we discussed semicircle superposition and diffraction summation concepts for zero-offset migration using equations (5-34a) and (5-34b), respectively. Specifically, zero-ofset migration can be conceptualized as spreading of amplitudes on each input stacked trace on the y t y t y-ty-tyt plane along semicircular trajectories on the y z y z y-zy-zyz plane of the migrated section. Alternatively, for a given output sample of a trace on the z t z t z-tz-tzt plane of the migrated section, amplitudes along the hyperbolic trajectory on the y t y t y-ty-tyt plane of the input stacked section can be summed and placed on that output sample location. The Kirch hoff summation technique for migration incorporates to the process of diffraction summation the amplitude and phase factors described in Section 4.1.
Similarly, prestack time migration can be conceptualized either by way of semi-elliptical superposition using equation (5-33) or diffraction summation over the traveltime surface described by equation (5-32). The traveltime surface, which is shown in Figure 5.3-1a, is known as Cheops' pyramid (Claerbout, 1985). The result of summation of amplitudes over the pyramidal surface is placed at its apex. The question that is of practical importance is how to define the summation paths over this surface.
To consider alternative methods of summation, refer to the traveltime equation (5-32) that describes the pyramidal surface in Figure 5.3-1a, and, first, make the change of variables from depth z z zzz to event time τ τ tau\tauτ in the migrated position by using the relation z = v τ / 2 z = v τ / 2 z=v tau//2z=v \tau / 2z=vτ/2, then rewrite this equation in terms of the event position after migration, which is the lateral coordinate y m y m y_(m)y_{m}ym of the apex of the pyramid
t = τ 2 4 + ( y y m + h ) 2 v 2 + τ 2 4 + ( y y m h ) 2 v 2 . t = τ 2 4 + y y m + h 2 v 2 + τ 2 4 + y y m h 2 v 2 . t=sqrt((tau^(2))/(4)+((y-y_(m)+h)^(2))/(v^(2)))+sqrt((tau^(2))/(4)+((y-y_(m)-h)^(2))/(v^(2))).t=\sqrt{\frac{\tau^{2}}{4}+\frac{\left(y-y_{m}+h\right)^{2}}{v^{2}}}+\sqrt{\frac{\tau^{2}}{4}+\frac{\left(y-y_{m}-h\right)^{2}}{v^{2}}} .t=τ24+(yym+h)2v2+τ24+(yymh)2v2.
Hence, within the context of equation (5-35), the summation involves mapping amplitude at a point on the pyramidal surface with coordinates ( y , h , t ) ( y , h , t ) (y,h,t)(y, h, t)(y,h,t) to the apex with coordinates ( y m , h = 0 , τ ) y m , h = 0 , τ (y_(m),h=0,tau)\left(y_{m}, h=0, \tau\right)(ym,h=0,τ).
Whatever the summation strategy, it may not be desirable to map the amplitudes on the pyramidal surface directly onto the apex of the pyramid. Instead, it is desirable first to collapse the pyramidal surface described by equation (5-35) to a traveltime curve that passes through the apex of the pyramid at y = y m d e y = y m d e y=y_(m)de-y=y_{m} \mathrm{de}-y=ymde scribed by
t = τ 2 + 4 h 2 v 2 t = τ 2 + 4 h 2 v 2 t=sqrt(tau^(2)+(4h^(2))/(v^(2)))t=\sqrt{\tau^{2}+\frac{4 h^{2}}{v^{2}}}t=τ2+4h2v2
As a result, amplitude at a point on the pyramidal surface with coordinates ( y , h , t ) ( y , h , t ) (y,h,t)(y, h, t)(y,h,t) is mapped onto a point with coordinates ( y m , h , τ 2 + 4 h 2 / v 2 ) y m , h , τ 2 + 4 h 2 / v 2 (y_(m),h,sqrt(tau^(2)+4h^(2)//v^(2)))\left(y_{m}, h, \sqrt{\tau^{2}+4 h^{2} / v^{2}}\right)(ym,h,τ2+4h2/v2) on the hyperbolic curve of equation (5-36). Now, you have the opportunity to perform velocity analysis using equation (5-36) and refine the velocity field used in the first summation step. The second step in the summation involves applying NMO correction using equation (5-36), stacking the amplitudes along the offset axis, and placing the result at the apex of the hyperbola of equation (5-36) at time τ τ tau\tauτ and offset h = 0 h = 0 h=0h=0h=0. This apex coincides with the apex of the pyramidal surface with coordinates ( y m , h = 0 , τ ) y m , h = 0 , τ (y_(m),h=0,tau)\left(y_{m}, h=0, \tau\right)(ym,h=0,τ).
The two most obvious choices of summation paths to collapse the pyramidal surface of equation (5-35) to the hyperbolic curve of equation (5-36) are described below:
(a) Summation curves of constant offet: Consider a set of vertical cross-sections of the traveltime pyra-

FIG. 5.3-1. Left column (adapted from Fowler, 1997): The nonzero-ofiset traveltime surface associated with a point scat terer and the various summation trajectories for prestack time migration. Right column: The nonzero-ofset traveltime surfaces as in the left column after DMO correction. See text for details.
mid illustrated in Figure 5.3-1a parallel to the midpoint axis as illustrated in Figure 5.3-1b. Sum the amplitudes along each of the constant-offset tabletop traveltime curves, independently, and place the result for each at the apex A h A h A_(h)A_{h}Ah of the summation curve with coordinates ( y m , h , τ 2 + 4 h 2 / v 2 ) y m , h , τ 2 + 4 h 2 / v 2 (y_(m),h,sqrt(tau^(2)+4h^(2)//v^(2)))\left(y_{m}, h, \sqrt{\tau^{2}+4 h^{2} / v^{2}}\right)(ym,h,τ2+4h2/v2). The summation collapses the pyramidal surface onto the hyperbolic traveltime curve of equation (5-36), which is formed by combining the apex points A h A h A_(h)A_{h}Ah of the constant-offset curves. This hyperbolic traveltime curve is orthogonal to the constant-offset summation curves.
(b) Summation curves of constant tzme: Consider a set of horizontal cross-sections of the traveltime pyramid as illustrated in Figure 5.3-1c (Bancroft and Geiger, 1994; Bancroft et al., 1997). Sum
the amplitudes along each of the constant-time curves, independently, and place the result for each at A h A h A_(h)A_{h}Ah on the summation curve with coordinates ( y m , h , τ 2 + 4 h 2 / v 2 ) y m , h , τ 2 + 4 h 2 / v 2 (y_(m),h,sqrt(tau^(2)+4h^(2)//v^(2)))\left(y_{m}, h, \sqrt{\tau^{2}+4 h^{2} / v^{2}}\right)(ym,h,τ2+4h2/v2). The summation collapses the pyramidal surface onto the hyperbolic traveltime curve of equation (5-36), which is formed by combining the points A h A h A_(h)A_{h}Ah of the constant-time curves. This hyperbolic traveltime curve is orthogonal to the constant-time summation curves.
The pyramidal surface described by equation (535 ) is converted by DMO correction to a hyperboloid of revolution as illustrated in Figure 5.3-1d and described by the following equation (Gardner et al., 1986):
t = τ 2 + 4 ( y y m ) 2 v 2 + 4 h 2 v 2 t = τ 2 + 4 y y m 2 v 2 + 4 h 2 v 2 t=sqrt(tau^(2)+(4(y-y_(m))^(2))/(v^(2))+(4h^(2))/(v^(2)))t=\sqrt{\tau^{2}+\frac{4\left(y-y_{m}\right)^{2}}{v^{2}}+\frac{4 h^{2}}{v^{2}}}t=τ2+4(yym)2v2+4h2v2
As for equation (5-35), within the context of equation ( 5 37 ) ( 5 37 ) (5-37)(5-37)(537), the summation required by prestack time migration involves mapping amplitude at a point on the hyperboloidal surface with coordinates ( y , h , t ) ( y , h , t ) (y,h,t)(y, h, t)(y,h,t) to the apex with coordinates ( y m , h = 0 , τ ) y m , h = 0 , τ (y_(m),h=0,tau)\left(y_{m}, h=0, \tau\right)(ym,h=0,τ).
Again, it is desirable first to collapse the hyperboloidal surface described by equation (5-37) to a traveltime curve that passes through the apex of the hyperboloid at y = y m y = y m y=y_(m)y=y_{m}y=ym described by equation (5-36). As a result, amplitude at a point on the hyperbolodial surface with coordinates ( y , h , t ) ( y , h , t ) (y,h,t)(y, h, t)(y,h,t) is mapped onto e point with coordinates ( y m , h , τ 2 + 4 h 2 / v 2 ) y m , h , τ 2 + 4 h 2 / v 2 (y_(m),h,sqrt(tau^(2)+4h^(2)//v^(2)))\left(y_{m}, h, \sqrt{\tau^{2}+4 h^{2} / v^{2}}\right)(ym,h,τ2+4h2/v2) on the hyperbolic curve of equation (5-36). As for the pyramidal surface, the second step in the summation involves applying NMO correction, stacking the amplitudes along the offset axis, and placing the result at the apex of the hyperbola of equation (5-36) at time τ τ tau\tauτ and offset h = 0 h = 0 h=0h=0h=0. This apex coincides with the apex of the hyperboloidal surface with coordinates ( y m , h = 0 , τ ) y m , h = 0 , τ (y_(m),h=0,tau)\left(y_{m}, h=0, \tau\right)(ym,h=0,τ).
For constant offset h h hhh, rewrite equation (5-37) in the following form:
t 2 τ 2 + 4 h 2 / v 2 ( y y r n ) 2 h 2 + v 2 τ 2 / 4 = 1 t 2 τ 2 + 4 h 2 / v 2 y y r n 2 h 2 + v 2 τ 2 / 4 = 1 (t^(2))/(tau^(2)+4h^(2)//v^(2))-((y-y_(rn))^(2))/(h^(2)+v^(2)tau^(2)//4)=1\frac{t^{2}}{\tau^{2}+4 h^{2} / v^{2}}-\frac{\left(y-y_{r n}\right)^{2}}{h^{2}+v^{2} \tau^{2} / 4}=1t2τ2+4h2/v2(yyrn)2h2+v2τ2/4=1
Note that, as a result of the transformation from the pyramidal surface to the hyperboloidal surface, the table-top summation curves at constant offset are transformed to hyperbolic curves described by equation (538).
For constant time t t ttt, rewrite equation (5-37) in the foilowing form:
( y y π ) 2 + h 2 = v 2 4 ( t 2 τ 2 ) y y π 2 + h 2 = v 2 4 t 2 τ 2 (y-y_(pi))^(2)+h^(2)=(v^(2))/(4)(t^(2)-tau^(2))\left(y-y_{\pi}\right)^{2}+h^{2}=\frac{v^{2}}{4}\left(t^{2}-\tau^{2}\right)(yyπ)2+h2=v24(t2τ2)
Note that the constant-time curves of the pyramidal surface are transformed to circles described by equation (5-39).
So, for the constant-offset and constant-time summation techniques described above, we may consider substituting the pyramidal surface with the hyperboloidal surface in the following manner:
(a) Summation curves of constant offset: Consider a set of vertical cross-sections of the traveltime hyperboloid parallel to the midpoint axis. Sum the amplitudes along each of the constant-offset hyperbolic traveltime curves of equation (5-38) as illustrated in Figure 5.3-1e, independently, and place the result for each at the apex A h A h A_(h)A_{h}Ah of the summation curve with coordinates ( y m , h , τ 2 + 4 h 2 / v 2 y m , h , τ 2 + 4 h 2 / v 2 (y_(m),h,sqrt(tau^(2)+4h^(2)//v^(2)):}\left(y_{m}, h, \sqrt{\tau^{2}+4 h^{2} / v^{2}}\right.(ym,h,τ2+4h2/v2 ). The summation collapses the hyperboloidal surface onto the hyperbolic traveltime curve of equation (536), which is formed by combining the apex points A h A h A_(h)A_{h}Ah of the constant-offet curves. This hyperbolic traveltime curve is orthogonal to the constantoffset summation curves.
(b) Summation curves of constant tome: Consider a set of horizontal cross-sections of the traveltime hyperboloid (Gardner et al., 1986). Sum the amplitudes along each of the constent-time circles of equation (5-39) as illustrated in Figure 5.3-1f, independently, and place the result for each at A h A h A_(h)A_{h}Ah on the summa tion curve with coordinates ( y m , h , ( v / 2 ) t 2 τ 2 ) y m , h , ( v / 2 ) t 2 τ 2 (y_(m),h,(v//2)sqrt(t^(2)-tau^(2)))\left(y_{m}, h,(v / 2) \sqrt{t^{2}-\tau^{2}}\right)(ym,h,(v/2)t2τ2). The summation collapses the hyperboloidal surface onto the hyperbolic traveltime curve of equation (536), which is formed by combining the points A h A h A_(h)A_{h}Ah of the constant-time circles. This hyperbolic traveltime curve is orthogonal to the constant-time summation curves.

DMO Correction and Common-Offset Migration

As stated earlier, a desired workfiow for prestack time migration incorporates a step for updating the initial velocity field that was used to migrate the data. Specifically, we want to create common-reflection-point (CRP) gathers from prestack time migration and use them to perform conventional velocity aualysis based on the hyperbolic moveout assumption. Finally, we can apply normal-moveout correction to the CRP gathers using the updated velocity field and stack them along to obtain the prestack time-migrated section.
In this section, we shall follow a most popular sequence for prestack time migration based on a practical variation of the constant-offset summation technique described above (Marcoux et al., 1987).
(a) Perform velocity analysis at sparse intervals and pick just a few velocity functions with minimal dip effects.
(b) Apply NMO correction using these flat-event velocities.
(c) Sort data to common-offset sections and apply DMO correction.
(d) Migrate each of the common-offset sections using your favorite zero-offset migration algorithm (Chapter 4) and the velocity field based on the flatevent velocity picks from step (a).
(e) Sort the migrated common-offset data back to CMP gathers, and apply inverse NMO correction using the flat-event velocities from step (a).
(f) Perform velocity analysis at frequent intervals as needed to derive an optinum stacking velocity field.
(g) Apply NMO correction using the optimum stacking velocity field.
(h) Stack the data and perform inverse migration (equivalent to 2-D zero-offset wavefield modeling) using the velocity field from step (d).
(i) Finally, remigrate the result from step (h) using the updated velocity field from step (f).
This sequence differs from the constant-offset summation procedure for prestack time migration (Figure 5.31e) in one respect, only. In case of the latter, step (e) precedes step (d). Although this is more plausable, in practice, the two procedures yield comparable results.
Consider a zero-offset section that contains a set of pulses at 500 m s 500 m s 500-ms500-\mathrm{ms}500ms intervals placed on the center trace as shown in Figure 5.3-2a (left column). Now, assume that this same section represents a common-offset section with 1000 m 1000 m 1000-m1000-\mathrm{m}1000m offset. Apply DMO correction to this section to obtain the section in Figure (5.3-2b, left column). Repeat the same exercise by labeling the input section with pulses (Figure 5.3-2a, left column) as a common-offset section with 2000 m 2000 m 2000m2000 \mathrm{~m}2000 m offset and apply DMO correction to get the section in Figure 5.3-2c (left column). Repeat this exercise once more with an offet value of 3000 m 3000 m 3000m3000 \mathrm{~m}3000 m to get the section in Figure 5.3-2d (left column). The DMO-corrected common-offet sections shown on the left column of Figure 5.3-2 represent the DMO impulse responses for zero-offset, 1000 m , 2000 m 1000 m , 2000 m 1000-m,2000-m1000-\mathrm{m}, 2000-\mathrm{m}1000m,2000m and 3000 m 3000 m 3000-m3000-\mathrm{m}3000m offset cases.
Following the sequence described above, now, treat each of the DMO-corrected sections on the left column in Figure 5.3-2 as zero-offset sections and migrate them using a zero-offset constant-velocity algorithm. Results are shown on the right, column of Figure 5.3-2. Migration of the section in Figure 5.3-2a (left column) yields a set of concentric circles (right column). This migrated section represents the zero-offset migration impulse response, and its circular trajectories are defined by equation (5-34a). Migrations of the sections in Figure 5.3 2 b , c 2 b , c 2b,c2 \mathrm{~b}, \mathrm{c}2 b,c, (left column) yield a set of elliptical trajectories (right column). These migrated sections represent the nonzero-offset (prestack) migration impulse responses, and their elliptical trajectories are defined by equation (5-33).
Once again, consider the section in Figure 5.3-2a (left column) as a common-offset section with assigned offsets values of 0 , 1000 , 2000 0 , 1000 , 2000 0,1000,20000,1000,20000,1000,2000, and 3000 m 3000 m 3000m3000 \mathrm{~m}3000 m. If we were to have migrated each of these common-offset sections directly using a prestack migration algorithm in lieu of first applying DMO correction then migrating using a zero-offset rigration algorithm, we would have obtained the same results as those shown in Figure 5.3-2 (right column). Figure 5.3-3 shows the DMO impulse responses on the left column of Figure 5.3-2 superimposed on the migration impulse responses on the right column of the same figure. For the zero-offset case (Figure 5.3-3a), the DMO impulse response has zero aperture, while for the nonzero-offset case the lateral excursion of the DMO impulse response increases with offset and at shallow times. But, the lateral excursion of the DMO impulse response always is much less than that of the migration impulse response.
This experiment demonstrates that zero-offset migration of DMO-corrected common-offset data is equivalent to prestack migration of nonzero-offet data. Of course, this equivalence is largely valid only within the bounds of velocity variations judged to be acceptable for time migration. In this section, we shall apply the sequence outlined above to two common cases of conflicting dips with different stacking velocities - salt flanks and fauit planes.

Salt Flanks

DMO correction maps moveout-corrected commonoffset data to zero-offset. As a direct result of this aspect of DMO correction, the process decouples commonoffset sections, thus enabling treatment of each of the common-offset sections, independently. A DMOcorrected common-offset section can be considered a replica of a zero-offset section, and therefore, can be migrated using a method applicable to zero-offset wavefield.
(a) Starting with input prestack data in midpoint, offset and two-way event time in the unmigrated position, apply NMO correction using flat-event velocities. These are picked from velocity spectra computed sparsely along the line. Figure 5.3-4 shows
FIG. 5.3-2. Left column: Impulse response of a frequency-wavenumber dip-moveout operator with source-receiver offsets (a) 0 m 7 0 m 7 0m_(7)0 \mathrm{~m}_{7}0 m7 (b) 1000 m 1000 m 1000m1000 \mathrm{~m}1000 m, (c) 2000 m 2000 m 2000m2000 \mathrm{~m}2000 m, and (d) 3000 m 3000 m 3000m3000 \mathrm{~m}3000 m. Right column: Zero-offset migrations of the sections in the left column. These sections are equivalent to the results one would obtain from presatck migrations of common-offset sections with source-receiver offsets (a) 0 m 1 0 m 1 0m_(1)0 \mathrm{~m}_{1}0 m1 (b) 1000 m 1000 m 1000m1000 \mathrm{~m}1000 m, (c) 2000 m 2000 m 2000m2000 \mathrm{~m}2000 m, and (d) 3000 m 3000 m 3000m3000 \mathrm{~m}3000 m, hence can be considered as impulse response of a prestack time migration algorithm.
FIG. 5.3-3. The impulse response of a dip-moveout operator (left column in Figure 5.3-2) and prestack time migration operator (right column in Figure 5.3-2) superimposed. The source-receiver offsets for the input common-offet sections are (a) 0 m 0 m 0m0 \mathrm{~m}0 m, (b) 1000 m 1000 m 1000m1000 \mathrm{~m}1000 m, (c) 2000 m 2000 m 2000m2000 \mathrm{~m}2000 m, and (d) 3000 m 3000 m 3000m3000 \mathrm{~m}3000 m.
FIG. 5.3-11. Stack of the gathers as in Figure 5.3-10.
FIG. 5.3-12. Inverse migration of the stack shown in Figure 5311 using the velocity field shown in Figure 5 2-9b.
FIG. 5.3-13. Migration of the stack shown in Figure 5.3-12 using the velocity field shown in Figure 5.3-9b.
three common-offset sections associated with the data as in Figure 5.2 3 5.2 3 5.2-35.2-35.23 with offsets 78.5 m , 1078.5 78.5 m , 1078.5 78.5m,1078.578.5 \mathrm{~m}, 1078.578.5 m,1078.5 m m m\mathrm{m}m, and 2078.5 m 2078.5 m 2078.5m2078.5 \mathrm{~m}2078.5 m, following NMO correction.
(b) Apply DMO correction to each common-offset section (Figure 5.3-5).
(c) Following DMO correction, each common-offset section is assumed to be a replica of zero-offset section, and thus, can be migrated using a zero-offet migration algorithm. How could these commonoffset sections be migrated before we even know migration velocities? The conjecture is that a smoothed stacking velocity field (Figure 5.2-9a) can be used to perform the migrations of commonoffset data. As a result, events will be moved spatially to locations that are between their unmigrated and correctly migrated positions, but fairly close to the latter. Figure 5.3-6 shows three selected common-offset sections as in Figure 5.3-5 after migration.
(d) Sort the migrated common-offset sections into CMP gathers (Figure 5.3-7). Events on these gathers are now assumingly close to correct subsurface positions after migration. Note the presence of residual moveout on some events, which suggest errors in the velocity field used for migration.
(e) Apply inverse NMO correction and perform velocity analysis. Although event positioning in the spatial sense will not be affected by this velocity analysis, use of updated velocities will improve the stacking of the CMP gathers after migration. Figure 5.3-8 shows selected CMP gathers as in Figure 5.3-7 after inverse moveout correction, and Figure 5.3-9b shows the migration velocity field derived from the analysis of such gathers. For comparison, the DMO velocity field using the DMO-corrected gathers as in Figure 5.2-5 is shown in Figure 5.3-9a.
(f) Apply NMO correction (Figure 5.3-10) using the migration velocity field (Figure 5.3-9b) and stack the migrated data (Figure 5.3-11). Keep in mind that migration actually has been done using an initial estimate for the velocity field (Figure 5.2-9a).
(g) To obtain the migrated section with the updated velocity field (Figure 5.3-9b), we can follow two alternative approaches. First, compute the residual velocity field (Section D.8) from the initial (Figure 5.2-9a) and updated (Figure 5.3-9b) velocity fields, and use it to perform residual migration (Section 4.5) for which the input is the stacked section from step (f). The residual migration is acceptable provided the initial velocity field varies vertically, only, and the vertical variation in velocity is expressed with moderate gradients. The second approach involves first simulation of an unmigrated stacked section by forward modeling (inverse migration) of the migrated section obtained in step (f) (Figure
5.3-11) using the initial velocity field (Figure 5.29a). The modeled section is shown in Figure 5.312 and may be treated as equivalent to the unmigrated stacked section. The next step involves migrating the modeled section using the updated velocity field (Figure 5.3-9b). The final result of prestack time migration sequence described above is shown in Figure 5.3-13.

Fault Planes

Figure 5.3-14 shows a portion of a conventional CMP stack without DMO correction. Steeply dipping events represent diffractions and fault-plane reflections. Because no DMO correction has bcen applied, these events have not been preserved with as much strength as the gently dipping reflections. As a result, migration of this conventional CMP stack yields an inadequate definition of the intensive fault pattern (Figure 5.3-15).
We shall use the data set shown in Figure 5.3-14 to bring together and review all we learned in this chapter about DMO correction and prestack time migration. To begin with, examine the dip effect on stacking velocities. Based on velocity analysis at CMP location A A AAA, a velocity function appropriate for gently dipping reflections was picked. By setting this as the center function and using a range of lower and higher percents of this function, a set of multivelocity-function stack panels shown in Figures 5.3-16 and 5.3-17 was created over a CMP range that includes a zone with gently dipping reflections and steeply dipping events. Note that the gently dipping reflections stack best with 100 percent of the center function (Figure 5.3-16) and the steeply dipping events stack best with 120 percent of the center function (Figure 5.3-17). This 20 percent difference in stacking velocities between the gently dipping and steeply dipping reflections is primarily stems from the dip effect. After DMO correction, both gently dipping and steeply dipping events stack best with 100 percent of the center function (Figures 5.3-18 and 5.3-19).
Removal of the dip effect on stacking velocities by DMO correction is further demonstrated by velocity analysis before and after DMO correction. Figure 5.320 shows the CMP gather and its velocity spectrum at location A as in Figure 5.3-14. At first impression, the velocity spectrum may suggest the presence of multiples. Nevertheless, there actually exist two sets of picks - the low-velocity picks as shown in Figure 5.3-21 associated with the gently dipping reflections, and the high-velocity picks as shown in Figure 5.3-22 associated with the steeply dipping fault-plane reflections and possibly diffractions. By applying NMO correction to the
FIG. 5.3-20. CMP gather (left) and the velocity spectnam (right) at location A A AAA as in Figure 5.3-16 before DMO correction.
FIG. 5.3-21. CMP gather (left) and the velocity spectrum (right) as in Figure 5.3-20, with moveout correction applied to the data using the velocity function that is posted on the spectrum. This velocity function is appropriate for the nearly fiat events associated with the sedimentary strata.
FIG. 5.3-22. CMP gather (left) and the velocity spectrum (right) as in Figure 5.3-20, with moveout correction applied to the data using the velocity function that is posted on the spectrum. This velocity function is appropriate for the steeply dipping events associated with the fault-plane reflections.
FIG. 5.3-23. CMP gather (left) and the velocity spectrum (right) at location A A AAA as in Figure 5.3-18 after DMO correction.
FIG. 5.3-24. CMP gather (left) and the velocity spectrum (right) as in Figure 5.3-23, with the velority function of the gently flit events as in Figure 5.3-21 posted on the spectrum.
FIG. 5.3-25. CMP gather (left) and the velocity spectrum (right) as in Figure 5.3-23, with the velocity function of the sterply dipping events as in Figure 5.3-22 pusted on the spectrum.
FIG. 5.3-26. CMP gather (left) and the velocity spectrum (right) as in Figure 5.3-23, with mownout correction applied to the data using the DMO-corrected velocity function that is posted on the spectrum.
FIG. 5.3-29. Purtions of three common-offset sections that coincide with the CVS panels shown in Figure 5.3-16 before DMO correction. Ofsets are, from left to right, 500,1500 , and 2500 m 2500 m 2500m2500 \mathrm{~m}2500 m.
FIG. 5.3-30. Portions of three common-offset sections that coincide with the CVS panels shown in Figure 5.3-18 after DMO correction. Offsets are, from left to right, 500,1500 , and 2500 m 2500 m 2500m2500 \mathrm{~m}2500 m.
FIG. 5.3-31. Portions of three common-offset sections that coincide with the CVS panels shown in Figure 5.3-18 after DMO correction and common-offset migration. Offsets are, from left to right, 500,1500 , and 2500 m 2500 m 2500m2500 \mathrm{~m}2500 m.
FIG. 5.3-32. CMP gather (left) and the velocity spectrum (right) at locatiun A A AAA as in Figure 5.3-18, but after DMO correction and common-offset migration. The velocity function poeted on the spectrum is the sams as in Figure 5.3-26 derived from the data after DMO correction.
FIG. 5.3-33. CMP gather (left) and the velocity spectrum (right) as in Figure 5.3-32 after DMO correction, common-offset migration and inverse NMO correction using the velocity function pusted on the spectrum. This velocity function is the same as in Figure 5.3-26 derived frum the dats after DMO currection.
FIG. 5.3-34. CMP gather (left) and the velocity spectrum (right) as in Figure 5.3-33 after DMO correction, commun-oflset migration inverse NMO correction using the velocity function posted on the spertrum in Figure 5.3-33, and finally, NMO correction using the velocity function posted on the spectrum shown bere and derived from the gather shown bere after DMO correction and commun-offset migration.
CMP gather using the Iow-velocity function in Figure 5.3-21, events that correspond to the gently dipping reflections are flattened whereas events that correspond to the steeply dipping reflections and diffractions are overcorrected. By applying NMO correction to the CMP gather using the high-velocity function in Figure 5.322 , events that correspond to the steeply dipping reflections are flattened whereas events that correspond to the gently dipping reflections and diffractions are undercorrected.
The velocity spectrum at the same analysis location as for Figure 5.3-20 after the application of DMO correction shows a single, unambiguous velocity trend as shown in Figure 5.3-23. We have resolved the dip effect on stacking velocities and thus eliminated the multiple number of velocity picks as in Figure 5.3-20. As a result of the partial migration effect of DMO correction, energy is moved from one CMP location to another. Consequently, reflection-point smearing is removed and events on CMP gathers improvise a horizontally layered earth model.
For comparison, the low-velocity function associated with the gently dipping reflections in Figure 5.321 is superimposed on the velocity spectrum after DMO correction in Figure 5.3-24. As anticipated, the picks implied by the velocity spectrum after DMO correction are fairly close to the velocity function associated with the gently dipping reflections. Similarly, the high-velocity function associated with the steeply dipping reflections and diffractions in Figure 5.3-22 is superimposed on the velocity spectrum after DMO correction in Figure 5.325 . In this case, the picks implied by the velocity spectrum after DMO correction are significantly lower than the velocity picks associated with the steeply dipping reflections.
The velocity analysis is repeated after DMO correction as shown in Figure 5.3-26. The picked velocities are then used to stack the data (Figure 5.3-27). Compare with the conventional CMP stack in Figure 5.3-14 and note that the DMO stack shown in Figure 5.3-27 has preserved the events with conflicting dips with different stacking velocities - the gently dipping reflections with the velocity function posted in Figure 5.3-21 and the steeply dipping fault-plane reflections with the velocity function posted in Figure 5.3-22. The resulting migrated section in Figure 5.3-28 shows a superior image of the fault blocks as compared to the migrated section without DMO correction (Figure 5.3-15).
For prestack time migration, we shall follow the same sequence as for the salt-flank data set.
(a) Sort the moveout-corrected CMP gathers to common-offset sections. Figure 5.3-29 shows portions of three selected common-offset sections. Note the presence of steeply dipping fault-plane reflections. Without DMO correction, CMP stacking fails to preserve these reflections as shown in Figure 5.3-14.
(b) Apply DMO correction to each common-offset section. Figure 5.3-30 shows portions of the three selected common-offset sections as in Figure 5.329 after DMO correction. Note the steeply dipping fault-plane reflections. With DMO correction, CMP stacking preserves these reflections as shown in Figure 5.3-27.
(c) Following DMO correction, each common-offset section is assumed to be a replica of a zero-offset section, and thus, can be migrated using a zerooffset migration algorithm. In this case, a single, vertically varying velocity function was used to migrate the NMO- and DMO-corrected commonoffset sections. Figure 5.3.31 shows portions of the three selected common-offset sections as in Figure 5.3-30 after common-offset migration.
(d) Sort the migrated common-offset sections into CMP gathers. Events on these gathers are now assumingly close to correct subsuriace positions after migration. Figure 5.3-32 shows a CMP gather after common-offset migration.
(c) Apply inverse NMO correction using the velocities picked before DMO correction and perform velocity analysis. The velocity spectrum computed from migrated data is shown in Figure 5,3-32 with the DMO velocities posted on it for comparison. The CMP gather after inverse NMO correction using the velocity function shown in Figure 5.3-32 is shown in Figure 5.3-33.
(f) Apply NMO correction using the velocity picks after migration (Figure 5.3-34). The velocity field derived from the post-migration velocity picks as in Figure 5.3-34 is shown in Figure 5.3-35, and the stack based on this velocity field is shown in Figure 5.3-36. This stack indeed is equivalent to prestack time-migrated section. Note that, however, common-offset migration actually was done using a single, vertically varying velocity function as in step (c).
(g) To obtain the migrated section with the velocity field (Figure 5.3-35) derived after common-offset migration, first perform inverse migration of the resulting stack from step (f) using the same velocity function as in step (c) to obtain a zero-offset section equivalent to en unmigrated stack as shown in Figure 5.3-37. Then, migrate this zero-offset section using the post-migration velocity field shown in Figure 5.3-35 to obtain the final result from prestack time migration sequence described here (Figure 5.3-38).

Common-Reflection-Point versus Common-Reflection-Surface Stacking

Conventional stacking is based on the notion of a common midpoint (CMP) and migration is based on the notion of a common reflection point (CRP). In both cases, we assume that reflections are represented by hyperbolas and reflectors are represented by points. Consider a seismic line from the Alberta Plains of Western Canada. The subsuriace is just as flat as the surface over which you have recorded the data. When stacking the data, you can almost picture summing of the amplitudes in a CMP gather over all offsets along a hyperbolic trajectory associated with a zero-offset time and the resulting stacked amplitude being placed at a point reflector where the CMP raypaths converge conveniently. When migrating the stacked data, again, you sum the amplitudes along a hyperbolic trajectory and place the result at the apex of the hyperbola. You conveniently associate the apex of the latter hyperbola with a point diffractor situated on the reflector. Whether it is a reflection hyperbola associated with a point reflector or a diffraction hyperbola associated with a point diffractor, the process of stacking and migrating the data involves summation of amplitudes along hyperbolas and placing the resulting sum to a point in the subsurface.
Now consider a seismic line from the Alberta Foothills where the cascaded flanks of the Rocky Mountains rise steeply. The subsurface is just as steep as the surface over which you have recorded the data. A diffractor still is a point whether it is in the Plains or in the Foothills, and you can still think of diffractions as hyperbolas so long as they are situated below a simple overburden. Fortunately, you can also think of reflections as hyperbolas. No longer, however, can you associate a reflection hyperbola on your CMP gather with a single point reflector; instead, you have reflection points dispersed along the reflector (Section E.1). This is when you have to introduce DMO correction to account for the reflection-point dispersal (Section 5.1). Once the reflection-point dispersal is removed, the resulting stack can be considered equivalent to a zerooffset section which you can migrate, again, using the hyperbolic summation rule. Thus you have been able to overcome the Foothills problem of steeply dipping events.
Finally, consider a seismic line from the Canadian Thrust Belt west of the Foothills. The subsurface is just as complex as it appears on the surface over which you have recorded the data. A diffractor situated below the complex overburden structure caused by the overthrust tectonics stays as a point; no longer, however, can you associate it with a hyperbolic traveltime. Instead, when migrating the data, you have to deal with a complex, distorted traveltime trajectory. And neither can you associate the reflections with hyperbolic traveltimes. Instead, when stacking the data, you have to deal with a nonhyperbolic moveout trajectory associated with many reflection points scattered around in the subsurface (de Bazelaire, 1988).
So the simple hyperbolic and point rules of the Plains or the Foothils are no longer applicable in the Thrust Belt. To overcome the first problem - migration of data in the presence of strong lateral velocity variations associated with complex overburden structures in the Thrust Belt, you may decide to do the imaging in depth (Section 8.0) instead of imaging in time (Section 4.0). Earth imaging in depth requires earth modeling in depth (Section 9.0) - a challenge much higher than the imaging itself. To overcome the second problem stacking of data with nonhyperbolic moveout, you may combine it with the first problem and pursue a rigorous solution by doing the imaging not just in depth but also before stack.
Note that, insofar as stacking and imaging in time or in depth, we choose to map events to commonreflection points. By way of DMO correction, we map events to common-reflection points in their unmigrated positions. Similarly, by way of prestack time migration, we map events to common-reflection points in their m i m i mim imi grated posstions. De Bazelaire (1988) and Gelchinsky (1988) pointed out that, rather than associating the recorded data with common-reflection ponts, we should associate the recorded data with common-reflection surfaces. As such, when stacking the data, rather than constricting the summation of amplitudes to within a single CMP gather, data may be focused to a commonreflection surface (CRS) using multiple shots and receivers (Gelchinsky, 1988; and Höcht, 1998).
The theory and practice of the CRS stacking method (Gelchinsky, 1988; Tygel et al., 1997; Gelchinsky et al., 1999a, b; Höcht, 1998; Berkovitch et al, 1998; Landa et al., 1999) suggest that it is indeed related to prestack time migration when the medium velocities are judged to be within the acceptable bounds for the latter. The CRP gathers from prestack time migration and the CRS gathers both are created by including in the surnmation aperture multiple numbers of CMP gathers. The difference is that the CRP gathers are associated with events in their migrated positions, whereas the CRS gathers are associated with events in thcir unmigraled positions. So, migration of the CRS stack should resemble the section from prestack time migration.
FIG. 5+3-39. A common-reflection-surface (CRS) stack. (Data courtesy Saudi Aramco_)

8686 8989 9292 9595 9898 10201 8686 8989 9292 9595 9898 10201 {:[8686,8989,9292,9595,9898,10201]:}\begin{array}{llllll}8686 & 8989 & 9292 & 9595 & 9898 & 10201\end{array}8686898992929595989810201

FIG. 5.3-40. Migration of the common-refection-surface (CRS) stack shown in Figure 5.3-39.
FIG. 5.3-41. A common-reflection-point (CRP) stack of the data as in Figure 5.3-40 derived from prestack time migration.

10001

FIG. 5.3-43. A common-reflection-point (CRP) gather associated with the CRP stack shown in Figure 5.3-41.
(a)
(b)
(c)
FIG. 5.4-1. (a) A CMP gather containing a single reflector in a constant-velocity medium; (b) velocity spectrum derived by migrating the CMP gather using a number of constant velocities and displaying the zero-offset trace from each migration; (c) velocity spectrum derived by NMO correcting and stacking the CMP gather using the same range of constant velocities as in (b). Each trace in (b) is a zerooffset trace, while each trace in (c) is a CMP stacked trace.
Figure 5.3-39 shows a CRS stack from an area with low-relief structures. The field data were recorded with 240 -fold coverage. For CRS processing, the negative offsets were discarded and the near one-half of the positive offsets were kept; thus the reduced data used to create the CRS stack had 60 -fold coverage. For prestack time migration, the original 240 -fold data were first reduced to 60 -fold by partial stacking. The migrated CRS stack shown in Figure 5.3-40 is comparable to the CRP stack derived from prestack time migration shown in Figure 5.3-41. In the present example, five CMP gathers were used to create one CRS gather with 300 traces as shown in Figure 5.3-42. The 60-fold CRP gather at the same location as for the CRS gather of Figure 5.3-42 is shown in Figure 5.3-43.
Practical refinements to various approaches to CRS stacking and imaging, including extensions to 3 D 3 D 3-D3-\mathrm{D}3D, are under current investigation. As to what extent the technique will be applied routinely to seismic data remains to be seen.

5.4 MIGRATION VELOCITY ANALYSIS

Velocity estimation, CMP stacking, and migration generally are considered independent processes. However, they all have a common theoretical base the scalar wave equation. Solution of this equation allows downward extrapolation of a seismic wavefield recorded at
(a)
(b) (c)
FIG.5.4-2. Migrations of the CMP gather in Figure 5.4la using velocities that are (a) lower than the medium, (b) the same as the medium, and (c) higher than the medium velocity. (Note the wraparound effect in (c) that is inherent to the phase-shift method used in this analysis.)
the earth's surface. In turn, downward extrapolation provides a basis for CMP stacking and migration (Clayton, 1978; Yilmaz and Claerbout, 1980). Because the processes of CMP stacking and migration require ve locity information, they also can be used to obtain a velocity estimate (Taner and Koehler, 1969; Gardner et al., 1974).
For example, consider the problem of conventional velocity estimation for stacking. Figure 5.4 1 5.4 1 5.4-15.4-15.41 a shows a CMP gather over a single horizontal reflector. Select a constant velocity, apply NMO correction, and stack the traces in the gather. Next, place this stack trace onto the plane of velocity versus two-way zero-offset vertical time ( v , τ ) ( v , τ ) (v,tau)(v, \tau)(v,τ) as shown in Figure 5.4-1c. By stacking the gather with different constant velocity values, the entire ( v , π ) ( v , π ) (v,pi)(v, \pi)(v,π) plane is filled with stacked amplitudes. (In this section, the variable τ τ tau\tauτ is used specifically to define the vertical two-way zero-offset time, τ = 2 z / v τ = 2 z / v tau=2z//v\tau=2 z / vτ=2z/v.)
We now consider the migration process. For a horizontally stratified earth, as in Figure 5.4-1a, we cannot distinguish between a CMP gather and a common-shot gather (CSG). Moreover, since a CSG is a true wavefield created by a single shot and recorded by many receivers, it seems reasonable that the CMP gather in Figure 5.4-1 a can be migrated by treating the reflection hyperbola as if it were a diffraction hyperbola. Assuming there is no velocity information, we migrate with various trial constant velocities and evaluate the results. Figure 5-4-2 shows three different attempts at migrating the CMP gather of Figare 5.4-1a. In one attempt (Figure 5.4-2a), too low a velocity was used; hence, the event was undermigrated. In another attempt, too high a velocity was used and the event was overmigrated (Figure
FIG. 5.4-3. A flowchart of an algorithm for prestack Stolt. migration.
5.4-2c). When the velocity in the migration equals the medium velocity, we expect the diffraction hyperbola to collapse to its apex, which is at the zero-offset trace (Figure 5.4-2b).
What is the implication of this experiment for velocity estimation? Since the correct velocity produces a well-compressed event at the apex of the hyperbola, this velocity can be estimated by evaluating the quality of focusing at zero offset. To evaluate focusing, we pick out the zero-offset traces from the various attempts at migration with different velocities and place them side by side. This produces a display of velocity versus twoway zero-offset time as shown in Figure 5.4-1b.
When Figures 5.4:1b and 5.4-1 c are compared, an almost identical character is noted. The resolution of velocity information obtained in the two approaches is equally degraded by data limitations such as maximum source-to-receiver offset and the absence of short-offset traces.
No distinct difference exists between migration and stacking velocity when the subsurface medium is horizontally layered as in Figure 5.4-1. However, for dipping reflectors, the two types of velocity differ. Stacking velocity is sensitive to the dip of the reflecting interface (Section C.3), while, in theory, migration velocity is the medium velocity independent of dip. Therefore, for seismic migration, we must use a velocity field that is corrected for dips present in the data. As a result, any procedure that obtains velocities suitable for migration must use data from a number of neighboring CMP gathers.
Migration velocity analysis can be formulated in much the same way as stacking velocity analysis. To estimate stacking velocities (Chapter 3), in principle, we
FIG. 5.4-4. A flowchart of an algorithm for common-offset migration of DMO-corrected data.
apply moveout correction to a CMP gather and stack the traces in the gather using a range of constant velocities. Results can be used for velocity determination either in the form of a set of velocity spectra at selected locations along the line or a set of constant-velocitystack (CVS) panels. To estimate migration velocities, in principle, we migrate prestack data using a range of constant velocities and output selected gathers in their migrated positions or constant-velocity migration (CVM) panels. The key difference between stacking velocity estimation and migration velocity estimation is that the former only requires individual CMP gathers, whereas the latter requires prestack data set in its entirety. The reason for this is that the processes of moveout correction and stacking are confined to within a CMP gather, while the process of migration moves energy spatially from one CMP location to another.

Prestack Stolt Migration

The first method for migration velocity analysis that we shall review is based on migrating prestack data using a range of constant velocities and creating constantvelocity migration (CVM) panels (Shurtleff, 1984). Since migrations are performed using constant velocities, an appropriate choice for the algorithm would be prestack frequency-wavenumber migration (Section E.6). A flowchert for the CVM approach for migration velocity analysis is shown in Figure 5.4-3.
If the medium velocity is constant, then migration can be expressed as a direct mapping (Stolt, 1978) from temporal frequency ω ω omega\omegaω to vertical wavenumber k z k z k_(z)k_{z}kz (Section E.6). The equation for Stolt mapping is
P ( k y , k h , k z , t = 0 ) = [ v 2 k z 2 k y 2 k h 2 ( k z 2 + k y 2 ) ( k z 2 + k y 2 ) ] × P [ k y , k h , 0 , v 2 k z ( k z 2 + k y 2 ) ( k z 2 + k h 2 ) ] P k y , k h , k z , t = 0 = v 2 k z 2 k y 2 k h 2 k z 2 + k y 2 k z 2 + k y 2 × P k y , k h , 0 , v 2 k z k z 2 + k y 2 k z 2 + k h 2 {:[P(k_(y),k_(h),k_(z),t=0)=[(v)/(2)(k_(z)^(2)-k_(y)^(2)k_(h)^(2))/(sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(y)^(2))))]],[ xx P[k_(y),k_(h),0,(v)/(2k_(z))sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(h)^(2)))]]:}\begin{aligned} & P\left(k_{y}, k_{h}, k_{z}, t=0\right)= {\left[\frac{v}{2} \frac{k_{z}^{2}-k_{y}^{2} k_{h}^{2}}{\sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{y}^{2}\right)}}\right] } \\ & \times P\left[k_{y}, k_{h}, 0, \frac{v}{2 k_{z}} \sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{h}^{2}\right)}\right] \end{aligned}P(ky,kh,kz,t=0)=[v2kz2ky2kh2(kz2+ky2)(kz2+ky2)]×P[ky,kh,0,v2kz(kz2+ky2)(kz2+kh2)]
where y , h 4 y , h 4 y,h_(4)y, h_{4}y,h4 and t t ttt are the variables for midpoint, offset and event time in the unmigrated position, and k y , k h k y , k h k_(y),k_(h)k_{y}, k_{h}ky,kh, and ω ω omega\omegaω are the associated Fourier transform variables.
Note that Stolt migration involves, first, mapping from ω ω omega\omegaω to k z k z k_(z)k_{z}kz for a specific k y k y k_(y)k_{y}ky and k A k A k_(A)k_{A}kA by using the dispersion relation for prestack wave extrapolation (Section E.6):
ω = v 2 k z ( k z 2 + k y 2 ) ( k z 2 + k h 2 ) ω = v 2 k z k z 2 + k y 2 k z 2 + k h 2 omega=(v)/(2k_(z))sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(h)^(2)))\omega=\frac{v}{2 k_{z}} \sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{h}^{2}\right)}ω=v2kz(kz2+ky2)(kz2+kh2)
The output of mapping is then scaled by the quantity
S = v 2 k z 2 k y 2 k h 2 ( k z 2 + k y 2 ) ( k z 2 + k h 2 ) S = v 2 k z 2 k y 2 k h 2 k z 2 + k y 2 k z 2 + k h 2 S=(v)/(2)(k_(z)^(2)-k_(y)^(2)k_(h)^(2))/(sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(h)^(2))))S=\frac{v}{2} \frac{k_{\mathrm{z}}^{2}-k_{y}^{2} k_{h}^{2}}{\sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{h}^{2}\right)}}S=v2kz2ky2kh2(kz2+ky2)(kz2+kh2)
Stolt migration output normally is displayed in two-way vertical zero-offset time τ = 2 z / v τ = 2 z / v tau=2z//v\tau=2 z / vτ=2z/v. In practice, mapping in the f k f k f-kf-kfk domain really is from ω ω omega\omegaω to ω r ω r omega_(r)\omega_{r}ωr rather than from ω ω omega\omegaω to k z k z k_(z)k_{z}kz, where ω τ ω τ omega_(tau)\omega_{\tau}ωτ is the Fourier dual of τ τ tau\tauτ, and is simply k z k z k_(z)k_{z}kz scaled by v / 2 v / 2 v//2v / 2v/2. Accordingly, equations (5-40), (5-41), and (5-42) are recast in terms of ω r = ( v / 2 ) k z ω r = ( v / 2 ) k z omega_(r)=(v//2)k_(z)\omega_{r}=(v / 2) k_{z}ωr=(v/2)kz when implemented in practice.
Migration velocity analysis based on Stolt's prestack algorithm for constant velocity thus involves the following steps:
(a) Starting with prestack data P ( y , h , t ) P ( y , h , t ) P(y,h,t)P(y, h, t)P(y,h,t) in coordinates of midpoint y y yyy, offset h h hhh and two-way event time t t ttt in the unmigrated position, perform 3-D Fourier transform to obtain the transformed volume of data P ( k y , k h , ω ) P k y , k h , ω P(k_(y),k_(h),omega)P\left(k_{y}, k_{h}, \omega\right)P(ky,kh,ω), where k y , k h k y , k h k_(y),k_(h)k_{y}, k_{h}ky,kh, and ω ω omega\omegaω are the Fourier transform duals of the variables y , h y , h y,hy, hy,h, and t t ttt, respectively.
(b) For each trial constant velocity v v vvv, use equation (5-41) to map the transform variable ω ω omega\omegaω - the temporal frequency associated with the input data P ( k y , k k , ω ) P k y , k k , ω P(k_(y),k_(k),omega)\boldsymbol{P}\left(k_{y}, k_{k}, \omega\right)P(ky,kk,ω), to ω τ ω τ omega_(tau)\omega_{\tau}ωτ - the temporal frequency associated with the migrated data P ( k y , k h , ω τ ; v ) P k y , k h , ω τ ; v P(k_(y),k_(h),omega_(tau);v)P\left(k_{y}, k_{h}, \omega_{\tau} ; v\right)P(ky,kh,ωτ;v). This mapping of complex numbers is the basis for constant-velocity prestack Stolt migration (Section E.6).
(c) Apply the scalisg factor of equation (5-42). (d) Invoke the imaging principle by setting t = 0 t = 0 t=0t=0t=0 and obtain P ( k y , k h , ω τ , t = 0 ) P k y , k h , ω τ , t = 0 P(k_(y),k_(h),omega_(tau),t=0)P\left(k_{y}, k_{h}, \omega_{\tau}, t=0\right)P(ky,kh,ωτ,t=0).
(e) Sum over the offset wavenumber k h k h k_(h)k_{h}kh to obtain the image at zero offset, yet in the transform domain, P ( k y , h = 0 , ω τ ; v ) P k y , h = 0 , ω τ ; v P(k_(y),h=0,omega_(tau);v)P\left(k_{y}, h=0, \omega_{\tau} ; v\right)P(ky,h=0,ωτ;v).
(f) Perform 2-D inverse Fourier transform to obtain the constant-velocity migrated zero-offset section, P ( y , τ ; v ) P ( y , τ ; v ) P(y,tau;v)P(y, \tau ; v)P(y,τ;v).
(g) Repeat steps (b) through (f) for a range of constant velocities to obtain the migration velocity volume P ( y , τ ; v ) P ( y , τ ; v ) P(y,tau;v)P(y, \tau ; v)P(y,τ;v). By viewing this volume, it can be incised to obtain the surface of optimum migration velocity field with an accompanying image derived from prestack time migration.
Practical issues related to prestack Stolt migration include spatial aliasing along the offset axis and cost of Stolt mapping in steps (b) and (c). The spatial sampling along the offset axis often is too coarse for shallow events with low velocity; this gives rise to large moveout on CMP gathers. A linear moveout may be applied to CMP gathers to circumvent spatial aliasing. Equation (5-40) for Stolt mapping is then modified accordingly (Li et al., 1991).
The Stolt mapping of amplitudes for prestack data involves interpolation of complex numbers in the transform domain. This involves the three input variables k ψ k ψ k_(psi)k_{\psi}kψ, k h k h k_(h)k_{h}kh, and ω ω omega\omegaω, and the output variable ω r ω r omega_(r)\omega_{r}ωr, and thus is quite costly when one has to consider as many as 100 or more constant velocities. A A AAA way to reduce the computational cost is to perform prestack migration using a set of constant velocities at coarse interval, followed by poststack residual constant-velocity migrations of the zero-offset sections from prestack migration to fill in between the coarsely sampled migration velocity panels ( L i L i Li\mathrm{Li}Li et al., 1991).

Common-Offset Migration of DMO-Corrected Data

This technique for migration velocity analysis is the basis for the most common sequence used for prestack time migration (Section 5.3). A flowchart for the method is shown in Figure 5.4-4.
(a) Starting with prestack data P ( y , h , t ) P ( y , h , t ) P(y,h,t)P(y, h, t)P(y,h,t) in coordinates of midpoint y y yyy, offset h h hhh, and two-way event time t t ttt in the unmigrated position, apply NMO correction using an initial velocity field with minimal dip effect.
(b) Sort the norrual-moveout corrected data P ( y , h , t n ) P y , h , t n P(y,h,t_(n))P\left(y, h, t_{n}\right)P(y,h,tn) to common-offset sections P ( y , t n ; h ) P y , t n ; h P(y,t_(n);h)P\left(y, t_{n} ; h\right)P(y,tn;h).
(text contriues on p.788)
FIG. 5.4-5. A CMP stacked section associated with data from an overthrust belt. (Data courtesy Husky Oil.)
FIG. 5.4-6. Velocity field assoriated with the stacked section shown in Figure 5.4-5.
FIG. 5.4-7. Poststack time migration of the stacked section shown in Figure 5.4-5 using the velocity field shown in Figure 5.4-6.
FIG. 5.4-8. Part 1: Constant-velocity prestack Kirchhoff time migration paneis of the data as in Figure 5.4-5.
FIG. 5.4-8. Part 2: Constant-velocity prestack Kirchhoff time rigration panels of the data as in Figure 5.4-5.
FIG. 5.4-8. Part 3: Constant-velocity prestack Kirch hoff time migration pantels of the data as in Figure 5.4-5.
FIG. 5.4-9. Part 1: Velocity panels from the overthrust data created by sorting the results of prestack constant-velocity migrations shown in Figure 5.4-8.
FIG. 5.4-9. Part 2: Sorted resuits from Figure 5.4-8. Each panel shows results of constant-velocity migrations in the neighborhood of the CMP location as denoted.
FIG. 5.4-10. Time migration velocity field created from the velocity function picks made from the anaiysis panels shown in Figure 5.4-9.
FIG. 5.4-11. Prestack time migration using the velocity field shown in Figure 5.4-10.
(c) To each common-offset section P ( y , t n ; h ) P y , t n ; h P(y,t_(n);h)P\left(y, t_{n} ; h\right)P(y,tn;h), apply DMO correction P ( y , T 0 ; h ) P y , T 0 ; h P(y,T_(0);h)P\left(y, T_{0} ; h\right)P(y,T0;h).
(d) Migrate each of the common-offset sections using a. zero-offset migration algorithm (Chapter 4) and the velocity field based on the flat-event velocity picks from step (a).
(e) Sort the migrated common-offset data P ( y , τ ; h ) P ( y , τ ; h ) P(y,tau;h)P(y, \tau ; h)P(y,τ;h) back to CMP gathers P ( y , h , τ ) P ( y , h , τ ) P(y,h,tau)P(y, h, \tau)P(y,h,τ) and apply inverso NMO correction using the flat-event velocities from step (a).
(f) Perform velocity analysis at frequent intervals as needed to derive an optimum velocity field which is used for the subsequent migration of the data.

Prestack Kirchhoff Migration

A practical alternative to prestack Stolt migration that involves all of the prestack data at all times during the computation is to migrate prestack data using the Kirchhoff summation method. The summation of amplitudes is done along the table-top trajectories inferred by equation (5-15), and the necessary amplitude and phase treatment of the surnmed amplitudes are given by the integral solution to the scalar wave equation (Section 4.1)
Prestack Kirchhoff migration provides the flexibility to output selected CMP gathers in their migrated positions. Such an option is attractive if one wants to pick rms velocity functions from the selected output gathers to create a migration velocity field. This is not possible with prestack Stolt migration which generates a volume of prestack migrated data. Another advantage of prestack Kirchhoff migration is its ability to accommodate irregular topography.
Figure 5.4-5 is a CMP-stacked section associated with a seismic traverse over an overthrust structure. The line direction is approximately orthogonal to the thrust planes, and thus yields minimal 3 -D effects. This data set is quite deceptive - at first, it givcs the impression that time rigration is not a valid strategy for imaging the subsurface. Although the reflector geometries are quite complex, velocities vary from 4000 m / s 4000 m / s 4000m//s4000 \mathrm{~m} / \mathrm{s}4000 m/s a.t the surface to 6500 m / s 6500 m / s 6500m//s6500 \mathrm{~m} / \mathrm{s}6500 m/s at the bottom of the section with not much refraction occurring at layer boundaries.
The stacking velocity field shown in Figure 5.4-6 does not appear to be geologically plausable. Nevertheless, use it without much editing for poststack time migration. The resulting section shown in Figure 5.4-7 already exhibits a fairly accurate image of the structurally complex zone above 2 s 2 s 2s2 \mathrm{~s}2 s. We observe imbricate structures, folds, and reverse faults that accompany the thrust faults. The sole thrust - zone of detachment between the competent rock layers below 2 s 2 s 2s2 \mathrm{~s}2 s and the incompetent rock layers above, can be traced along a trajectory that starts at approximately 1.75 s 1.75 s 1.75s1.75 \mathrm{~s}1.75 s on the left-edge of the section, climbs upward and emerges on the surface at approximately midpoint 510.
We now perform prestack Kirchhoff migration using a range of constant velocities and obtain a set of migration panels as shown in Figure 5.4-8. To use the constant-velocity migration panels for picking rms velocities, they were split into vertical stripes each comprising 100 midpoints. By grouping the constantvelocity stripes with the same center midpoint, we obtain the velocity panels shown in Figure 5.4-9. Just as a constant-velocity-stack (CVS) panel (Figure 3.2-10) is used to pick a stacking velocity function, the constantvelocity-migration panels in Figure 5.4-9 can be used to pick an rrms velocity function at each center CMP location. These functions can then be combined to create a migration velocity field as shown in Figure 5.4-10. Compare with Figure 5,4-6 and note that the migration velocity field indeed exhibits a pattern that conforms with the subsurface structure. By using the velocity field in Figure 5.4-10, the prestack time migrated section show in Figure 5.4-11 was obtained. Compare with the poststack time migrated section (Figure 5.4-7) and observe that, in this case, the differences are marginal. The primary reason for this is that velocities are generally quite high, making even DMO correction unnecessary.

Velocity Analysis Using
Common-Reflection-Point Gathers

The next field data example demonstrates the use of constant-velocity prestack time migration to generate selected CMP gathers in their migrated positions to determine migration velocities. Figure 5.4-12 shows a CMP stack without DMO correction; the exploration objective requires delineation of fault blocks which manifest themselves with phantom diffractions. These diffractions conflict with the gently dipping reflections associated with the surrounding strata. Poststack time migration of the CMP stack without DMO correction falls short of providing a crisp image of the fault blocks (Figure 5.4-13).
Dip-moveout correction preserves the phantom diffractions and fault-plane reflections on stacked data as shown in Figure 5.4-14. As a result, migration of the DMO stack (Figure 5.4-15) enables a better delineation of the fault planes as compared with the migration of the conventional CMP stack without DMO correction (Figure 5.4-13).
Table 5-4. Velocity function derived from the constantvelocity migration panel of Figure 5.4-16.
Two-way Zero-Ofset
time, ms
Two-way Zero-Ofset time, ms| Two-way Zero-Ofset | | ---: | | time, ms |
RMS Velocity
Picked, m / s m / s m//s\mathrm{m} / \mathrm{s}m/s
RMS Velocity Picked, m//s| RMS Velocity | | :---: | | Picked, $\mathrm{m} / \mathrm{s}$ |
0 1500
450 1500
700 1600
900 1750
1050 1900
1200 2200
1500 2500
2000 2800
2350 3000
2500 3000
"Two-way Zero-Ofset time, ms" "RMS Velocity Picked, m//s" 0 1500 450 1500 700 1600 900 1750 1050 1900 1200 2200 1500 2500 2000 2800 2350 3000 2500 3000| Two-way Zero-Ofset <br> time, ms | RMS Velocity <br> Picked, $\mathrm{m} / \mathrm{s}$ | | ---: | :---: | | 0 | 1500 | | 450 | 1500 | | 700 | 1600 | | 900 | 1750 | | 1050 | 1900 | | 1200 | 2200 | | 1500 | 2500 | | 2000 | 2800 | | 2350 | 3000 | | 2500 | 3000 |
Table 5-5. Velocity function derived from the constantvelocity migration pand of Figure 5.4-17.
Two-way Zero-Offset
time, ms
Two-way Zero-Offset time, ms| Two-way Zero-Offset | | ---: | | time, ms |
RMS Velocity
Picked, m / s m / s m//s\mathrm{m} / \mathrm{s}m/s
RMS Velocity Picked, m//s| RMS Velocity | | :---: | | Picked, $\mathrm{m} / \mathrm{s}$ |
0 1500
400 1500
750 1700
900 1800
1050 2000
1350 2300
1500 2600
2050 2900
2500 3000
"Two-way Zero-Offset time, ms" "RMS Velocity Picked, m//s" 0 1500 400 1500 750 1700 900 1800 1050 2000 1350 2300 1500 2600 2050 2900 2500 3000| Two-way Zero-Offset <br> time, ms | RMS Velocity <br> Picked, $\mathrm{m} / \mathrm{s}$ | | ---: | :---: | | 0 | 1500 | | 400 | 1500 | | 750 | 1700 | | 900 | 1800 | | 1050 | 2000 | | 1350 | 2300 | | 1500 | 2600 | | 2050 | 2900 | | 2500 | 3000 |
To derive a migration velocity field, we perform prestack time migration using a range of constant velocities and generate selected gathers at their migrated positions. The interval for output gathers is specified in accordance with the degrec of lateral velocity variations that can be accommodated by time migration. An interval equal to a cable length is a reasonable rule to follow. Figures 5.4-16 through 5.4-19 show migration velocity panels at four midpoint locations. The way to use these panels to pick rms velocity functions at analysis locations is similar to the use of a CMP gather that has been normal-moveout corrected using a range of constant velocities (Figure 3.2-11). In both cases, a velocity function is picked based on the criterion of flatness of events. The flatness of an event on a moveout-corrected gather means that the moveout velocity associated with that event is optimum. Similarly, the flatness of an event on a CMP gather created by prestack time migration
Table 5-6. Velocity function derived from the constantvelocity migration panel of Figure 5.4-18.
Two-way Zero-O R M R M RM\mathrm{RM}RM
Two-way Zero-O RM| Two-way Zero-O | $\mathrm{RM}$ | | :---: | :---: |
Table 5-7. Velocity function derived from the constantvelocity migration panel of Figure 5.4-19.
Two-way Zero-Ofset
time, m s m s ms\mathrm{ms}ms
Two-way Zero-Ofset time, ms| Two-way Zero-Ofset | | ---: | | time, $\mathrm{ms}$ |
RMS Velocity
Picked, m/s
RMS Velocity Picked, m/s| RMS Velocity | | :---: | | Picked, m/s |
0 1500
350 1500
650 1750
750 1800
950 2000
1250 2500
1750 2700
2500 3000
"Two-way Zero-Ofset time, ms" "RMS Velocity Picked, m/s" 0 1500 350 1500 650 1750 750 1800 950 2000 1250 2500 1750 2700 2500 3000| Two-way Zero-Ofset <br> time, $\mathrm{ms}$ | RMS Velocity <br> Picked, m/s | | ---: | :---: | | 0 | 1500 | | 350 | 1500 | | 650 | 1750 | | 750 | 1800 | | 950 | 2000 | | 1250 | 2500 | | 1750 | 2700 | | 2500 | 3000 |
means that the image below the midpoint location associated with that gather is the same irrespective of ofset, and thus migration velocity is correct. Erroneously too low velocity yields a moveout on a gather from prestack time migration similar to the moveout of an event on a CMP gather which has been overcorrected. Similarly, erroneously too high velocity yields a moveout on a gather from prestack time migration much like to the moveout of an event on a CMP gather which has been undercorrected. Observe flat, over- and undercorrected events in the velocity panels shown in Figures 5.4-16 thtough 5.4-19, and pick for each CMP location rms velocity functions. Tables 5-4 through 5-7 list the picked rms velocity functions.
There is one very important aspect of the corstantvelocity migration panel as in Figure 5.4-19 and the constant-velocity moveout panel as in Figure 3.2-11. When picking a moveout velocity function from the latter, you are tracking the same event at the same reflection point from gather to gather in the same panel overcorrected at low velocities, flat at optimum velocity
FIG. 5.4-12. A portion of a CMP stack from an area with fault blocks. (Data courtesy BHP Petroleum.)
FIG. 5.4-13. Poststack time migration of the CMP stack shown in Figure 5.4-12. Note the undermigration caused by the 2-D migration of 3-D behavior of the fault-plane diffractions and reflections (Chapter 7).
FIG. 5.4-14. DMO stack associated with the data set as in Figure 5.4-12.
FIG. 5.4-15. Poststack time migration of the DMO stack shown in Figure 5.4-14. Note the undermigration caused by the 2-D migration of 3-D behavior of the fanlt-plane diffractions and reflections (Chapter 7).
FIG. 5.4-16. Migration velocity analysis panel for CMP 1161 of the data set as in Figure 5.4-12. The panel is created by performing prestack time migration using a range of constant velocities and displaying the results at CMP location 1161.
FIG. 5.4-17. Migration velocity analysis panel for CMP 1561 of the dats set as in Figure 5.4-12. The panel is created by performing prestack time migration using a range of constant velocities and displaying the results at CMP location 1561.
FIG. 5.4-18. Migration velocity analysis panel for CMP 1961 of the data set as in Figure 5.4-12. The panel is created by performing prestack time migration using a range of constant velocities and displaying the results at CMP location 1961.
FIG. 5.4-19. Migration velocity analysis panel for CMP 2361 of the data set as in Figure 5.4-12. The panel is created by performing prestack time migration using a range of constant velocities and displaying the results at CMP location 2361.
FIG. 5.4-20. Time migration velocity field computed from the vertical velocity functions picked from the migration veiocity analysis panels as in Figures 5.4-16 through 5.4-19.
FIG. 5.4-22. The stack of image gathers as in Figure 5.4-21 derived from prestack time migration. Compare with Figure 6.0 40 6.0 40 6.0-406.0-406.040.
value and undercorrected at high velocities. Whereas, when picking an rms velocity function from the former, you are not tracking the event at the same reflection point because of the lateral positioning effect of migration.
By interpolating between the picked rms velocity functions as listed in Tables 5-4 through 5-7, a velocity field for time migration can be created (Figure 5.4-20). By using this velocity field, data are migrated before stack. The common-reflection-point (CRP) gathers in Figure 5.4-21 exhibit flatness of events - a way to check the accuracy of the migration velocity field. Stacking the CRP gathers yields the image from prestack time migration as shown in Figure 5.4-22. Admittedly, there is some undermigration caused by the 3-D geometry of the fault planes which can be adequately imaged only by 3-D migration (Section 7,0). Nevertheless, compare with migrations of the conventional stack (Figure 5.4-13) and DMO stack (Figure 5.4-15), and note that the faults have been delineated much more distinctively. Such differences conflicting dips with different stacking velocities associated with fault blocks and salt diapirs where vertical velocity variations may be beyond the accuracy of DMO correction, are one motivation for doing time migration before stack.
Limitations in picking reliable velocity functions are the same as those associated with constant-velocity moveout panels (Figure 3.2-11). Shortening of effective cable length at shallow times because of muting, interference of linear noise and multiples all impnes a limit on the picking accuracy (Section 6.0).

Focusing Analysis

The idea of a velocity analysis that is based on differential solutions of the scalar wave equation first was introduced by Doherty and Claerbout (1974). They used the 15-degree finite-difference migration algorithm and worked with single CMP gathers. Gonzalez-Serrano and Claerbout (1979) later extended the wave equation velocity analysis to slant-midpoint coordinates and worked with linearly moveout-corrected CMP gathers. The method discussed here (Yilmaz and Chambers, 1984) operates in the Fourier transform domain using the exact form of the double-square-root (DSR) opera-
Procedure
Recorded Data : : ::: P ( y , h , τ = 0 , t ) P ( y , h , τ = 0 , t ) P(y,h,tau=0,t)P(y, h, \tau=0, t)P(y,h,τ=0,t)
3-D FFT + 1 + 1 ^(+1){ }^{+1}+1 : : ::: P ( k y , k h , τ = 0 , ω ) P k y , k h , τ = 0 , ω P(k_(y),k_(h),tau=0,omega)P\left(k_{y}, k_{h}, \tau=0, \omega\right)P(ky,kh,τ=0,ω)
× × xx\times×
Recorded Data : P(y,h,tau=0,t) 3-D FFT ^(+1) : P(k_(y),k_(h),tau=0,omega) xx | Recorded Data | $:$ | $P(y, h, \tau=0, t)$ | | :--- | :---: | :---: | | 3-D FFT ${ }^{+1}$ | $:$ | $P\left(k_{y}, k_{h}, \tau=0, \omega\right)$ | | $\times$ | | |
FIG. 5.4-23. A flowchart of an algorithm for focusing analysis.
tor. Mathematical details of this method are found in Section E.7. Figure 5.4-23 summarizes the main computational steps involved in this migration velocity analysis based on wavefield extrapolation.
(a) Starting with the prestack data in midpoint y y yyy, offset h h hhh, and two-way event time t t ttt in the unmigrated position, represented by the wavefield P ( y , h , τ = P ( y , h , τ = P(y,h,tau=P(y, h, \tau=P(y,h,τ= 0 , t 0 , t 0,t0, t0,t ) at the surface τ = 0 τ = 0 tau=0\tau=0τ=0, perform 3-D Fourier transform. The variable r r rrr is associated with the direction of wave extrapolation, and is related to depth z z zzz by τ = 2 z / v τ = 2 z / v tau=2z//v\tau=2 z / vτ=2z/v, where v v vvv is the medium velocity.
(b) Specify an extrapolation velocity function that only varies vertically, v ( τ ) v ( τ ) v(tau)v(\tau)v(τ) and apply the extrapolation operator exp ( i ω D S R τ / 2 ) exp ( i ω D S R τ / 2 ) exp(-i omega DSR tau//2)\exp (-i \omega D S R \tau / 2)exp(iωDSRτ/2) to compute the extrapolated wavefield in the transform domain P ( k y , k h , τ , ω ) P k y , k h , τ , ω P(k_(y),k_(h),tau,omega)P\left(k_{y}, k_{h}, \tau, \omega\right)P(ky,kh,τ,ω) from the surface wavefield in the transform domain P ( k y , k h , τ = 0 , ω ) P k y , k h , τ = 0 , ω P(k_(y),k_(h),tau=0,omega)P\left(k_{y}, k_{h}, \tau=0, \omega\right)P(ky,kh,τ=0,ω).
(c) To obtain the zero-offset image, sum over the offset wavenumber, and thus obtain P ( k y , h = 0 , τ , ω ) P k y , h = 0 , τ , ω P(k_(y),h=0,tau,omega)P\left(k_{y}, h=0, \tau, \omega\right)P(ky,h=0,τ,ω).
(d) Apply 2-D inverse Fourier transform to obtain the zero-offset image P ( y , h = 0 . τ , t ) P ( y , h = 0 . τ , t ) P(y,h=0.tau,t)P(y, h=0 . \tau, t)P(y,h=0.τ,t). The image below a midpoint y y yyy is contained in the t τ t τ t-taut-\tautτ plane.
(e) Perform mapping of the variables as described in Section E. 6 from τ τ tau\tauτ to v v vvv. The velocity information
FIG. 5.4-24. Common-offset data derived from a constantvelocity earth model consisting of six point scatterers beneath midpoint 1, where (a) is zero-offset and (b) is far offset.
is given by the envelope of the velocity volume of data P ( y , h = 0 , τ = t , v ) P ( y , h = 0 , τ = t , v ) P(y,h=0,tau=t,v)P(y, h=0, \tau=t, v)P(y,h=0,τ=t,v).
We now demonstrate the procedure outlined in Figure 5.4-23 using a synthetic data set. Figure 5.4 24 shows two common-offset sections over a number of point scatterers buried in a constant-velocity earth. where v = 3000 m / s v = 3000 m / s v=3000m//sv=3000 \mathrm{~m} / \mathrm{s}v=3000 m/s. Using a constant velocity for extrapolation, v e = 3000 m / s v e = 3000 m / s v_(e)=3000m//sv_{e}=3000 \mathrm{~m} / \mathrm{s}ve=3000 m/s, the t τ t τ t-taut-\tautτ image plane was produced for each midpoint. Two such planes corresponding to midpoints 1 and 5 denoted in Figure 5.4-24 are shown in Figure 5.4-25. The v τ v τ v-tauv-\tauvτ planes (Figure 5.4 26) then were generated from the t τ t τ t-taut-\tautτ image planes by the mapping procedure described in Section E.7. Peak amplitudes for all events occur at the correct medium velocity ( 3000 m / s ) ( 3000 m / s ) (3000m//s)(3000 \mathrm{~m} / \mathrm{s})(3000 m/s). We expect the diffraction events in Figure 5.4-23 to migrate to the apexes beneath midpoint 1, where the point scatterers are located. Note that in Figure 5.4-25, almost all the energy is in the
FIG. 5.4-25. Image planes corresponding to midpoints 1 and 5 as indicated in Figure 5.4-24, where (a) is CMP 5 and (b) is CMP 1.
(a)
(b)
FIG. 5.4-26. The v τ v τ v-tauv-\tauvτ planes corresponding to midpoints 1 and 5 derived from the image planes in Figure 5.4-25, where (a) is CMP 5 and (b) is CMP 1.
(a)
(b)
FIG. 5.4-27. Common-offset data based on a horizontally layered ear th model containing three point scatterers located beneath midpoint 1 on the boundaries between constantvelocity layers, where (a) is zero-offset and (b) is far ofiset.
image plane corresponding to midpoint 1 ; just five midpoints away, at midpoint 5 , the migrated energy is very low.
How do we interpret the t τ t τ t-taut-\tautτ image planes? If we used the true medium velocity in downward extrapolation, then, according to the imaging principle, we would see all the events along the diagonal τ = t τ = t tau=t\tau=tτ=t, the image lene, on the image plane. This happens in Figure 5.425 , because a 3000 m / s 3000 m / s 3000-m//s3000-\mathrm{m} / \mathrm{s}3000m/s extrapolation velocity was used,
FIG. 5.4-28, Image planes corresponding to ridpoints 1 and 5 as indicated in Figure 5.4-27, where (a) is CMP 5 and (b) is CMP 1.
(b)
FIG. 5.4-29. The τ τ τ τ tau-tau\tau-\tauττ planes corresponding to midpoints 1 and 5 derived from the image planes in Figure 5 4-28, where (a) is CMP 5 and (b) is CMP 1.
which is just the velocity used in generating the model in Figure 5.4-23. Any displacement of peak energy from the t = τ t = τ t=taut=\taut=τ inage line means that the velocity value used for downward extrapolation differs from that of the event. This displacement is also the basis for mapping from the t τ t τ t-taut-\tautτ image plane to the v τ v τ v-tauv-\tauvτ plane by equation ( E 77 E 77 E-77\mathrm{E}-\mathrm{77}E77 ).
F1G. 5.4-30. (a) CMP gather at location 1 as inducated in Figure 5.4-2 i i i i i_(i)i_{i}ii (b) and (c) are velocity spectra derived from this gather by the methods of Figures 5.4-1b and c c ccc, respectively.
This mapping is investigated further with the modeled data set shown in Figure 5.4-27, in which velocity increases with depth. In Figure 5.4 28b, note that the top and middle events fall to the left of the image line suggesting that the velocity used in extrapolation ( v e = 3000 m / s ) v e = 3000 m / s (v_(e)=3000(m)//s)\left(v_{e}=3000 \mathrm{~m} / \mathrm{s}\right)(ve=3000 m/s) is greater than the velocities associated with these events. The bottom event falls on the image line, implying that its velocity is nearly the same as the extrapolation velocity. These observations are confirmed in the corresponding v τ v τ v-tauv-\tauvτ planes in Figure 5.4-29. While true stacking velocity values for the three events are 2700,2850 , and 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s, the velocities interpreted from Figure 5.4-29b are about 2500, 2800, and 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s. Thus, the migration-based velocity estimate for the shallow event is in error by approximately 8 percent.
To determine the reason for the velocity error, we will consider a migration-based velocity analysis of our synthetic data example that does not involve the approximate mapping step. Figure 5.3-30a shows a CMP gather from midpoint 1 in the zero-dip region
FIG. 5.4-31. Focusing analysis for determining migration velocities. See text for details.
FIG. 5.4-32. A CMP stacked section. The center portion was used in the migration velocity analysis described in Figures 5433 , 5.4 34 5433 , 5.4 34 5433,5.4-345433,5.4-345433,5.434, and 5.435 .
of the depth-variable velocity model associated with the constant-offset sections in Figure 5.4-27. The migration velocity analysis on this gather (Figure 5.430b) was done by extrapolating the surface wavefield P ( k h , ω , τ = 0 ) P k h , ω , τ = 0 P(k_(h),omega,tau=0)P\left(k_{h}, \omega, \tau=0\right)P(kh,ω,τ=0) repeatedly with diferent constant velocities in steps of Δ τ = Δ t Δ τ = Δ t Delta tau=Delta t\Delta \tau=\Delta tΔτ=Δt (the sampling rate). The zero-offset trace from each attempt was collected after this effort, abandoning the rest of the migrated CMP gather.
Interpretation of the velocity analysis in Figure 5.4-30b reveals correct stacking velocities for the three events, including the shallowest. Clearly the error observed in Figure 5.4-29 is attributable to the mapping (equation (E-100). Note that the error does not occur because of depth variability of velocity, but instead, because the single extrapolation velocity used differed from the medium velocity. The conventional velocity analysis for midpoint 1 1 1\mathbf{1}1 of this model data set is shown
FIG. 5.4-33. Image planes associated with the center midpoint from the zone of interest in Figure 5.4-32.
in Figure 5.4-30c for comparison. Note the familiar NMO stretching that is apparent in the shallow event. In other respects, both the results (Figures 5.4-30b and 5.4-30c) are comparable.
The departure of an event on the t τ t τ t-taut-\tautτ image plane from the t = τ t = τ t=taut=\taut=τ image line is measured by the quantity Δ τ Δ τ Delta tau\Delta \tauΔτ as depicted in Figure 5.4-31a. In some practical implementations, the t τ t τ t-taut-\tautτ image plane is mapped onto the plane of Δ τ Δ τ Delta tau\Delta \tauΔτ versus τ τ tau\tauτ as depicted in Figure 5.4-31c to determine the rms velocity v ( τ ) v ( τ ) v(tau)v(\tau)v(τ) for time migration from the extrapolation velocity v e ( τ ) v e ( τ ) v_(e)(tau)v_{e}(\tau)ve(τ). An event with a velocity error v ( τ ) v e ( τ ) v ( τ ) v e ( τ ) v(tau)-v_(e)(tau)v(\tau)-v_{e}(\tau)v(τ)ve(τ) is represented by an energy maximum either to the left or to the right of the Δ τ = 0 Δ τ = 0 Delta tau=0\Delta \tau=0Δτ=0 line. The δ τ ( τ ) δ τ ( τ ) delta tau(tau)\delta \tau(\tau)δτ(τ) trend can be picked and translated into a velocity trend as depicted in Figure 5.4-31b. This type of analysis has come to be called focusing analysis in the industry (Faye and Jeannaut, 1986). It has been used in some cases erroneously to estimate and update velocitydepth models used for depth migration. The method can only provide plausable velocity update within the frames ork of time migration.
Figure 5.4-32 is a CMP stack from offshore Texas. A 7000 )-ft portion (64 midpoints each with 48 offset traces) of the profile was used for migration velocity analysis. For computational efficiency, the data were windowed into 1024 -ms time gates with 50 percent overlap. The image planes for one particular midpoint are shown in Figure 5.4-33. Different extrapolation velocities picked from a specified regional velocity function are used in each time gate. The velocity scan used in mapping is then carried out within a corridor around this function. Because different extrapolation velocities are used in successive segments, a given event appears at different values of τ τ tau\tauτ in adjacent time segments.
The resulting velocity analysis for the central midpoint is shown in Figure 5.4-34. In conventional practice, to improve the quality of velocity picks, velocity analyses from a number of neighboring CMP gathers often are summed. Figure 5.4-34c shows the result of stacking velocity analysis for data from the six adjacent CMP gathers indicated in Figure 5.4-34a. For the migration-based method, the v τ v τ v-tauv-\tauvτ planes corresponding to these gathers were summed. The result is shown in Figure 5.4-34b. The most obvious difference between the two results is the lack of shallow information in the migration-based v τ v τ v-tauv-\tauvτ plane. This shortcoming is attributed to spatial aliasing and lack of long-offset ditia in the shallow time gate. The problem can be eliminated partly by increasing the length of the time gate used in the velocity analysis. With the shortcut tirne-windowing

Velocity (kft/s) rarr\rightarrow

(a)
(c)
FIG. 5.4-34. (a) A portion of the CMP stacked section in Figure 5.4-32, (b) the velocity spectrum based on the procedure in Figure 5.4-23, followed by averaging over six midpoints; (c) the conventional velocity analysis as discussed in Section 3.2 followed by averaging over six midpoints.
approach described above, the shallowest time segment did not include the large-offset data necessary for velocity resolution. Because the events have dip, the derived migration velocities are lower (by up to 4.5 percent) than the velocities derived from the stacking velocity analysis.
The velocity analysis described in this section does not handle lateral variations in velocity. It is based on a Fourier-transform domain formulation with only vertically varying velocity used in extrapolation. This method may be particularly efficient for the dipcorrected velocity estimate needed for time migration.

Fowler's Velocity-Independent Prestack Migration

We now restate the underlying principle for migration velocity analysis:
Starting with the prestack volume of data P ( y , h , t ) P ( y , h , t ) P(y,h,t)P(y, h, t)P(y,h,t) in midpoint y 1 y 1 y_(1)y_{1}y1 offset h h hhh and two-way event time t t ttt in the unmigrated position, create a velocity cube volume of data P ( y , v , τ ) P ( y , v , τ ) P(y,v,tau)P(y, v, \tau)P(y,v,τ) in midpoint y y yyy, migration velocity v v vvv and two-way event time τ τ tau\tauτ in the migrated position. Within the context of time migration, the
FIG. 5.4-35. A flowchart of an algorithm to create a migration velocity cube.
output time variable τ τ tau\tauτ is related to depth by way of vertical stretch: τ = 2 z / v τ = 2 z / v tau=2z//v\tau=2 z / vτ=2z/v.
Although the velocity cube can be created by means of some of the migration velocity analysis techniques described in this section, a variation of the method by Fowler (1984) is particularly efficient and elegant. First, we review Fowler's method to create the velocity cube. Refer to the moveout equation (5-1) and recall that stacking velocity v s t k v s t k v_(stk)v_{s t k}vstk is dip dependent:
t 2 = t 0 2 + 4 h 2 v s t k 2 t 2 = t 0 2 + 4 h 2 v s t k 2 t^(2)=t_(0)^(2)+(4h^(2))/(v_(stk)^(2))t^{2}=t_{0}^{2}+\frac{4 h^{2}}{v_{s t k}^{2}}t2=t02+4h2vstk2
where
v s t k = v D M O cos ϕ . v s t k = v D M O cos ϕ . v_(stk)=(v_(DMO))/(cos phi).v_{s t k}=\frac{v_{D M O}}{\cos \phi} .vstk=vDMOcosϕ.
Use equation (5-11) to establish a relationship between the dip-dependent stacking velocities v s t k v s t k v_(stk)v_{s t k}vstk and the dipindependent DMO velocities v D M O v D M O v_(DMO)v_{D M O}vDMO - velocities estimated from dip-moveout-corrected data:
v s t k = v D M O 1 ( v D M O k y 2 ω 0 ) 2 v s t k = v D M O 1 v D M O k y 2 ω 0 2 v_(stk)=-(v_(DMO))/(sqrt(1-((v_(DMO)k_(y))/(2omega_(0)))^(2)))v_{s t k}=-\frac{v_{D M O}}{\sqrt{1-\left(\frac{v_{D M O} k_{y}}{2 \omega_{0}}\right)^{2}}}vstk=vDMO1(vDMOky2ω0)2
This equation is the basis for Fowler mapping of v s t k v s t k v_(stk)v_{s t k}vstk to v D M O v D M O v_(DMO)v_{D M O}vDMO. Note that the process is applied to data in the frequency-wavenumber domain. The Fowler mapping is then followed by constant-velocity Stolt mapping (Sections 4.1 and D.7) to map the DMO velocities v D M O v D M O v_(DMO)v_{D M O}vDMO to migration velocities v mag v mag  v_("mag ")v_{\text {mag }}vmag .
Stolt migration of the dip-moveout-corrected data volume in the Fourier transform domain P ( k y , ω 0 ; v D M O ) P k y , ω 0 ; v D M O P(k_(y),omega_(0);v_(DMO))P\left(k_{y}, \omega_{0} ; v_{D M O}\right)P(ky,ω0;vDMO) involves, first, mapping from ω 0 ω 0 omega_(0)\omega_{0}ω0 to ω τ ω τ omega_(tau)\omega_{\tau}ωτ for a specific k y k y k_(y)k_{y}ky by using the dispersion rclation of equa- tion ( 4 24 b ) ( 4 24 b ) (4-24 b)(4-24 b)(424b) recast as
ω 0 = ω v 2 + v m 2 g 2 k v 2 4 ω 0 = ω v 2 + v m 2 g 2 k v 2 4 omega_(0)=sqrt(omega_(v)^(2)+(v_(m2g)^(2)k_(v)^(2))/(4))\omega_{0}=\sqrt{\omega_{v}^{2}+\frac{v_{m 2 g}^{2} k_{v}^{2}}{4}}ω0=ωv2+vm2g2kv24
where the relationship ω τ = v m i g k z / 2 ω τ = v m i g k z / 2 omega_(tau)=v_(mig)k_(z)//2\omega_{\tau}=v_{m i g} k_{z} / 2ωτ=vmigkz/2 is used. The output of this mapping P ( k y , ω τ ; v mag ) P k y , ω τ ; v mag  P(k_(y),omega_(tau);v_("mag "))P\left(k_{y}, \omega_{\tau} ; v_{\text {mag }}\right)P(ky,ωτ;vmag ) is then scaled by the quantity S S SSS given by equation (4-24c) recast as
S = v m i g 2 ω τ ω τ 2 + v m g 2 k y 2 4 S = v m i g 2 ω τ ω τ 2 + v m g 2 k y 2 4 S=(v_(mig))/(2)(omega_(tau))/(sqrt(omega_(tau)^(2)+(v_(mg)^(2)k_(y)^(2))/(4)))S=\frac{v_{m i g}}{2} \frac{\omega_{\tau}}{\sqrt{\omega_{\tau}^{2}+\frac{v_{m g}^{2} k_{y}^{2}}{4}}}S=vmig2ωτωτ2+vmg2ky24
Again, the relationship ω τ = v m i g k z / 2 ω τ = v m i g k z / 2 omega_(tau)=v_(mig)k_(z)//2\omega_{\tau}=v_{m i g} k_{z} / 2ωτ=vmigkz/2 is used to obtain equation (5-47) from equation (4-24c).
Figure 5.4-35 describes a flowchart for creating the migration velocity volume P ( y , v m 2 g , τ ) P y , v m 2 g , τ P(y,v_(m2g),tau)P\left(y, v_{m 2 g}, \tau\right)P(y,vm2g,τ) by Fowler and Stolt mapping.
(a) Start with data P ( y , h , t ) P ( y , h , t ) P(y,h,t)P(y, h, t)P(y,h,t) in coordinates of midpoint y y yyy, offset 2 h 2 h 2h2 h2h and event time t t ttt in the unmigrated position, and create constant-velocity stack (CVS) volume P ( y , v s t k , t r 2 ) P y , v s t k , t r 2 P(y,v_(stk),t_(r_(2)))P\left(y, v_{s t k}, t_{r_{2}}\right)P(y,vstk,tr2) using a range of velocities v s t k v s t k v_(stk)v_{s t k}vstk, where t n t n t_(n)t_{n}tn is the event time after constantvelocity normal moveout correction.
(b) Apply 2-D Fourier transform to obtain the CVS cube P ( k y , v a t k , ω ) P k y , v a t k , ω P(k_(y),v_(atk),omega)P\left(k_{y}, v_{a t k}, \omega\right)P(ky,vatk,ω) in the frequency-wavenumber domain, where k y k y k_(y)k_{y}ky and w w www are the Fourier transform variables associated with the variables y y yyy and t n t n t_(n)t_{n}tn.
(c) Sort the CVS volume P ( k y , v s t k , w ) P k y , v s t k , w P(k_(y),v_(stk),w)P\left(k_{y}, v_{s t k}, w\right)P(ky,vstk,w) into a set of constant-velocity sections P ( k v , ω ; v s t k ) P k v , ω ; v s t k P(k_(v),omega;v_(stk))P\left(k_{v}, \omega ; v_{s t k}\right)P(kv,ω;vstk).
(d) Perform the Fowler mapping based on equation (545) on each of the velocity sections so as to obtain the DMO velocity volume P ( k y , ω 0 ; v D M O ) P k y , ω 0 ; v D M O P(k_(y),omega_(0);v_(DMO))P\left(k_{y}, \omega_{0} ; v_{D M O}\right)P(ky,ω0;vDMO).
(c) Migrate each of the constant-velocity sections of the DMO velocity volume by performing the Stolt mapping based on equations (5-46) and (5-47) so as to obtain the migration velocity volume P ( k y , ω τ ; v m + g ) P k y , ω τ ; v m + g P(k_(y),omega_(tau);v_(m+g))P\left(k_{y}, \omega_{\tau} ; v_{m+g}\right)P(ky,ωτ;vm+g).
(f) Apply 2-D inverse Fourier transform to obtain the migration velocity volume P ( y , τ , v mig ) P y , τ , v mig  P(y,tau,v_("mig "))P\left(y, \tau, v_{\text {mig }}\right)P(y,τ,vmig ).
A variation of Fowler's sequerce described above involves creating the CVS cube directly from DMOcorrected data.
(a) Start with data P ( y , h , t ) P ( y , h , t ) P(y,h,t)P(y, h, t)P(y,h,t) in coordinates of midpoint y y yyy, offset 2 h 2 h 2h2 h2h and event time t t ttt in the unmigrated position, and apply DMO correction followed by inverse NMO correction.
(b) Create constant-velocity stack (CVS) volume P ( y , v D M O , t 0 ) P y , v D M O , t 0 P(y,v_(DMO),t_(0))P\left(y, v_{D M O}, t_{0}\right)P(y,vDMO,t0) using a range of velocities v D M O v D M O v_(DMO)v_{D M O}vDMO, where t 0 t 0 t_(0)t_{0}t0 is the event time after constant-velocity normal moveout correction (Figure 5.4-36a).
(text continues on p. 815)
FIG. 5.4-36. (a) A velocity cube computed from DMO-corrected gathers; (b) the same data as in (a) after Stolt migration of each of the constant-velocity panels.
FIG. 5.4-37. (a) A time slice from the migration velocity cube shown in Figure 5.4-36h, (b) the same time slice as in (a) with velocity picking. Red and dark blue curves correspond to primaries and multiples, respectively.
FIG. 5.4-38. (a) Velocity strands picked from the time slices of the migration velocity cube shown in Figure 5.4-36b as demonstrated in Figure 5.4-37b; (b) the color-coded velocity field computed by interpolation of the velocity strands shown in (a).
FIG. 5.4-39. (a) The prestack time-migrated section extracted from the migration velocity cube of Figure 5.4-36b coincident with the surface that corresponds to the velocity field in Figure 5.4-38b, (b) the same soction as in (a) with the viewing axis perpendicular to the plane of the paper.
FIG. 5.4-40. The prestack time-migrated section as in Figure 5.4-39b collapsed onto a 2-D section.
FIG. 5.4-41. (a) A migration velocity volume, (b) the same volune viewed end-on showing the vertical variat velocity at a given CMP location.
FIG. 5.4-42. (a) A time slice from the migration veiocity volume shown in Figure 5.4-41a with the interpretation of the rms velocity as a function of midprint lecation, (b) the migration velocity volume as in Figure 5.4-41a with the picknd velocity strands as in (a).
FIG. 5.4-43. (a) The color-coded optimum rms velocity surface extracted from the migration velocity volume shown in Figure 5.4 41 a 5.4 41 a 5.4-41a5.4-41 \mathrm{a}5.441a, (b) the same view as in Figure 5.4 41 b 5.4 41 b 5.4-41b5.4-41 \mathrm{~b}5.441 b with the intersection of the rms velocity surface showing the vertical velocity variation at a given CMP location.
FIG. 5.4-44. (a) The image surface associated with prestack time migration that was extracted from the migration velocity volume shown in Figure 5.4-41a by sculpting the amplitudes over the rms velocity surface shown in Figure 5.4-43a, (b) the image surface as in (a) after collapeing it onto a 2-D section associated with prestack time migration.
FIG. 5.4-45. A close-up view of the prestack time-migrated section as in Figure 5.4-44b.
(c) Sort the CVS volume P ( y , v D M O , t 0 ) P y , v D M O , t 0 P(y,v_(DMO),t_(0))P\left(y, v_{D M O}, t_{0}\right)P(y,vDMO,t0) into a set of cosntant-velocity stacked sections P ( y , f 0 ; v D M O ) P y , f 0 ; v D M O P(y,f_(0);v_(DMO))P\left(y, f_{0} ; v_{D M O}\right)P(y,f0;vDMO).
(d) Apply 2-D Fourier transform to obtain the CVS cube P ( k y , v D M O , ω i j ) P k y , v D M O , ω i j P(k_(y),v_(DMO),omega_(ij))P\left(k_{y}, v_{D M O}, \omega_{i j}\right)P(ky,vDMO,ωij) in the frequencywavenumber domain, where k y k y k_(y)k_{y}ky and ω ω omega\omegaω are the Fourier transform variables associated with the variables y y yyy and t 0 t 0 t_(0)t_{0}t0.
(e) Sort the CVS volume P ( k y , v D M O , ω 0 ) P k y , v D M O , ω 0 P(k_(y),v_(DMO),omega_(0))P\left(k_{y}, v_{D M O}, \omega_{0}\right)P(ky,vDMO,ω0) into a set of constant-velocity sections P ( k y , ω 0 ; v D M O ) P k y , ω 0 ; v D M O P(k_(y),omega_(0);v_(DMO))P\left(k_{y}, \omega_{0} ; v_{D M O}\right)P(ky,ω0;vDMO).
(i) Migrate each of the constant-velocity sections of the DMO velocity volume by performing the Stolt mapping based on equations (5-46) and (5-47) so as to obtain the migration velocity volume P ( k y , ω τ ; v m ; g ) P k y , ω τ ; v m ; g P(k_(y),omega_(tau);v_(m;g))P\left(k_{y}, \omega_{\tau} ; v_{m ; g}\right)P(ky,ωτ;vm;g).
(g) Apply 2-D inverse Fourier transform to obtain the migration velocity volume P ( y , τ , v r π z g ) P y , τ , v r π z g P(y,tau,v_(r pi zg))P\left(y, \tau, v_{r \pi z g}\right)P(y,τ,vrπzg) (Figure 5.4-36b).
The migration velocity volume P ( y , τ , v mag ) P y , τ , v mag  P(y,tau,v_("mag "))P\left(y, \tau, v_{\text {mag }}\right)P(y,τ,vmag ) shown in Figure 5.4 36 b 5.4 36 b 5.4-36b5.4-36 \mathrm{~b}5.436 b can be visualized and interpreted to derive a migration velocity field. For spatial consistency, velocity picking should be done on time slices from the migration velocity volume as shown in Figure 5.4-37. The resulting velocity strands shown in Figure 5.4 38 5.4 38 5.4-385.4-385.438 a are interpolated to create the migration velocity field shown in Figure 5.4-38b. This velocity field then can be used to extract from the volume the section that corresponds to prestack time migration as shown in Figure 5.4-39. An enlarged view of this section is shown in Figure 5.4-40. Note the excellent imaging of the steeply dipping fault planes which conflict with the gently dipping strata.
Alternatively, the plane of ( v tng , τ v tng  , τ v_("tng "),tauv_{\text {tng }}, \tauvtng ,τ ) for each midpoint y y yyy can be inverse transformed to the plane of ( h , τ ) ( h , τ ) (h,tau)(h, \tau)(h,τ) associated with the common-refection-point gather derived from prestack time migration. This is then followed by conventional normal-moveout correction and stacking. The resulting section, again, represents the image from prestack time migration.
The data example shown in Figure 5.4-36 demonstrates the use of the migration velocity volume in deriving a high-fidelity image of fault planes from prestack time migration (Figure 5.4-40). The data example shown in Figure 5.4-41 demonstrates the use of the migration velocity volume in imaging steeply dipping event. The migration velocity volume was created using the procedure described above. Specifically, the DMO-corrected CMP gathers were first NMO-corrected using a range of constant velocities and a CVS volume was created. Next, each constant-velocity stacked section was migrated using the Stolt mothod and the constant velocity associated with that section. The resulting migration velocity volume is shown in Figure 5.4-41. Note the vertical variation in velocities on the end-on view of the volume that represents the plane of velocity versus time.
The migration velocity volume is interpreted by picking the primary velocity trend from selected time slices as shown in Figure 5.4-42a. Note the lateral variation in velocities which is captured by continuous picking along the midpoint axis. By interpolating the velocity strands resulting from the interpretation of selected time slices (Figure 5.442a), an rms velocity surface is generated. The picked velocity strands are shown in Figure 5.4 42 b 5.4 42 b 5.4-42b5.4-42 \mathrm{~b}5.442 b embedded within the migration velocity volume, and the rms velocity field is shown in Figure 5.4 43 a 43 a 43a43 \mathrm{a}43a as a color-coded surface extracted from within the migration velocity volume. A quality control of the rms velocity surface can be made by intersecting it with the cross-sections of the migration velocity volume at selected CMP locations as shown in Figure 5.4-43b.
The prestack time-migrated section is a by-product of the migration velocity analysis described here. Specifically, the image surface associated with the prestack time migration is obtained by sculpting the amplitudes from within the migration velocity volume over the rms velocity surface as shown in Figure 5.4-44a. The conventional 2-D display of the prestack time-migrated section is then created by simply collapsing the sculpted image surface onto a 2-D plane (Figure 5.4-44b). A close-up view of the prestack time-migrated section shows accurate imaging of the steeply dipping event (Figure 5.4 45 ) 45 ) 45)45)45).

EXERCISES

Exercise 5-1. Consider the application of DMO correction to data referred to a floating datum represented by a smooth form of an irregular topographic surface and data referenced to a flat datum below. Which DMO correction would have more effect on the data?
Exercise 5-2. Refer to Fowler's velocityindependent prestack migration technique for migration velocity analysis described in Section 5.4. Suppose you have transformed the prestack data from offset to velocity space using 30 constant velocity values from 2000 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s to 4900 m / s 4900 m / s 4900m//s4900 \mathrm{~m} / \mathrm{s}4900 m/s using an increment of 100 m / s 100 m / s 100m//s100 \mathrm{~m} / \mathrm{s}100 m/s. Can you create additional constant-velocity panels such that the increment is 50 m / s 50 m / s 50m//s50 \mathrm{~m} / \mathrm{s}50 m/s by poststack migration rather than prestack migration or trace interpolation? If so, what velocity would you use for poststack migration to create the panel for 3050 m / s 3050 m / s 3050-m//s3050-\mathrm{m} / \mathrm{s}3050m/s velocity.
Exercise 5-3. Derive Bancroft's equivalent offset equation ( E 7 2 b E 7 2 b E-72b\mathrm{E}-\mathbf{7 2 b}E72b ) from the nonzero-offset traveltime equation (E-67).
Exercise 5-4. Suppose you have two events with conflicting dips of the same magnitude, but in opposite directions, associated with a reflector within a fault block and the fault plane itself. Can these two events be distinguished on a velocity spectrum computed from a CMP gather before DMO correction at a location just above the surface point where the two events intersect one another?

Appendix E E E\mathbf{E}E
TOPICS IN DIP-MOVEOUT CORRECTION AND PRESTACK TIME MIGRATION

E. 1 Reflection Point Dispersal

We start the analysis using the geomctry of Figure E-1. Place the source S S SSS at the origin ( 0 , 0 ) ( 0 , 0 ) (0,0)(0,0)(0,0), and denote the coordinates of the points of interest as N : ( x 0 = S K , x 0 = K N ) , H : ( x 1 = N : x 0 = S K , x 0 = K N , H : x 1 = N:(x_(0)=SK,x_(0)=KN),H:(x_(1)=:}N:\left(x_{0}=S K, x_{0}=K N\right), H:\left(x_{1}=\right.N:(x0=SK,x0=KN),H:(x1= S B , z 1 = B H ) , F : ( x 2 = S A , z 2 = A F ) S B , z 1 = B H , F : x 2 = S A , z 2 = A F {:SB,z_(1)=BH),F:(x_(2)=SA,z_(2)=AF)\left.S B, z_{1}=B H\right), F:\left(x_{2}=S A, z_{2}=A F\right)SB,z1=BH),F:(x2=SA,z2=AF), and R : ( x 3 = S Q , z 3 = Q R ) R : x 3 = S Q , z 3 = Q R R:(x_(3)=SQ,z_(3)=QR)R:\left(x_{3}=S Q, z_{3}=Q R\right)R:(x3=SQ,z3=QR). Our objective is to compute the coordinates for the normal-incidence reflection point N : ( x 0 , z 0 ) N : x 0 , z 0 N:(x_(0),z_(0))N:\left(x_{0}, z_{0}\right)N:(x0,z0) associated with midpoint M M MMM, and the reflection point R : ( x 3 , z 3 ) R : x 3 , z 3 R:(x_(3),z_(3))R:\left(x_{3}, z_{3}\right)R:(x3,z3) associated with the nonzero-offset source receiver separation x = S G x = S G x=SGx=S Gx=SG.
First, we compute the coordinates for N : ( x 0 , z 0 ) N : x 0 , z 0 N:(x_(0),z_(0))N:\left(x_{0}, z_{0}\right)N:(x0,z0). From the geometry of Figure E-1, first, note that x 0 = S K x 0 = S K x_(0)=SKx_{0}=S Kx0=SK and z 0 = K N z 0 = K N z_(0)=KNz_{0}=K Nz0=KN. Then, from the triangle M K N M K N MKNM K NMKN, we have
M K M N ¯ = cos α M K M N ¯ = cos α (MK)/(M( bar(N)))=cos alpha\frac{M K}{M \bar{N}}=\cos \alphaMKMN¯=cosα
which, by way of M K = x 0 x / 2 M K = x 0 x / 2 MK=x_(0)-x//2M K=x_{0}-x / 2MK=x0x/2, yields
M N = x 0 x / 2 cos α M N = x 0 x / 2 cos α MN=(x_(0)-x//2)/(cos alpha)M N=\frac{x_{0}-x / 2}{\cos \alpha}MN=x0x/2cosα
Similarly, from the same triangle M K N M K N MKNM K NMKN, we have
K N M N = cos ϕ K N M N = cos ϕ (KN)/(MN)=cos phi\frac{K N}{M N}=\cos \phiKNMN=cosϕ
which, by way of K N = z 0 K N = z 0 KN=z_(0)K N=z_{0}KN=z0, yields
M N = z 0 cos ϕ M N = z 0 cos ϕ MN=(z_(0))/(cos phi)M N=\frac{z_{0}}{\cos \phi}MN=z0cosϕ
Finally, combine equations ( E 1 a E 1 a E-1a\mathrm{E}-1 \mathrm{a}E1a ) and (E-1b) to get a relation between x 0 x 0 x_(0)x_{0}x0 and z 0 z 0 z_(0)z_{0}z0
x 0 x / 2 cos α = z 0 cos ϕ x 0 x / 2 cos α = z 0 cos ϕ (x_(0)-x//2)/(cos alpha)=(z_(0))/(cos phi)\frac{x_{0}-x / 2}{\cos \alpha}=\frac{z_{0}}{\cos \phi}x0x/2cosα=z0cosϕ
Next, write the equation of the line that represents the dipping reflector in terms of the directional casines and the normal d = S C d = S C d=SCd=S Cd=SC to the line from the origin S S SSS
x 0 cos α + z 0 cos ϕ = d . x 0 cos α + z 0 cos ϕ = d . x_(0)cos alpha+z_(0)cos phi=d.x_{0} \cos \alpha+z_{0} \cos \phi=d .x0cosα+z0cosϕ=d.
Solve for z 0 z 0 z_(0)z_{0}z0 from equation (E-2a) and substitute into equation ( E 2 b E 2 b E-2b\mathbf{E}-2 \mathrm{~b}E2 b )
x 0 cos α + ( x 0 x 2 ) cos 2 ϕ cos α = d x 0 cos α + x 0 x 2 cos 2 ϕ cos α = d x_(0)cos alpha+(x_(0)-(x)/(2))(cos^(2)phi)/(cos alpha)=dx_{0} \cos \alpha+\left(x_{0}-\frac{x}{2}\right) \frac{\cos ^{2} \phi}{\cos \alpha}=dx0cosα+(x0x2)cos2ϕcosα=d
Note that the directional cosines satisfy the relation cos 2 α + cos 2 ϕ = 1 cos 2 α + cos 2 ϕ = 1 cos^(2)alpha+cos^(2)phi=1\cos ^{2} \alpha+\cos ^{2} \phi=1cos2α+cos2ϕ=1. By making use of this relation, simplify equation ( E 3 E 3 (E-3:}\left(\mathrm{E}-3\right.(E3 ) to get the final expression for the coordinate x 0 x 0 x_(0)x_{0}x0
x 0 = d cos α + x 2 cos 2 ϕ x 0 = d cos α + x 2 cos 2 ϕ x_(0)=d cos alpha+(x)/(2)cos^(2)phix_{0}=d \cos \alpha+\frac{x}{2} \cos ^{2} \phix0=dcosα+x2cos2ϕ
Finally, substitute x 0 x 0 x_(0)x_{0}x0 back into equation (E-2a) to get the expression for the coordinatc z 0 z 0 z_(0)z_{0}z0
z 0 = d cos ϕ x 2 cos α cos ϕ . z 0 = d cos ϕ x 2 cos α cos ϕ . z_(0)=d cos phi-(x)/(2)cos alpha cos phi.z_{0}=d \cos \phi-\frac{x}{2} \cos \alpha \cos \phi .z0=dcosϕx2cosαcosϕ.
FIG. E-1. Geometry of a dipping reflector to derive the expression for reflection-point dispersal (Section E.1).
The distance d = S C d = S C d=SCd=S Cd=SC is given by
d = S U + U C d = S U + U C d=SU+UCd=S U+U Cd=SU+UC
which can be rewritten using the geometry of Figure E-1 as follows:
d = S M cos α + M N d = S M cos α + M N d=SM cos alpha+MNd=S M \cos \alpha+M Nd=SMcosα+MN
Substitute the definitions S M = x / 2 S M = x / 2 SM=x//2S M=x / 2SM=x/2 and D = M N D = M N D=MND=M ND=MN, where D D DDD is the distance along the normalincident raypath from the point N N NNN on the reflector to the midpoint location M M MMM, to obtain the relation between d d ddd and D D DDD
d = D + x 2 cos α d = D + x 2 cos α d=D+(x)/(2)cos alphad=D+\frac{x}{2} \cos \alphad=D+x2cosα
Make the further substitution of equation ( E 5 E 5 E-5E-5E5 ) into equations ( E 4 a E 4 a E-4aE-4 aE4a ) and (E-4b), and recall that cos 2 α + cos 2 ϕ = 1 cos 2 α + cos 2 ϕ = 1 cos^(2)alpha+cos^(2)phi=1\cos ^{2} \alpha+\cos ^{2} \phi=1cos2α+cos2ϕ=1 to derive the expressions for the coordinates of N : ( x 0 , z 0 ) N : x 0 , z 0 N:(x_(0),z_(0))N:\left(x_{0}, z_{0}\right)N:(x0,z0) in terms of D
and
x 0 = D cos α + x 2 ( E 6 a ) x 0 = D cos α + x 2 ( E 6 a ) x_(0)=D cos alpha+(x)/(2)quad(E-6a)x_{0}=D \cos \alpha+\frac{x}{2} \quad(E-6 a)x0=Dcosα+x2(E6a)
z 0 = D cos ϕ z 0 = D cos ϕ z_(0)=D cos phiz_{0}=D \cos \phiz0=Dcosϕ
To derive the expressions for the coordinates of R : ( x 3 , z 3 ) R : x 3 , z 3 R:(x_(3),z_(3))R:\left(x_{3}, z_{3}\right)R:(x3,z3), we note that R R RRR is the intersection of the line defined by the reflecting interface, which yields the relation
x 3 cos α + z 3 cos ϕ = d x 3 cos α + z 3 cos ϕ = d x_(3)cos alpha+z_(3)cos phi=dx_{3} \cos \alpha+z_{3} \cos \phi=dx3cosα+z3cosϕ=d
and the line S R F S R F SRFS R FSRF, which yields the relation
x 3 x 2 = z 3 z 2 x 3 x 2 = z 3 z 2 (x_(3))/(x_(2))=(z_(3))/(z_(2))\frac{x_{3}}{x_{2}}=\frac{z_{3}}{z_{2}}x3x2=z3z2
where ( x 2 , z 2 ) x 2 , z 2 (x_(2),z_(2))\left(x_{2}, z_{2}\right)(x2,z2) are the coordinates of F F FFF. From the geometry of Figure E 1 E 1 E-1\mathbf{E}-1E1, first, note that x 2 = S A , z 2 = A F x 2 = S A , z 2 = A F x_(2)=SA,z_(2)=AFx_{2}=S A, z_{2}=A Fx2=SA,z2=AF, and x 3 = S Q x 3 = S Q x_(3)=SQx_{3}=S Qx3=SQ and z 3 = Q R z 3 = Q R z_(3)=QRz_{3}=Q Rz3=QR.
Solve equation (E-7b) for x 3 x 3 x_(3)x_{3}x3 and substitute into cquation (E-7a) to get
z 3 = z 2 x 2 cos α + z 2 cos ϕ d z 3 = z 2 x 2 cos α + z 2 cos ϕ d z_(3)=(z_(2))/(x_(2)cos alpha+z_(2)cos phi)dz_{3}=\frac{z_{2}}{x_{2} \cos \alpha+z_{2} \cos \phi} dz3=z2x2cosα+z2cosϕd
The coordinates for F : ( x 2 , z 2 ) F : x 2 , z 2 F:(x_(2),z_(2))F:\left(x_{2}, z_{2}\right)F:(x2,z2) are derived in Section C.3 (equations C-18c,d)
x 2 = 2 ( d x cos α ) cos α + x x 2 = 2 ( d x cos α ) cos α + x x_(2)=2(d-x cos alpha)cos alpha+xx_{2}=2(d-x \cos \alpha) \cos \alpha+xx2=2(dxcosα)cosα+x
and
z 2 = 2 ( d x cos α ) cos ϕ z 2 = 2 ( d x cos α ) cos ϕ z_(2)=2(d-x cos alpha)cos phiz_{2}=2(d-x \cos \alpha) \cos \phiz2=2(dxcosα)cosϕ
Substitute equations (E-9a) and ( E 9 b E 9 b E-9b\mathrm{E}-9 \mathrm{~b}E9 b ) into equation (E-8), and replace d d ddd via equation (E-5) to obtain, after some involved algebra, the expression for z 3 z 3 z_(3)z_{3}z3
z 3 = D cos ϕ x 2 4 D cos 2 α cos ϕ z 3 = D cos ϕ x 2 4 D cos 2 α cos ϕ z_(3)=D cos phi-(x^(2))/(4D)cos^(2)alpha cos phiz_{3}=D \cos \phi-\frac{x^{2}}{4 D} \cos ^{2} \alpha \cos \phiz3=Dcosϕx24Dcos2αcosϕ
Back substitution of equation (E-10a) into equation (E-7a) then yields the expression for x 3 x 3 x_(3)x_{3}x3
x 3 = D cos α + x 2 + x 2 4 D sin 2 α cos α x 3 = D cos α + x 2 + x 2 4 D sin 2 α cos α x_(3)=D cos alpha+(x)/(2)+(x^(2))/(4D)sin^(2)alpha cos alphax_{3}=D \cos \alpha+\frac{x}{2}+\frac{x^{2}}{4 D} \sin ^{2} \alpha \cos \alphax3=Dcosα+x2+x24Dsin2αcosα
Knowing the coordinates of N : ( x 0 , z 0 ) N : x 0 , z 0 N:(x_(0),z_(0))N:\left(x_{0}, z_{0}\right)N:(x0,z0) and R : ( x 3 , z 3 ) R : x 3 , z 3 R:(x_(3),z_(3))R:\left(x_{3}, z_{3}\right)R:(x3,z3), the distance Δ N R Δ N R Delta-NR\Delta-N RΔNR can now be computed
Δ = ( x 3 x 0 ) 2 + ( z 3 z 0 ) 2 . Δ = x 3 x 0 2 + z 3 z 0 2 . Delta=sqrt((x_(3)-x_(0))^(2)+(z_(3)-z_(0))^(2)).\Delta=\sqrt{\left(x_{3}-x_{0}\right)^{2}+\left(z_{3}-z_{0}\right)^{2}} .Δ=(x3x0)2+(z3z0)2.
Substitute equations ( E 10 a E 10 a E-10a\mathrm{E}-10 \mathrm{a}E10a ) and ( E 10 b ) E 10 b ) E-10b)\mathrm{E}-10 \mathrm{~b})E10 b) for the coordinates of R : ( x 3 , z 3 ) R : x 3 , z 3 R:(x_(3),z_(3))R:\left(x_{3}, z_{3}\right)R:(x3,z3), and equations (E-6a) and (E-6b) for the coordinates of N : ( x 0 , x 0 ) N : x 0 , x 0 N:(x_(0),x_(0))N:\left(x_{0}, x_{0}\right)N:(x0,x0) into equation (E-1la) and carry out the algebraic steps to get the final expression
Δ = x 2 4 D sin α cos α Δ = x 2 4 D sin α cos α Delta=(x^(2))/(4D)sin alpha cos alpha\Delta=\frac{x^{2}}{4 D} \sin \alpha \cos \alphaΔ=x24Dsinαcosα
Equation (E-11b) represents the reflection point smear, otherwise known as reflection point dispersal (Deregowski, 1981) - the distance between the normal-incidence reflection point N N NNN associated with the zero-offset raypath from midpoint M M MMM, and the reflection point R R RRR associated with the nonzero-offset raypath for a source-receiver pair separated by an offset x x xxx. For the case of zero-offset x = 0 x = 0 x=0x=0x=0, reflection point smear Δ Δ Delta\DeltaΔ vanishes.
Define the two-way zero-offset time t 0 t 0 t_(0)t_{0}t0 at midpoint M M MMM as the time associated with the normal-incidence raypath M N M N MNM NMN by the relation v t 0 / 2 = D v t 0 / 2 = D vt_(0)//2=Dv t_{0} / 2=Dvt0/2=D. Then use this relation in equation (E-11b) to obtain the expression for reflection point dispersal Δ Δ Delta\DeltaΔ in terms of t 0 t 0 t_(0)t_{0}t0
Δ = x 2 2 v t 0 sin α cos α Δ = x 2 2 v t 0 sin α cos α Delta=(x^(2))/(2vt_(0))sin alpha cos alpha\Delta=\frac{x^{2}}{2 v t_{0}} \sin \alpha \cos \alphaΔ=x22vt0sinαcosα
This equation is applicable to the general case of three-dimensional geometry (Figure 3.1-14), where α α alpha\alphaα is the angle between the normal to the dipping reflector surface and the direction of the profile line (Levin, 1971).
For the 2-D geometry of the dipping refiector (Figure E-1, note that
sin α = cos ϕ sin α = cos ϕ sin alpha=cos phi\sin \alpha=\cos \phisinα=cosϕ
where ϕ ϕ phi\phiϕ is the dip angle of the reflector. Hence, equation (E-12) is written in tertns of the reflector dip angle ϕ ϕ phi\phiϕ as follows:
Δ = x 2 2 v t 0 cos ϕ sin ϕ Δ = x 2 2 v t 0 cos ϕ sin ϕ Delta=(x^(2))/(2vt_(0))cos phi sin phi\Delta=\frac{x^{2}}{2 v t_{0}} \cos \phi \sin \phiΔ=x22vt0cosϕsinϕ
Equation (E-14), by way of equation (5-6), is the same as equation (5-10) of the main text with offset x = 2 h x = 2 h x=2hx=2 hx=2h.

E. 2 Equations for DMO Correction

In this section, we shall derive the traveltime equation for dip-moveout (DMO) correction by using the geometry of Figure 5.1-1. Start with equation (C-22b) of Section C.3 which defines the traveltime t t ttt from source location S S SSS to the reflection point R R RRR to the receiver location G G GGG, written in prestack data coordinates
t 2 = t 0 2 + 4 h 2 cos 2 ϕ v 2 t 2 = t 0 2 + 4 h 2 cos 2 ϕ v 2 t^(2)=t_(0)^(2)+(4h^(2)cos^(2)phi)/(v^(2))t^{2}=t_{0}^{2}+\frac{4 h^{2} \cos ^{2} \phi}{v^{2}}t2=t02+4h2cos2ϕv2
where 2 h 2 h 2h2 h2h is the offset, v v vvv is the medium volocity above the reflector, ϕ ϕ phi\phiϕ is the reflector dip, and t 0 t 0 t_(0)t_{0}t0 is the two-way zero-offset time at madpont location y n y n y_(n)y_{n}yn. Dip-moveout correction is preceded by normal-moveout (NMO) correction using the dip-independent velocity v v vvv
t 2 = t n 2 + 4 h 2 v 2 t 2 = t n 2 + 4 h 2 v 2 t^(2)=t_(n)^(2)+(4h^(2))/(v^(2))t^{2}=t_{n}^{2}+\frac{4 h^{2}}{v^{2}}t2=tn2+4h2v2
where t n t n t_(n)t_{n}tn is the event time after the NMO correction. To relate event time t n t n t_(n)t_{n}tn after the NMO correction and event time t 0 t 0 t_(0)t_{0}t0, first, write cquation (E-15a) as
t 2 = t 0 2 + 4 h 2 v 2 4 h 2 sin 2 ϕ v 2 t 2 = t 0 2 + 4 h 2 v 2 4 h 2 sin 2 ϕ v 2 t^(2)=t_(0)^(2)+(4h^(2))/(v^(2))-(4h^(2)sin^(2)phi)/(v^(2))t^{2}=t_{0}^{2}+\frac{4 h^{2}}{v^{2}}-\frac{4 h^{2} \sin ^{2} \phi}{v^{2}}t2=t02+4h2v24h2sin2ϕv2
Set the right-hand sides of equations (E-15b) and (E-16) equal and simplify the result to obtain the dip-dependent moveout equation
t n 2 = t 0 2 4 h 2 sin 2 ϕ v 2 t n 2 = t 0 2 4 h 2 sin 2 ϕ v 2 t_(n)^(2)=t_(0)^(2)-(4h^(2)sin^(2)phi)/(v^(2))t_{n}^{2}=t_{0}^{2}-\frac{4 h^{2} \sin ^{2} \phi}{v^{2}}tn2=t024h2sin2ϕv2
Equations (E-15b) and (E-17) suggest that moveout correction can, in principle, be performed in two steps:
(a) Apply a dip-independent moveout corrction using equation (E-15b) to map event time t t ttt to event time t n t n t_(n)t_{n}tn.
(b) Apply a dip-dependent moveout correction using equation (E-17) to map event time t n t n t_(n)t_{n}tn to event time t 0 t 0 t_(0)t_{0}t0.
This two-step moveout correction is equivalent to the one-step moveout correction using equation (E-15a) to map event time t t ttt directly to cvent time t 0 t 0 t_(0)t_{0}t0.
Our goal, however, is to map event time t t ttt to τ 0 τ 0 tau_(0)\tau_{0}τ0 - two-way zero-offset time, not at midpoint location y n y n y_(n)y_{n}yn associated with the source-receiver pair S G S G S-GS-GSG, but at midpoint location y 0 y 0 y_(0)y_{0}y0 associated with the normal-incidence reflection point R R RRR. This mapping requires coordinate transformation of moveout-corrected prestack data P n ( y n , t n ; h ) P n y n , t n ; h P_(n)(y_(n),t_(n);h)P_{n}\left(y_{n}, t_{n} ; h\right)Pn(yn,tn;h) to P 0 ( y 0 , τ 0 ; h ) P 0 y 0 , τ 0 ; h P_(0)(y_(0),tau_(0);h)P_{0}\left(y_{0}, \tau_{0} ; h\right)P0(y0,τ0;h). Therefore, we need to compute the coordinates ( y 0 , τ 0 ) y 0 , τ 0 (y_(0),tau_(0))\left(y_{0}, \tau_{0}\right)(y0,τ0) in terms of the coordinates ( y n , t n ) y n , t n (y_(n),t_(n))\left(y_{n}, t_{n}\right)(yn,tn).
From the geometry of Figure 5.1-1, note that
y 0 = y n Δ cos ϕ y 0 = y n Δ cos ϕ y_(0)=y_(n)-(Delta)/(cos phi)y_{0}=y_{n}-\frac{\Delta}{\cos \phi}y0=ynΔcosϕ
where Δ = N R Δ = N R Delta=NR\Delta=N RΔ=NR is the distance along the reflector between the normal-incidence reflection point N N NNN associated with the zero-offset raypath from midpoint y n y n y_(n)y_{n}yn and the reflection point R R RRR associated with the nonzero-offset raypath for a source-receiver pair separated by an offset 2 h 2 h 2h2 h2h.
Adapt equation (E-14) of Section E. 1 for the prestack data coordinates x = 2 h x = 2 h x=2hx=2 hx=2h
Δ = 2 h 2 v t 0 cos ϕ sin ϕ Δ = 2 h 2 v t 0 cos ϕ sin ϕ Delta=(2h^(2))/(vt_(0))cos phi sin phi\Delta=\frac{2 h^{2}}{v t_{0}} \cos \phi \sin \phiΔ=2h2vt0cosϕsinϕ
and substitute into equation ( E 18 E 18 E-18E-18E18 ) to obtain
y 0 = y n h 2 t 0 ( 2 sin ϕ v ) y 0 = y n h 2 t 0 2 sin ϕ v y_(0)=y_(n)-(h^(2))/(t_(0))((2sin phi)/(v))y_{0}=y_{n}-\frac{h^{2}}{t_{0}}\left(\frac{2 \sin \phi}{v}\right)y0=ynh2t0(2sinϕv)
Solve cquation (E-17) for t 0 t 0 t_(0)t_{0}t0 and write the result in the following form
t 0 = t n 1 + h 2 t n 2 ( 2 sin ϕ v ) 2 t 0 = t n 1 + h 2 t n 2 2 sin ϕ v 2 t_(0)=t_(n)sqrt(1+(h^(2))/(t_(n)^(2))((2sin phi)/(v))^(2))t_{0}=t_{n} \sqrt{1+\frac{h^{2}}{t_{n}^{2}}\left(\frac{2 \sin \phi}{v}\right)^{2}}t0=tn1+h2tn2(2sinϕv)2
or
t 0 = t n A , t 0 = t n A t_(0)=t_(n)A", "t_{0}=t_{n} A \text {, }t0=tnA
where
A = 1 + h 2 t n 2 ( 2 sin ϕ v ) 2 A = 1 + h 2 t n 2 2 sin ϕ v 2 A=sqrt(1+(h^(2))/(t_(n)^(2))((2sin phi)/(v))^(2))A=\sqrt{1+\frac{h^{2}}{t_{n}^{2}}\left(\frac{2 \sin \phi}{v}\right)^{2}}A=1+h2tn2(2sinϕv)2
Now, substitute equation (E-22) into equation (E-20) to get the final expression for y 0 y 0 y_(0)y_{0}y0
y 0 = y n 2 t n A ( 2 sin ϕ v ) y 0 = y n 2 t n A 2 sin ϕ v y_(0)=y_(n)-(ℏ^(2))/(t_(n)A)((2sin phi)/(v))y_{0}=y_{n}-\frac{\hbar^{2}}{t_{n} A}\left(\frac{2 \sin \phi}{v}\right)y0=yn2tnA(2sinϕv)
Also from the geometry of Figure 5.1-1, note that
τ 0 = t 0 2 Δ tan ϕ v τ 0 = t 0 2 Δ tan ϕ v tau_(0)=t_(0)-(2Delta tan phi)/(v)\tau_{0}=t_{0}-\frac{2 \Delta \tan \phi}{v}τ0=t02Δtanϕv
Substitute equation ( E 19 E 19 E-19\mathrm{E}-19E19 ) for Δ Δ Delta\DeltaΔ and carry out the required algebra to get the desired expression for τ 0 τ 0 tau_(0)\tau_{0}τ0 in terrms of t 0 t 0 t_(0)t_{0}t0
τ 0 = t 0 h 2 t 0 ( 2 sin ϕ v ) 2 τ 0 = t 0 h 2 t 0 2 sin ϕ v 2 tau_(0)=t_(0)-(h^(2))/(t_(0))((2sin phi)/(v))^(2)\tau_{0}=t_{0}-\frac{h^{2}}{t_{0}}\left(\frac{2 \sin \phi}{v}\right)^{2}τ0=t0h2t0(2sinϕv)2
Now, substitute equation ( E 22 ) E 22 ) E-22)\mathrm{E}-22)E22) into equation ( E 26 E 26 E-26\mathrm{E}-26E26 )
τ o = t n A h 2 t n A ( 2 sin ϕ v ) 2 τ o = t n A h 2 t n A 2 sin ϕ v 2 tau_(o)=t_(n)A-(h^(2))/(t_(n)A)((2sin phi)/(v))^(2)\tau_{\mathrm{o}}=t_{n} A-\frac{h^{2}}{t_{n} A}\left(\frac{2 \sin \phi}{v}\right)^{2}τo=tnAh2tnA(2sinϕv)2
Finally, simplify equation (E-27) by way of equation (E-23) to obtain the desired expression for τ 0 τ 0 tau_(0)\tau_{0}τ0 in terms of t n t n t_(n)t_{n}tn
τ 0 = t n A τ 0 = t n A tau_(0)=(t_(n))/(A)\tau_{0}=\frac{t_{n}}{A}τ0=tnA
We now remind oursolves of our objective to transform the normal-moveout-corrected prestack data P n ( y n , t n ; h ) P n y n , t n ; h P_(n)(y_(n),t_(n);h)P_{n}\left(y_{n}, t_{n} ; h\right)Pn(yn,tn;h) from y n t n y n t n y_(n)-t_(n)y_{n}-t_{n}yntn coordinates to y 0 τ 0 y 0 τ 0 y_(0)-tau_(0)y_{0}-\tau_{0}y0τ0 coordinates so as to obtain the dip-moveout-corrected data P 0 ( y 0 , τ 0 ; h ) P 0 y 0 , τ 0 ; h P_(0)(y_(0),tau_(0);h)P_{0}\left(y_{0}, \tau_{0} ; h\right)P0(y0,τ0;h). The transformation is done using equations (E-24) and (E-28) which relate the input data coordinates y n t n y n t n y_(n)-t_(n)y_{n}-t_{n}yntn to output data coordinates y 0 τ 0 y 0 τ 0 y_(0)-tau_(0)y_{0}-\tau_{0}y0τ0. Note, however, equations (E-24) and (E-28) require knowledge of the reflector dip ϕ ϕ phi\phiϕ. To circumvent this requirement, we use the relation from Section D. 1
sin ϕ = v k y 2 ω 0 sin ϕ = v k y 2 ω 0 sin phi=(vk_(y))/(2omega_(0))\sin \phi=\frac{v k_{y}}{2 \omega_{0}}sinϕ=vky2ω0
which states that the reflector dip ϕ ϕ phi\phiϕ can be expressed in terms of wavenumber k y k y k_(y)k_{y}ky and frequency ω 0 ω 0 omega_(0)\omega_{0}ω0, which are the Fourier duals of midpoint y 0 y 0 y_(0)y_{0}y0 and event time τ 0 τ 0 tau_(0)\tau_{0}τ0, respectively. The variables y 0 y 0 y_(0)y_{0}y0 and τ 0 τ 0 tau_(0)\tau_{0}τ0 defined by equations ( E 24 E 24 E-24\mathrm{E}-24E24 ) and ( E 28 E 28 E-28\mathrm{E}-28E28 ), respectively, are associated with the zero-ofset section after DMO correction. By way of equation (E-29), these equations are recast explicitly independent of reflector dip as
y 0 = y n h 2 k y t n A ω 0 y 0 = y n h 2 k y t n A ω 0 y_(0)=y_(n)-(h^(2)k_(y))/(t_(n)Aomega_(0))y_{0}=y_{n}-\frac{h^{2} k_{y}}{t_{n} A \omega_{0}}y0=ynh2kytnAω0
and
τ 0 = t n A τ 0 = t n A tau_(0)=(t_(n))/(A)\tau_{0}=\frac{t_{n}}{A}τ0=tnA
where A A AAA of equation (E-23), by way of equation (E-29), is of the form
A = 1 + h 2 k v 2 t n 2 ω 0 2 A = 1 + h 2 k v 2 t n 2 ω 0 2 A=sqrt(1+(h^(2)k_(v)^(2))/(t_(n)^(2)omega_(0)^(2)))A=\sqrt{1+\frac{h^{2} k_{v}^{2}}{t_{n}^{2} \omega_{0}^{2}}}A=1+h2kv2tn2ω02
Since we have switched to the Fourier transform domain in our analysis, our objective now is to compute the dip-moveout-corrected data P 0 ( k u , w 0 ; h ) P 0 k u , w 0 ; h P_(0)(k_(u),w_(0);h)P_{0}\left(k_{u}, w_{0} ; h\right)P0(ku,w0;h) in the transform domain. Thus, start with the 2-D Fourier transform of P 0 ( y 0 , T 0 ; h ) P 0 y 0 , T 0 ; h P_(0)(y_(0),T_(0);h)P_{0}\left(y_{0}, T_{0} ; h\right)P0(y0,T0;h)
P 0 ( k y , ω 0 ; h ) = P 0 ( y 0 , τ 0 ; h ) exp ( ı k y y 0 i ω 0 τ 0 ) d y 0 d τ 0 P 0 k y , ω 0 ; h = P 0 y 0 , τ 0 ; h exp ı k y y 0 i ω 0 τ 0 d y 0 d τ 0 P_(0)(k_(y),omega_(0);h)=∬P_(0)(y_(0),tau_(0);h)exp(ık_(y)y_(0)-iomega_(0)tau_(0))dy_(0)dtau_(0)P_{0}\left(k_{y}, \omega_{0} ; h\right)=\iint P_{0}\left(y_{0}, \tau_{0} ; h\right) \exp \left(\imath k_{y} y_{0}-i \omega_{0} \tau_{0}\right) d y_{0} d \tau_{0}P0(ky,ω0;h)=P0(y0,τ0;h)exp(ıkyy0iω0τ0)dy0dτ0
A wavefield is invariant under a coordinate transformation; hence, P 0 ( y 0 , τ 0 ; h ) = P 0 y 0 , τ 0 ; h = P_(0)(y_(0),tau_(0);h)=P_{0}\left(y_{0}, \tau_{0} ; h\right)=P0(y0,τ0;h)= P n ( y n , t n ; h ) P n y n , t n ; h P_(n)(y_(n),t_(n);h)P_{n}\left(y_{n}, t_{n} ; h\right)Pn(yn,tn;h). Use the transform relations given by equations (E-30) and (E-31) and the invariance relation to write equation ( E 33 E 33 E-33\mathrm{E}-33E33 ) in terms of the normal-moveout-corrected data P n ( y n , t n ; h ) P n y n , t n ; h P_(n)(y_(n),t_(n);h)P_{n}\left(y_{n}, t_{n} ; h\right)Pn(yn,tn;h) (Liner, 1990)
P 0 ( k y , ω 0 ; h ) = P n ( y n , t n ; h ) y 0 y n τ 0 t n exp [ i k y ( y n h 2 k y t n A ω 0 ) i ω 0 t n A ] d y n d t n . ( E 34 ) P 0 k y , ω 0 ; h = P n y n , t n ; h y 0 y n τ 0 t n exp i k y y n h 2 k y t n A ω 0 i ω 0 t n A d y n d t n . ( E 34 ) P_(0)(k_(y),omega_(0);h)=∬P_(n)(y_(n),t_(n);h)(dely_(0))/(dely_(n))(deltau_(0))/(delt_(n))exp[ik_(y)(y_(n)-(h^(2)k_(y))/(t_(n)Aomega_(0)))-i(omega_(0)t_(n))/(A)]dy_(n)dt_(n).(E-34)P_{0}\left(k_{y}, \omega_{0} ; h\right)=\iint P_{n}\left(y_{n}, t_{n} ; h\right) \frac{\partial y_{0}}{\partial y_{n}} \frac{\partial \tau_{0}}{\partial t_{n}} \exp \left[i k_{y}\left(y_{n}-\frac{h^{2} k_{y}}{t_{n} A \omega_{0}}\right)-i \frac{\omega_{0} t_{n}}{A}\right] d y_{n} d t_{n} .(E-34)P0(ky,ω0;h)=Pn(yn,tn;h)y0ynτ0tnexp[iky(ynh2kytnAω0)iω0tnA]dyndtn.(E34)
Fron equation (E-30) it follows that
y 0 y n = 1 y 0 y n = 1 (dely_(0))/(dely_(n))=1\frac{\partial y_{0}}{\partial y_{n}}=1y0yn=1
Square both sides of equation (E-31), substitute equation (E-32) for the quantity A A AAA and simplify to get
τ 0 2 = t n 4 ω 0 2 t n 2 ω 0 2 + h 2 k y 2 τ 0 2 = t n 4 ω 0 2 t n 2 ω 0 2 + h 2 k y 2 tau_(0)^(2)=(t_(n)^(4)omega_(0)^(2))/(t_(n)^(2)omega_(0)^(2)+h^(2)k_(y)^(2))\tau_{0}^{2}=\frac{t_{n}^{4} \omega_{0}^{2}}{t_{n}^{2} \omega_{0}^{2}+h^{2} k_{y}^{2}}τ02=tn4ω02tn2ω02+h2ky2
Next, differentiate the result,
τ 0 t n = 4 t n 3 ω 0 2 ( t n 2 ω 0 2 + h 2 k y 2 ) 2 t n 5 ω 0 4 2 τ 0 ( t n 2 ω 0 2 + h 2 k y 2 ) 2 τ 0 t n = 4 t n 3 ω 0 2 t n 2 ω 0 2 + h 2 k y 2 2 t n 5 ω 0 4 2 τ 0 t n 2 ω 0 2 + h 2 k y 2 2 (deltau_(0))/(delt_(n))=(4t_(n)^(3)omega_(0)^(2)(t_(n)^(2)omega_(0)^(2)+h^(2)k_(y)^(2))-2t_(n)^(5)omega_(0)^(4))/(2tau_(0)(t_(n)^(2)omega_(0)^(2)+h^(2)k_(y)^(2))^(2))\frac{\partial \tau_{0}}{\partial t_{n}}=\frac{4 t_{n}^{3} \omega_{0}^{2}\left(t_{n}^{2} \omega_{0}^{2}+h^{2} k_{y}^{2}\right)-2 t_{n}^{5} \omega_{0}^{4}}{2 \tau_{0}\left(t_{n}^{2} \omega_{0}^{2}+h^{2} k_{y}^{2}\right)^{2}}τ0tn=4tn3ω02(tn2ω02+h2ky2)2tn5ω042τ0(tn2ω02+h2ky2)2
Rearrange the terms in equation ( E 32 E 32 E-32E-32E32 ) to the form
t n 2 ω 0 2 + h 2 k y 2 = t n 2 ω 0 2 A 2 t n 2 ω 0 2 + h 2 k y 2 = t n 2 ω 0 2 A 2 t_(n)^(2)omega_(0)^(2)+h^(2)k_(y)^(2)=t_(n)^(2)omega_(0)^(2)A^(2)t_{n}^{2} \omega_{0}^{2}+h^{2} k_{y}^{2}=t_{n}^{2} \omega_{0}^{2} A^{2}tn2ω02+h2ky2=tn2ω02A2
and use in equation (E-36b) together with equation (E-31) for the τ 0 τ 0 tau_(0)\tau_{0}τ0 in the denominator to obtain
τ 0 t n = 2 A 2 1 A 3 τ 0 t n = 2 A 2 1 A 3 (deltau_(0))/(delt_(n))=(2A^(2)-1)/(A^(3))\frac{\partial \tau_{0}}{\partial t_{n}}=\frac{2 A^{2}-1}{A^{3}}τ0tn=2A21A3
Finally, substitute equations (E-35) and (E-37) into equation (E-34)
P 0 ( k y , ω 0 ; h ) = 2 A 2 1 A 3 P n ( y n , t n ; h ) exp [ i k y ( y n h 2 k y t n A ω 0 ) ω 0 t n A ] d y n d t n . ( E 38 ) P 0 k y , ω 0 ; h = 2 A 2 1 A 3 P n y n , t n ; h exp i k y y n h 2 k y t n A ω 0 ω 0 t n A d y n d t n . ( E 38 ) P_(0)(k_(y),omega_(0);h)=∬(2A^(2)-1)/(A^(3))P_(n)(y_(n),t_(n);h)exp[ik_(y)(y_(n)-(h^(2)k_(y))/(t_(n)Aomega_(0)))-(omega_(0)t_(n))/(A)]dy_(n)dt_(n).(E-38)P_{0}\left(k_{y}, \omega_{0} ; h\right)=\iint \frac{2 A^{2}-1}{A^{3}} P_{n}\left(y_{n}, t_{n} ; h\right) \exp \left[i k_{y}\left(y_{n}-\frac{h^{2} k_{y}}{t_{n} A \omega_{0}}\right)-\frac{\omega_{0} t_{n}}{A}\right] d y_{n} d t_{n} .(E-38)P0(ky,ω0;h)=2A21A3Pn(yn,tn;h)exp[iky(ynh2kytnAω0)ω0tnA]dyndtn.(E38)
Now, we turn our attention to the phase term in equation (E-38)
Φ = k y ( y n h 2 k y t n A ω 0 ) w 0 t n A Φ = k y y n h 2 k y t n A ω 0 w 0 t n A Phi=k_(y)(y_(n)-(h^(2)k_(y))/(t_(n)Aomega_(0)))-(w_(0)t_(n))/(A)\Phi=k_{y}\left(y_{n}-\frac{h^{2} k_{y}}{t_{n} A \omega_{0}}\right)-\frac{w_{0} t_{n}}{A}Φ=ky(ynh2kytnAω0)w0tnA
Rearrange the terms, first, as follows:
Φ = k y y n ω 0 t n A ( 1 + h 2 k y 2 t n 2 ω 0 2 ) Φ = k y y n ω 0 t n A 1 + h 2 k y 2 t n 2 ω 0 2 Phi=k_(y)y_(n)-(omega_(0)t_(n))/(A)(1+(h^(2)k_(y)^(2))/(t_(n)^(2)omega_(0)^(2)))\Phi=k_{y} y_{n}-\frac{\omega_{0} t_{n}}{A}\left(1+\frac{h^{2} k_{y}^{2}}{t_{n}^{2} \omega_{0}^{2}}\right)Φ=kyynω0tnA(1+h2ky2tn2ω02)
then, by way of the expression for A A AAA as in equation ( E 32 E 32 E-32E-32E32 )
Φ = k y y n ω 0 t n A Φ = k y y n ω 0 t n A Phi=k_(y)y_(n)-omega_(0)t_(n)A\Phi=k_{y} y_{n}-\omega_{0} t_{n} AΦ=kyynω0tnA
Return to equation (E-38) and substitute equation (E-39) for the terms in the exponential
P 0 ( k y , ω 0 ; h ) = 2 A 2 1 A 3 P n ( y n , t n ; h ) exp ( ı k y y n i ω 0 t n A ) d y n d t n . ( E 40 ) P 0 k y , ω 0 ; h = 2 A 2 1 A 3 P n y n , t n ; h exp ı k y y n i ω 0 t n A d y n d t n . ( E 40 ) P_(0)(k_(y),omega_(0);h)=∬(2A^(2)-1)/(A^(3))P_(n)(y_(n),t_(n);h)exp(ık_(y)y_(n)-iomega_(0)t_(n)A)dy_(n)dt_(n).quad(E-40)P_{0}\left(k_{y}, \omega_{0} ; h\right)=\iint \frac{2 A^{2}-1}{A^{3}} P_{n}\left(y_{n}, t_{n} ; h\right) \exp \left(\imath k_{y} y_{n}-i \omega_{0} t_{n} A\right) d y_{n} d t_{n} . \quad(E-40)P0(ky,ω0;h)=2A21A3Pn(yn,tn;h)exp(ıkyyniω0tnA)dyndtn.(E40)
Use the Fourier tranşform integral
P n ( k y , t n ; h ) = P n ( y n , t n ; h ) exp ( i k y y n ) d y n P n k y , t n ; h = P n y n , t n ; h exp i k y y n d y n P_(n)(k_(y),t_(n);h)=intP_(n)(y_(n),t_(n);h)exp(ik_(y)y_(n))dy_(n)P_{n}\left(k_{y}, t_{n} ; h\right)=\int P_{n}\left(y_{n}, t_{n} ; h\right) \exp \left(i k_{y} y_{n}\right) d y_{n}Pn(ky,tn;h)=Pn(yn,tn;h)exp(ikyyn)dyn
to rewrite equation ( E 40 E 40 E-40\mathrm{E}-40E40 ) in the form
P 0 ( k y , ω 0 ; h ) = 2 A 2 1 A 3 P n ( k y , t n ; h ) cxp ( ı ω 0 t n A ) d t n P 0 k y , ω 0 ; h = 2 A 2 1 A 3 P n k y , t n ; h cxp ı ω 0 t n A d t n P_(0)(k_(y),omega_(0);h)=int(2A^(2)-1)/(A^(3))P_(n)(k_(y),t_(n);h)cxp(-ıomega_(0)t_(n)A)dt_(n)P_{0}\left(k_{y}, \omega_{0} ; h\right)=\int \frac{2 A^{2}-1}{A^{3}} P_{n}\left(k_{y}, t_{n} ; h\right) \operatorname{cxp}\left(-\imath \omega_{0} t_{n} A\right) d t_{n}P0(ky,ω0;h)=2A21A3Pn(ky,tn;h)cxp(ıω0tnA)dtn
Equation (E-42) describes the dip-moveout correction process which transforms the normalmoveout-corrected prestack data with a specific offset 2 h 2 h 2h2 h2h from y n t n y n t n y_(n)-t_(n)y_{n}-t_{n}yntn domain to y 0 τ 0 y 0 τ 0 y_(0)-tau_(0)y_{0}-\tau_{0}y0τ0 domain. Referring to Figure 5.1-1, we remind ourselves that y n t r y n t r y_(n)-t_(r)y_{n}-t_{r}yntr coordinates are associated with event time t n t n t_(n)t_{n}tn at midpoint location y n y n y_(n)y_{n}yn, and y 0 τ 0 y 0 τ 0 y_(0)-tau_(0)y_{0}-\tau_{0}y0τ0 coordinates are associated with event time τ 0 τ 0 tau_(0)\tau_{0}τ0 at midpoint location y 0 y 0 y_(0)y_{0}y0 that corresponds to the normal-incidence reflection. The lateral excursion applied by dip-moveout correction is Δ y D M O = | y n y 0 | Δ y D M O = y n y 0 Deltay_(DMO)=|y_(n)-y_(0)|\Delta y_{D M O}=\left|y_{n}-y_{0}\right|ΔyDMO=|yny0| and the verticel excursion is Δ t D M O = t n τ 0 Δ t D M O = t n τ 0 Deltat_(DMO)=t_(n)-tau_(0)\Delta t_{D M O}=t_{\mathrm{n}}-\tau_{0}ΔtDMO=tnτ0.
Once dip-moveout correction is applied, the data are inverse Fourier transformed
P 0 ( y 0 , τ 0 ; h ) = P 0 ( k 3 , ω 0 ; h ) exp ( i k y y 0 + i ν 0 τ 0 ) d k y d ω t 0 P 0 y 0 , τ 0 ; h = P 0 k 3 , ω 0 ; h exp i k y y 0 + i ν 0 τ 0 d k y d ω t 0 P_(0)(y_(0),tau_(0);h)=∬P_(0)(k_(3),omega_(0);h)exp(-ik_(y)y_(0)+inu_(0)tau_(0))dk_(y)d omegat_(0)P_{0}\left(y_{0}, \tau_{0} ; h\right)=\iint P_{0}\left(k_{3}, \omega_{0} ; h\right) \exp \left(-i k_{y} y_{0}+i \nu_{0} \tau_{0}\right) d k_{y} d \omega t_{0}P0(y0,τ0;h)=P0(k3,ω0;h)exp(ikyy0+iν0τ0)dkydωt0
A flowchart of the dip-moveout correction in the frequency-wavenumber domain described above is presented in Figure 5.1-2.

E. 3 Log-Stretch DMO Correction

A computationally efficient DMO correction can be formulated in the logarithmic time domain (Bolondi et al., 1982; ; Bale and Jacubowicz, 1987; Notfors and Godfrey, 1987; Liner, 1990; Zhou et al., 1996). The log-stretch time variable enables linearization of the coordinate transform equation (E-28), and as a result, the DMO correction is achieved by a simple multiplication of the input data with a phase-shift operator in the Fourier transform domain.
Define the following logarithmic variables that correspond to the time variables τ 0 τ 0 tau_(0)\tau_{0}τ0 and t n t n t_(n)t_{n}tn of equation ( E 28 E 28 E-28\mathrm{E}-28E28 ):
T 0 = ln τ 0 T 0 = ln τ 0 T_(0)=ln tau_(0)T_{0}=\ln \tau_{0}T0=lnτ0
and
T n = ln t n . T n = ln t n . T_(n)=ln t_(n).T_{n}=\ln t_{n} .Tn=lntn.
Hence, the inverse relationships are given by
τ 0 = e T 0 τ 0 = e T 0 tau_(0)=e^(T_(0))\tau_{0}=e^{T_{0}}τ0=eT0
and
t n = e T n t n = e T n t_(n)=e^(T_(n))t_{n}=e^{T_{n}}tn=eTn
In Section E.2, we derived the equations for DMO correction to transform the normalmoveout-corrected data from ( y n , t n ) y n , t n (y_(n),t_(n))\left(y_{n}, t_{n}\right)(yn,tn) ccordinates to ( y 0 , T 0 ) y 0 , T 0 (y_(0),T_(0))\left(y_{0}, T_{0}\right)(y0,T0) coordinates. The objective here is to derive equations for DMO correction in the log-stretch coordinates ( y 0 , T 0 ) y 0 , T 0 (y_(0),T_(0))\left(y_{0}, T_{0}\right)(y0,T0),
Square both sides of equation ( E 28 E 28 E-28E-28E28 )
τ 0 2 = t n 2 A 2 τ 0 2 = t n 2 A 2 tau_(0)^(2)=(t_(n)^(2))/(A^(2))\tau_{0}^{2}=\frac{t_{n}^{2}}{A^{2}}τ02=tn2A2
and subsitute equation (E-23) for A A AAA
τ 0 2 = t n 2 1 + h 2 t n 2 ( 2 sin ϕ v ) 2 τ 0 2 = t n 2 1 + h 2 t n 2 2 sin ϕ v 2 tau_(0)^(2)=-(t_(n)^(2))/(1+(h^(2))/(t_(n)^(2))((2sin phi)/(v))^(2))\tau_{0}^{2}=-\frac{t_{n}^{2}}{1+\frac{h^{2}}{t_{n}^{2}}\left(\frac{2 \sin \phi}{v}\right)^{2}}τ02=tn21+h2tn2(2sinϕv)2
Here, we have to make the crucial assumption that A A AAA is close to unity. Refer to equation (E-23) and note that such an assumption implies one of the following: small h h hhh (offset), small ϕ ϕ phi\phiϕ (dip), large t n t n t_(n)t_{n}tn (time after moveout) or large v v vvv (velocity). As a result, equation (E-46b) can be approximated as
τ 0 2 = t n 2 [ 1 h 2 t n 2 ( 2 sin ϕ v ) 2 ] τ 0 2 = t n 2 1 h 2 t n 2 2 sin ϕ v 2 tau_(0)^(2)=t_(n)^(2)[1-(h^(2))/(t_(n)^(2))((2sin phi)/(v))^(2)]\tau_{0}^{2}=t_{n}^{2}\left[1-\frac{h^{2}}{t_{n}^{2}}\left(\frac{2 \sin \phi}{v}\right)^{2}\right]τ02=tn2[1h2tn2(2sinϕv)2]
The slope d τ 0 / d y 0 d τ 0 / d y 0 dtau_(0)//dy_(0)d \tau_{0} / d y_{0}dτ0/dy0 measured on a zero-offset section in ( y 0 , τ 0 ) y 0 , τ 0 (y_(0),tau_(0))\left(y_{0}, \tau_{0}\right)(y0,τ0) coordinates is given by
d τ 0 d y 0 = 2 sin ϕ v d τ 0 d y 0 = 2 sin ϕ v (dtau_(0))/(dy_(0))=(2sin phi)/(v)\frac{d \tau_{0}}{d y_{0}}=\frac{2 \sin \phi}{v}dτ0dy0=2sinϕv
Substitute equation (E-46d) into equation (E-46c)
τ 0 2 = t n 2 [ 1 h 2 t n 2 ( d τ 0 d y 0 ) 2 ] τ 0 2 = t n 2 1 h 2 t n 2 d τ 0 d y 0 2 tau_(0)^(2)=t_(n)^(2)[1-(h^(2))/(t_(n)^(2))((dtau_(0))/(dy_(0)))^(2)]\tau_{0}^{2}=t_{n}^{2}\left[1-\frac{h^{2}}{t_{n}^{2}}\left(\frac{d \tau_{0}}{d y_{0}}\right)^{2}\right]τ02=tn2[1h2tn2(dτ0dy0)2]
Apply the chain rule for differentiation
d τ 0 d y 0 = d T 0 d T 0 d T 0 d y 0 d τ 0 d y 0 = d T 0 d T 0 d T 0 d y 0 (dtau_(0))/(dy_(0))=(dT_(0))/(dT_(0))(dT_(0))/(dy_(0))\frac{d \tau_{0}}{d y_{0}}=\frac{d T_{0}}{d T_{0}} \frac{d T_{0}}{d y_{0}}dτ0dy0=dT0dT0dT0dy0
and, by way of equation (E-45a), obtain the relationship
d τ 0 d y 0 = e T 0 d T 0 d y 0 d τ 0 d y 0 = e T 0 d T 0 d y 0 (dtau_(0))/(dy_(0))=e^(T_(0))(dT_(0))/(dy_(0))\frac{d \tau_{0}}{d y_{0}}=e^{T_{0}} \frac{d T_{0}}{d y_{0}}dτ0dy0=eT0dT0dy0
Next, combine equations (E-29) and (E-46d) to get
d τ 0 d y 0 = k y ω 0 d τ 0 d y 0 = k y ω 0 (dtau_(0))/(dy_(0))=(k_(y))/(omega_(0))\frac{d \tau_{0}}{d y_{0}}=\frac{k_{y}}{\omega_{0}}dτ0dy0=kyω0
By analogy, we may write
d T 0 d y 0 = k y Ω 0 d T 0 d y 0 = k y Ω 0 (dT_(0))/(dy_(0))=(k_(y))/(Omega_(0))\frac{d T_{0}}{d y_{0}}=\frac{k_{y}}{\Omega_{0}}dT0dy0=kyΩ0
where Ω 0 Ω 0 Omega_(0)\Omega_{0}Ω0 is the Fourier transform variable associated with the log-stretch time variable T 0 T 0 T_(0)T_{0}T0. Finally, substitute equation (E-47d) into equation (E-47b) to get
d τ 0 d y 0 = e T 0 k y Ω 0 d τ 0 d y 0 = e T 0 k y Ω 0 (dtau_(0))/(dy_(0))=e^(T_(0))(k_(y))/(Omega_(0))\frac{d \tau_{0}}{d y_{0}}=e^{T_{0}} \frac{k_{y}}{\Omega_{0}}dτ0dy0=eT0kyΩ0
Now, return to equation (E-46e), and use equations (E-45a,b) and (E-47e) to obtain the expression
e 2 ( T 0 T r ) ( 1 + h 2 k v 2 Ω 0 2 ) = 1 e 2 T 0 T r 1 + h 2 k v 2 Ω 0 2 = 1 e^(2(T_(0)-T_(r)))(1+(h^(2)k_(v)^(2))/(Omega_(0)^(2)))=1e^{2\left(T_{0}-T_{\mathrm{r}}\right)}\left(1+\frac{h^{2} k_{\mathrm{v}}^{2}}{\Omega_{0}^{2}}\right)=1e2(T0Tr)(1+h2kv2Ω02)=1
Take the logarithm of both sides and simplify to get the transform relation between the input log log log\loglog-stretch time variable T n T n T_(n)T_{n}Tn and the output log-stretch time variable T 0 T 0 T_(0)T_{0}T0
T 0 = T n ln A e T 0 = T n ln A e T_(0)=T_(n)-ln A_(e)T_{0}=T_{n}-\ln A_{e}T0=TnlnAe
where
A c = 1 + h 2 k y 2 Ω 0 2 A c = 1 + h 2 k y 2 Ω 0 2 A_(c)=sqrt(1+(h^(2)k_(y)^(2))/(Omega_(0)^(2)))A_{c}=\sqrt{1+\frac{h^{2} k_{y}^{2}}{\Omega_{0}^{2}}}Ac=1+h2ky2Ω02
We now turn our attention to equation (E-24) and derive the corresponding equation in the log log log\loglog-stretch domain. First, substitute equation (E-23) into equation (E-24) and approximate the quantity A A AAA as before
y 0 = y n h 2 t n [ 1 1 2 h 2 t n 2 ( 2 sin ϕ v ) 2 ] ( 2 sin ϕ v ) y 0 = y n h 2 t n 1 1 2 h 2 t n 2 2 sin ϕ v 2 2 sin ϕ v y_(0)=y_(n)-(h^(2))/(t_(n))[1-(1)/(2)(h^(2))/(t_(n)^(2))((2sin phi)/(v))^(2)]((2sin phi)/(v))y_{0}=y_{n}-\frac{h^{2}}{t_{n}}\left[1-\frac{1}{2} \frac{h^{2}}{t_{n}^{2}}\left(\frac{2 \sin \phi}{v}\right)^{2}\right]\left(\frac{2 \sin \phi}{v}\right)y0=ynh2tn[112h2tn2(2sinϕv)2](2sinϕv)
Substitute equation (E-46d) into equation (E-5la)
y 0 = y n h 2 t n [ 1 1 2 h 2 t n 2 ( d τ 0 d y 0 ) 2 ] ( d τ 0 d y 0 ) y 0 = y n h 2 t n 1 1 2 h 2 t n 2 d τ 0 d y 0 2 d τ 0 d y 0 y_(0)=y_(n)-(h^(2))/(t_(n))[1-(1)/(2)(h^(2))/(t_(n)^(2))((dtau_(0))/(dy_(0)))^(2)]((dtau_(0))/(dy_(0)))y_{0}=y_{n}-\frac{h^{2}}{t_{n}}\left[1-\frac{1}{2} \frac{h^{2}}{t_{n}^{2}}\left(\frac{d \tau_{0}}{d y_{0}}\right)^{2}\right]\left(\frac{d \tau_{0}}{d y_{0}}\right)y0=ynh2tn[112h2tn2(dτ0dy0)2](dτ0dy0)
Then, make the substitutions from equations (E-45b) and (E-47e), drop the high-order term, and simplify to get
y 0 = y n e T 0 T n h 2 k y Ω 0 y 0 = y n e T 0 T n h 2 k y Ω 0 y_(0)=y_(n)-e^(T_(0)-T_(n))h^(2)(k_(y))/(Omega_(0))y_{0}=y_{n}-e^{T_{0}-T_{n}} h^{2} \frac{k_{y}}{\Omega_{0}}y0=yneT0Tnh2kyΩ0
Note from equation (E-48)
e T 0 T n = 1 1 + h 2 k y 2 Ω 0 2 e T 0 T n = 1 1 + h 2 k y 2 Ω 0 2 e^(T_(0)-T_(n))=(1)/(sqrt(1+(h^(2)k_(y)^(2))/(Omega_(0)^(2))))e^{T_{0}-T_{n}}=\frac{1}{\sqrt{1+\frac{h^{2} k_{y}^{2}}{\Omega_{0}^{2}}}}eT0Tn=11+h2ky2Ω02
Use this result in equation (E-51c) accompanjed with the definition of equation (E-50) to obtain the final expression that relates y 0 y 0 y_(0)y_{0}y0 and y n y n y_(n)y_{n}yn in log log log\loglog-stretch coordinates
y 0 = y n h 2 k y A e Ω 0 y 0 = y n h 2 k y A e Ω 0 y_(0)=y_(n)-(h^(2)k_(y))/(A_(e)Omega_(0))y_{0}=y_{n}-\frac{h^{2} k_{y}}{A_{e} \Omega_{0}}y0=ynh2kyAeΩ0
Equations (E-49), (E-50), and (E-53) correspond to equations (E-31), (E-32), and (E-30) in the log log log\loglog-stretch domain.
We remind ourselves of the objective to compute the dip-moveout-corrected data P 0 ( k y , Ω 0 ; h ) P 0 k y , Ω 0 ; h P_(0)(k_(y),Omega_(0);h)P_{0}\left(k_{y}, \Omega_{0} ; h\right)P0(ky,Ω0;h) in the transform domain. Thus, start with the 2-D Fourier transform of P 0 ( y 0 , T 0 ; h ) P 0 y 0 , T 0 ; h P_(0)(y_(0),T_(0);h)P_{0}\left(y_{0}, T_{0} ; h\right)P0(y0,T0;h)
P 0 ( k y , Ω 0 ; h ) = P 0 ( y 0 , T 0 ; h ) exp ( i k y y 0 i Ω 0 T 0 ) d y 0 d T 0 P 0 k y , Ω 0 ; h = P 0 y 0 , T 0 ; h exp i k y y 0 i Ω 0 T 0 d y 0 d T 0 P_(0)(k_(y),Omega_(0);h)=∬P_(0)(y_(0),T_(0);h)exp(ik_(y)y_(0)-iOmega_(0)T_(0))dy_(0)dT_(0)P_{0}\left(k_{y}, \Omega_{0} ; h\right)=\iint P_{0}\left(y_{0}, T_{0} ; h\right) \exp \left(i k_{y} y_{0}-i \Omega_{0} T_{0}\right) d y_{0} d T_{0}P0(ky,Ω0;h)=P0(y0,T0;h)exp(ikyy0iΩ0T0)dy0dT0
A wavefield is invariant under a coordinate transformation; hence, P 0 ( y 0 , T 0 ; h ) = P 0 y 0 , T 0 ; h = P_(0)(y_(0),T_(0);h)=P_{0}\left(y_{0}, T_{0} ; h\right)=P0(y0,T0;h)= P n ( y n , T n ; h ) P n y n , T n ; h P_(n)(y_(n),T_(n);h)P_{n}\left(y_{n}, T_{n} ; h\right)Pn(yn,Tn;h), the latter being the normal-moveout-corrected data in the log-stretch domain. Use the transform relations given by equations (E-49) and (E-53) and the invariance relation to write equation (E-54) in terms of the normal-moveout-corrected data P n ( y n , T n ; h P n y n , T n ; h P_(n)(y_(n),T_(n);h:}P_{n}\left(y_{n}, T_{n} ; h\right.Pn(yn,Tn;h ) (Liner, 1990)
P 0 ( k y , Ω 0 ; h ) = P n ( y n , T n ; h ) exp [ i k y ( y n h 2 k y A e Ω 0 ) i Ω 0 ( T n ln A e ) ] y 0 y n T 0 T n d y n d T n P 0 k y , Ω 0 ; h = P n y n , T n ; h exp i k y y n h 2 k y A e Ω 0 i Ω 0 T n ln A e y 0 y n T 0 T n d y n d T n P_(0)(k_(y),Omega_(0);h)=∬P_(n)(y_(n),T_(n);h)exp[ik_(y)(y_(n)-(h^(2)k_(y))/(A_(e)Omega_(0)))-iOmega_(0)(T_(n)-ln A_(e))](dely_(0))/(dely_(n))(delT_(0))/(delT_(n))dy_(n)dT_(n)P_{0}\left(k_{y}, \Omega_{0} ; h\right)=\iint P_{n}\left(y_{n}, T_{n} ; h\right) \exp \left[i k_{y}\left(y_{n}-\frac{h^{2} k_{y}}{A_{e} \Omega_{0}}\right)-i \Omega_{0}\left(T_{n}-\ln A_{e}\right)\right] \frac{\partial y_{0}}{\partial y_{n}} \frac{\partial T_{0}}{\partial T_{n}} d y_{n} d T_{n}P0(ky,Ω0;h)=Pn(yn,Tn;h)exp[iky(ynh2kyAeΩ0)iΩ0(TnlnAe)]y0ynT0TndyndTn
From equation (E-53) it follows that
y 0 y n = 1 y 0 y n = 1 (dely_(0))/(dely_(n))=1\frac{\partial y_{0}}{\partial y_{n}}=1y0yn=1
and from equation ( E 49 E 49 E-49\mathrm{E}-49E49 ), we have
T 0 T n = 1 T 0 T n = 1 (delT_(0))/(delT_(n))=1\frac{\partial T_{0}}{\partial T_{n}}=1T0Tn=1
Substitute equations ( E 56 a , b E 56 a , b E-56a,b\mathbf{E}-56 \mathrm{a}, \mathrm{b}E56a,b ) into equation (E-55) and rearrange the terms in the exponential to obtain
P 0 ( k y , Ω 0 ; h ) = exp [ ı k y h 2 k y A e Ω 0 + ı Ω 0 ln A e ] P n ( y n , T n ; h ) exp ( 2 k y y n ı Ω 0 T n ) d y n d T n P 0 k y , Ω 0 ; h = exp ı k y h 2 k y A e Ω 0 + ı Ω 0 ln A e P n y n , T n ; h exp 2 k y y n ı Ω 0 T n d y n d T n P_(0)(k_(y),Omega_(0);h)=exp[-ık_(y)(h^(2)k_(y))/(A_(e)Omega_(0))+ıOmega_(0)ln A_(e)]∬P_(n)(y_(n),T_(n);h)exp(2k_(y)y_(n)-ıOmega_(0)T_(n))dy_(n)dT_(n)P_{0}\left(k_{y}, \Omega_{0} ; h\right)=\exp \left[-\imath k_{y} \frac{h^{2} k_{y}}{A_{e} \Omega_{0}}+\imath \Omega_{0} \ln A_{e}\right] \iint P_{n}\left(y_{n}, T_{n} ; h\right) \exp \left(2 k_{y} y_{n}-\imath \Omega_{0} T_{n}\right) d y_{n} d T_{n}P0(ky,Ω0;h)=exp[ıkyh2kyAeΩ0+ıΩ0lnAe]Pn(yn,Tn;h)exp(2kyynıΩ0Tn)dyndTn
Assume that the Fourier transform variable Ω 0 Ω 0 Omega_(0)\Omega_{0}Ω0 in the log-stretch domain is independent of T n T n T_(n)T_{n}Tn. Then, the double integral on the right-hand side represents the 2-D Fourier transform of the normal-moveout-corrected data in the log-stretch domain as
P n ( k y , Ω 0 ; h ) = P n ( y n , T n ; h ) exp ( ı k y y n i Ω 0 T n ) d y n d T n P n k y , Ω 0 ; h = P n y n , T n ; h exp ı k y y n i Ω 0 T n d y n d T n P_(n)(k_(y),Omega_(0);h)=∬P_(n)(y_(n),T_(n);h)exp(ık_(y)y_(n)-iOmega_(0)T_(n))dy_(n)dT_(n)P_{n}\left(k_{y}, \Omega_{0} ; h\right)=\iint P_{n}\left(y_{n}, T_{n} ; h\right) \exp \left(\imath k_{y} y_{n}-i \Omega_{0} T_{n}\right) d y_{n} d T_{n}Pn(ky,Ω0;h)=Pn(yn,Tn;h)exp(ıkyyniΩ0Tn)dyndTn
Therefore, by way of equation ( E 58 E 58 E-58E-58E58 ), equation (E-57) takes the form
P 0 ( k y , Ω 0 ; h ) = exp ( i h 2 k y 2 A t Ω 0 + i Ω 0 ln A c ) P n ( k y , Ω 0 ; h ) P 0 k y , Ω 0 ; h = exp i h 2 k y 2 A t Ω 0 + i Ω 0 ln A c P n k y , Ω 0 ; h P_(0)(k_(y),Omega_(0);h)=exp(-i(h^(2)k_(y)^(2))/(A_(t)Omega_(0))+iOmega_(0)ln A_(c))P_(n)(k_(y),Omega_(0);h)P_{0}\left(k_{y}, \Omega_{0} ; h\right)=\exp \left(-i \frac{h^{2} k_{y}^{2}}{A_{t} \Omega_{0}}+i \Omega_{0} \ln A_{c}\right) P_{n}\left(k_{y}, \Omega_{0} ; h\right)P0(ky,Ω0;h)=exp(ih2ky2AtΩ0+iΩ0lnAc)Pn(ky,Ω0;h)
Equation (E-59) describes the dip-moveout correction process which transforms the normalmoveout-corrected prestack data with a specific offset 2 h 2 h 2h2 h2h from the log-stretch y n T n y n T n y_(n)-T_(n)y_{n}-T_{n}ynTn domain to y 0 T 0 y 0 T 0 y_(0)-T_(0)y_{0}-T_{0}y0T0 domain. Note that the relationship of input P n ( k y , Ω 0 ; h ) P n k y , Ω 0 ; h P_(n)(k_(y),Omega_(0);h)P_{n}\left(k_{y}, \Omega_{0} ; h\right)Pn(ky,Ω0;h) to output P 0 ( k y , Ω 0 ; h ) P 0 k y , Ω 0 ; h P_(0)(k_(y),Omega_(0);h)P_{0}\left(k_{y}, \Omega_{0} ; h\right)P0(ky,Ω0;h) given by equation (E-59) computationally is much simpler than that of equation (E-42). Once the phase-shift in the log-stretch domain given by equation (E-59) is applied to the input and the result is inverse Fourier transformed, the data are unstretched from ( y 0 , T 0 ) y 0 , T 0 (y_(0),T_(0))\left(y_{0}, T_{0}\right)(y0,T0) coordinates back to ( y 0 , τ 0 ) y 0 , τ 0 (y_(0),tau_(0))\left(y_{0}, \tau_{0}\right)(y0,τ0) coordinates using the relationship expressed by equation ( E 45 a ) E 45 a {:E-45a)\left.\mathrm{E}-45 \mathrm{a}\right)E45a).
A variation of the phase-shift term in equation (E-59) is given by Notfors and Godfrey (1987). As in most log-stretch formulations of DMO correction, this reference assumes that under DMO correction the midpoint variable is invariant; hence, by way of equation (E-53), the first term in the exponential of equation (E-59) drops out. A further approximation, ln A e = A e 1 ln A e = A e 1 ln A_(e)=A_(e)-1\ln A_{e}=A_{e}-1lnAe=Ae1, and use of the definition for A e A e A_(e)A_{e}Ae given by equation ( E 50 E 50 E-50\mathrm{E}-50E50 ) then lead to the following expression for DMO correction:
P 0 ( k y , Ω 0 ; h ) = cxp [ 2 Ω 0 ( 1 + h 2 k ν 2 Ω 0 2 1 ) ] P n ( k y , Ω 0 ; h ) P 0 k y , Ω 0 ; h = cxp 2 Ω 0 1 + h 2 k ν 2 Ω 0 2 1 P n k y , Ω 0 ; h P_(0)(k_(y),Omega_(0);h)=cxp[2Omega_(0)(sqrt(1+(h^(2)k_(nu)^(2))/(Omega_(0)^(2)))-1)]P_(n)(k_(y),Omega_(0);h)P_{0}\left(k_{y}, \Omega_{0} ; h\right)=\operatorname{cxp}\left[2 \Omega_{0}\left(\sqrt{1+\frac{h^{2} k_{\nu}^{2}}{\Omega_{0}^{2}}}-1\right)\right] P_{n}\left(k_{y}, \Omega_{0} ; h\right)P0(ky,Ω0;h)=cxp[2Ω0(1+h2kν2Ω021)]Pn(ky,Ω0;h)
Various implementations of the log-stretch technique applied to shot records are described by Biondi and Ronen (1987), Cobrera and Levy (1989), and Zholn et al. (1996). The latter also includes a method in double-log-stretch domain, which involves stretching both in time and midpoint coordinates. See Section 5.1 for a practical implementation of the log-stretch DMO correction, described here.

E. 4 The DMO Ellipse

The objective is to derive the traveltime trajectory associated with the dip-moveout correction operator by using the method of stationary phase. Insert from equation (E-42) the expression for P 0 ( k y , T 0 ; h ) P 0 k y , T 0 ; h P_(0)(k_(y),T_(0);h)P_{0}\left(k_{y}, T_{0} ; h\right)P0(ky,T0;h) into equation ( E 43 ) ( E 43 ) (E-43)(\mathbf{E}-43)(E43)
P 0 ( y 0 , τ 0 ; h ) = 2 A 2 1 A 3 P n ( k y , t n ; h ) cxp ( z ω 0 t n A i k y y 0 + z ω 0 τ 0 ) d t n d k y d ω 0 P 0 y 0 , τ 0 ; h = 2 A 2 1 A 3 P n k y , t n ; h cxp z ω 0 t n A i k y y 0 + z ω 0 τ 0 d t n d k y d ω 0 P_(0)(y_(0),tau_(0);h)=∭(2A^(2)-1)/(A^(3))P_(n)(k_(y),t_(n);h)cxp(-zomega_(0)t_(n)A-ik_(y)y_(0)+zomega_(0)tau_(0))dt_(n)dk_(y)domega_(0)P_{0}\left(y_{0}, \tau_{0} ; h\right)=\iiint \frac{2 A^{2}-1}{A^{3}} P_{n}\left(k_{y}, t_{n} ; h\right) \operatorname{cxp}\left(-z \omega_{0} t_{n} A-i k_{y} y_{0}+z \omega_{0} \tau_{0}\right) d t_{n} d k_{y} d \omega_{0}P0(y0,τ0;h)=2A21A3Pn(ky,tn;h)cxp(zω0tnAikyy0+zω0τ0)dtndkydω0
where the total phase is given by
Φ = ω 0 t n A k y y 0 + ω 0 τ 0 Φ = ω 0 t n A k y y 0 + ω 0 τ 0 Phi=-omega_(0)t_(n)A-k_(y)y_(0)+omega_(0)tau_(0)\Phi=-\omega_{0} t_{n} A-k_{y} y_{0}+\omega_{0} \tau_{0}Φ=ω0tnAkyy0+ω0τ0
Substitute equation (E-32) for A A AAA
Φ = ω 0 2 t n 2 + h 2 k y 2 k y y 0 + ω 0 τ 0 Φ = ω 0 2 t n 2 + h 2 k y 2 k y y 0 + ω 0 τ 0 Phi=-sqrt(omega_(0)^(2)t_(n)^(2)+h^(2)k_(y)^(2))-k_(y)y_(0)+omega_(0)tau_(0)\Phi=-\sqrt{\omega_{0}^{2} t_{n}^{2}+h^{2} k_{y}^{2}}-k_{y} y_{0}+\omega_{0} \tau_{0}Φ=ω02tn2+h2ky2kyy0+ω0τ0
The main contribution to the integration in equation (E-61) occurs when the phase in equation ( E 62 b E 62 b E-62b\mathrm{E}-62 \mathrm{~b}E62 b ) stays nearly constant. We therefore determine the variation of Φ Φ Phi\PhiΦ with respect
to variables ω 0 ω 0 omega_(0)\omega_{0}ω0 and k y k y k_(y)k_{y}ky
Φ ω 0 = ω 0 t n 2 ω 0 2 t n 2 + h 2 k y 2 + τ 0 Φ ω 0 = ω 0 t n 2 ω 0 2 t n 2 + h 2 k y 2 + τ 0 (del Phi)/(delomega_(0))=-(omega_(0)t_(n)^(2))/(sqrt(omega_(0)^(2)t_(n)^(2)+h^(2)k_(y)^(2)))+tau_(0)\frac{\partial \Phi}{\partial \omega_{0}}=-\frac{\omega_{0} t_{n}^{2}}{\sqrt{\omega_{0}^{2} t_{n}^{2}+h^{2} k_{y}^{2}}}+\tau_{0}Φω0=ω0tn2ω02tn2+h2ky2+τ0
and
Φ k y = k k h 2 ω 0 2 t r i 2 + h 2 k v 2 y 0 Φ k y = k k h 2 ω 0 2 t r i 2 + h 2 k v 2 y 0 (del Phi)/(delk_(y))=-(k_(k)h^(2))/(sqrt(omega_(0)^(2)t_(ri)^(2)+h^(2)k_(v)^(2)))-y_(0)\frac{\partial \Phi}{\partial k_{y}}=-\frac{k_{k} h^{2}}{\sqrt{\omega_{0}^{2} t_{r i}^{2}+h^{2} k_{v}^{2}}}-y_{0}Φky=kkh2ω02tri2+h2kv2y0
Then set each variation to zero. Rearranging the terms of the resulting expressions, we have
ω 0 t n ω 0 2 t n 2 + h 2 k y 2 = τ 0 t n ω 0 t n ω 0 2 t n 2 + h 2 k y 2 = τ 0 t n (omega_(0)t_(n))/(sqrt(omega_(0)^(2)t_(n)^(2)+h^(2)k_(y)^(2)))=(tau_(0))/(t_(n))\frac{\omega_{0} t_{n}}{\sqrt{\omega_{0}^{2} t_{n}^{2}+h^{2} k_{y}^{2}}}=\frac{\tau_{0}}{t_{n}}ω0tnω02tn2+h2ky2=τ0tn
and
k y h ω 0 2 t n 2 + h 2 k y 2 = y 0 h k y h ω 0 2 t n 2 + h 2 k y 2 = y 0 h (k_(y)h)/(sqrt(omega_(0)^(2)t_(n)^(2)+h^(2)k_(y)^(2)))=-(y_(0))/(h)\frac{k_{y} h}{\sqrt{\omega_{0}^{2} t_{n}^{2}+h^{2} k_{y}^{2}}}=-\frac{y_{0}}{h}kyhω02tn2+h2ky2=y0h
Then, square both sides of equations (E-64a,b)
ω 0 2 t n 2 ω 0 2 t n 2 + h 2 k y 2 = τ 0 2 t n 2 ω 0 2 t n 2 ω 0 2 t n 2 + h 2 k y 2 = τ 0 2 t n 2 (omega_(0)^(2)t_(n)^(2))/(omega_(0)^(2)t_(n)^(2)+h^(2)k_(y)^(2))=(tau_(0)^(2))/(t_(n)^(2))\frac{\omega_{0}^{2} t_{n}^{2}}{\omega_{0}^{2} t_{n}^{2}+h^{2} k_{y}^{2}}=\frac{\tau_{0}^{2}}{t_{n}^{2}}ω02tn2ω02tn2+h2ky2=τ02tn2
and
k y 2 h 2 ω 0 2 t n 2 + h 2 k y 2 = y 0 2 h 2 k y 2 h 2 ω 0 2 t n 2 + h 2 k y 2 = y 0 2 h 2 (k_(y)^(2)h^(2))/(omega_(0)^(2)t_(n)^(2)+h^(2)k_(y)^(2))=(y_(0)^(2))/(h^(2))\frac{k_{y}^{2} h^{2}}{\omega_{0}^{2} t_{n}^{2}+h^{2} k_{y}^{2}}=\frac{y_{0}^{2}}{h^{2}}ky2h2ω02tn2+h2ky2=y02h2
Finally, sum equations ( E 65 a , b E 65 a , b E-65a,b\mathrm{E}-65 \mathrm{a}, \mathrm{b}E65a,b ) to obtain
y 0 2 h 2 + τ 0 2 t n 2 = 1 y 0 2 h 2 + τ 0 2 t n 2 = 1 (y_(0)^(2))/(h^(2))+(tau_(0)^(2))/(t_(n)^(2))=1\frac{y_{0}^{2}}{h^{2}}+\frac{\tau_{0}^{2}}{t_{n}^{2}}=1y02h2+τ02tn2=1
Equation (E-66) describes an ellipse with the following properties:
(a) Semi-major axis in midpoint y 0 y 0 y_(0)y_{0}y0 direction: a = h a = h a=ha=ha=h.
(b) Semi-minor axis in time τ 0 τ 0 tau_(0)\tau_{0}τ0 direction: b = t n b = t n b=t_(n)b=t_{n}b=tn.
The ellipse of equation (E-66) in the y 0 τ 0 y 0 τ 0 y_(0)-tau_(0)y_{0}-\tau_{0}y0τ0 plane describes the impulse response of a dip-moveout operator applied to a common-offset section with offset 2 h 2 h 2h2 h2h.

E. 5 Nonzero-Offset Traveltime Equation

Prestack wave extrapolation is performed using the double-square operator which enables downward continuation of common-shot and common-receiver gathers (Section D.1). Stationary phase epproximation to the double-square root operator yields the nonzero-offset traveltime equation (D-35) derived in Section D. 2
v t = ( y + h ) 2 + z 2 + ( y h ) 2 + z 2 v t = ( y + h ) 2 + z 2 + ( y h ) 2 + z 2 vt=sqrt((y+h)^(2)+z^(2))+sqrt((y-h)^(2)+z^(2))v t=\sqrt{(y+h)^{2}+z^{2}}+\sqrt{(y-h)^{2}+z^{2}}vt=(y+h)2+z2+(yh)2+z2
where y , h , t 1 z y , h , t 1 z y,h,t_(1)zy, h, t_{1} zy,h,t1z are midpoint, offset, two-way traveltime and depth coordinates and v v vvv is the medium velocity. Here, we shall show that this equation represents an ellipse (Figure E-2) in the y z y z y-zy-zyz plane for a constant t , h t , h t,ht, ht,h, and v v vvv, and derive the parameters of this ellipse. The nonzero-ofset two-way time is associated with the raypath from source S S SSS to reflection point R R RRR to receiver G G GGG as sketched in Figure E-2. The origin of the y z y z y-zy-zyz plane coincides with midpoint M M MMM.
FIG. E-2. The prestack time migration ellipse. See Section E. 5 for detalk.
Square both sides of equation (E-67) to get
v 2 t 2 = 2 [ ( y + h ) 2 + z 2 ] [ ( y h ) 2 + z 2 ] + [ ( y + h ) 2 + z 2 ] + [ ( y h ) 2 + z 2 ] v 2 t 2 = 2 ( y + h ) 2 + z 2 ( y h ) 2 + z 2 + ( y + h ) 2 + z 2 + ( y h ) 2 + z 2 {:[v^(2)t^(2)=2sqrt([(y+h)^(2)+z^(2)][(y-h)^(2)+z^(2)])],[+[(y+h)^(2)+z^(2)]+[(y-h)^(2)+z^(2)]]:}\begin{aligned} v^{2} t^{2} & =2 \sqrt{\left[(y+h)^{2}+z^{2}\right]\left[(y-h)^{2}+z^{2}\right]} \\ & +\left[(y+h)^{2}+z^{2}\right]+\left[(y-h)^{2}+z^{2}\right] \end{aligned}v2t2=2[(y+h)2+z2][(yh)2+z2]+[(y+h)2+z2]+[(yh)2+z2]
Combine the second and third terms on the right-hand side and simplify the terms inside the square root
v 2 t 2 = 2 ( y 2 h 2 ) 2 + 2 z 2 ( y 2 + h 2 ) + z 4 + 2 ( y 2 + h 2 + z 2 ) . v 2 t 2 = 2 y 2 h 2 2 + 2 z 2 y 2 + h 2 + z 4 + 2 y 2 + h 2 + z 2 . v^(2)t^(2)=2sqrt((y^(2)-h^(2))^(2)+2z^(2)(y^(2)+h^(2))+z^(4))+2(y^(2)+h^(2)+z^(2)).v^{2} t^{2}=2 \sqrt{\left(y^{2}-h^{2}\right)^{2}+2 z^{2}\left(y^{2}+h^{2}\right)+z^{4}}+2\left(y^{2}+h^{2}+z^{2}\right) .v2t2=2(y2h2)2+2z2(y2+h2)+z4+2(y2+h2+z2).
Perform further algebraic manipulation to collect the terms in y y yyy and z z zzz
( v 2 t 2 4 h 2 ) v 2 + v 2 t 2 z 2 = v 4 t 4 4 v 2 t 2 h 2 v 2 t 2 4 h 2 v 2 + v 2 t 2 z 2 = v 4 t 4 4 v 2 t 2 h 2 (v^(2)t^(2)-4h^(2))v^(2)+v^(2)t^(2)z^(2)=(v^(4)t^(4))/(4)-v^(2)t^(2)h^(2)\left(v^{2} t^{2}-4 h^{2}\right) v^{2}+v^{2} t^{2} z^{2}=\frac{v^{4} t^{4}}{4}-v^{2} t^{2} h^{2}(v2t24h2)v2+v2t2z2=v4t44v2t2h2
Finally, normalize by the terms on the right-hand side and rearrange the terms in the denominators
y 2 ( v t / 2 ) 2 + z 2 ( v t / 2 ) 2 k 2 = 1 y 2 ( v t / 2 ) 2 + z 2 ( v t / 2 ) 2 k 2 = 1 (y^(2))/((vt//2)^(2))+(z^(2))/((vt//2)^(2)-k^(2))=1\frac{y^{2}}{(v t / 2)^{2}}+\frac{z^{2}}{(v t / 2)^{2}-k^{2}}=1y2(vt/2)2+z2(vt/2)2k2=1
Equation (E-70) represents an ellipse in the y z y z y-zy-zyz plane for a constant t t ttt with the following parameters (Figure E-2):
(a) Semi-major axis in midpoint y y yyy direction: a = v t / 2 a = v t / 2 a=vt//2a=v t / 2a=vt/2.
(b) Semi-minor axis in depth z z zzz direction: b = ( v t / 2 ) 2 h 2 b = ( v t / 2 ) 2 h 2 b=sqrt((vt//2)^(2)-h^(2))b=\sqrt{(v t / 2)^{2}-h^{2}}b=(vt/2)2h2.
(c) Distance from center to either focus: a 2 b 2 = h a 2 b 2 = h sqrt(a^(2)-b^(2))=h\sqrt{a^{2}-b^{2}}=ha2b2=h.
(d) Distance from one focus to a point on the ellipse to the other focus: v t v t vtv tvt.
The ellipse of equation ( E 70 E 70 E-70\mathrm{E}-70E70 ) in the y z y z y-zy-zyz plane describes the impulse response of a nonzero-offset migration operator applied to prestack data.
When equation (E-70) is specialized to the zero offset case, h = 0 h = 0 h=0h=0h=0, we get
y 2 ( v t / 2 ) 2 + z 2 ( v t / 2 ) 2 = 1 y 2 ( v t / 2 ) 2 + z 2 ( v t / 2 ) 2 = 1 (y^(2))/((vt//2)^(2))+(z^(2))/((vt//2)^(2))=1\frac{y^{2}}{(v t / 2)^{2}}+\frac{z^{2}}{(v t / 2)^{2}}=1y2(vt/2)2+z2(vt/2)2=1
which describes a circle in the y z y z y-zy-zyz plane for a constant t t ttt with a radius v t / 2 v t / 2 vt//2v t / 2vt/2. This circle represents the impulse resporse of a zero-offset migration operator applicd to poststack data.
When equation (E-67) is specialized to the zero-offset case, h = 0 h = 0 h=0h=0h=0, we get
v t = 2 y 2 + z 2 v t = 2 y 2 + z 2 vt=2sqrt(y^(2)+z^(2))v t=2 \sqrt{y^{2}+z^{2}}vt=2y2+z2
which describes the well-known diffraction hyperbola in the y t y t y-ty-tyt plane for a constant z z zzz.
Reduction of the double-square-root equation (E-67) to a single-square-root equation (E71b) can also be achieved by defining an equivalent offset h e h e h_(e)h_{e}he such that (Bancroft et al., 1998)
( y + h ) 2 + z 2 + ( y h ) 2 + z 2 = 2 h e 2 + z 2 . ( y + h ) 2 + z 2 + ( y h ) 2 + z 2 = 2 h e 2 + z 2 . sqrt((y+h)^(2)+z^(2))+sqrt((y-h)^(2)+z^(2))=2sqrt(h_(e)^(2)+z^(2)).\sqrt{(y+h)^{2}+z^{2}}+\sqrt{(y-h)^{2}+z^{2}}=2 \sqrt{h_{e}^{2}+z^{2}} .(y+h)2+z2+(yh)2+z2=2he2+z2.
Solving for h e h e h_(e)h_{e}he, we obtain (Bancroft ct al., 1998; Margrave et al., 1999)
h e 2 = y 2 + h 2 4 y 2 h 2 v 2 t 2 h e 2 = y 2 + h 2 4 y 2 h 2 v 2 t 2 h_(e)^(2)=y^(2)+h^(2)-(4y^(2)h^(2))/(v^(2)t^(2))h_{e}^{2}=y^{2}+h^{2}-\frac{4 y^{2} h^{2}}{v^{2} t^{2}}he2=y2+h24y2h2v2t2
where t t ttt is the two-way nonzero-offset traveltime of equation (E-67).
Poststack time migration can be conceptualized either by way of a semicircle superposition using equation (E-72a) or a diffaction summation along the hyperbolic traveltime trajectory using equation ( E 72 b E 72 b E-72b\mathrm{E}-72 \mathrm{~b}E72 b ). Similarly, prestack time migration can be conceptualized either by way of semi-elliptical superposition using equation (E-70) or diffaction summation over the travelime surface described by equation (E-67). The traveltime surface is known as Cheops' pyramid (Claerbout, 1985) and is illustrated in Figure E-3a. The result of summation of amplitudes over the pyramidal surface is placed at its apex. The question that is of practical importance is how to define the summation paths over this surface.
Four possible choices of sumnation paths over the pyramidal surface of equation (E-67) to perform prestack time migration are:
(a) Summation curves of constant offset: Consider a set of vertical cross-sections of the traveltime pyramid illustrated in Figure E-3a parallel to the midpoint axis as shown in Figure E-3b. Sum the amplitudes along each of the constant-offset table-top traveltime curves, independently, and place the result for each at the apex of the summation curve. The summation collapses the pyramidal surface onto a hyperbolic traveltime curve, which is formed by combining the apex points of the constant-offset curves. This hyperbolic traveltime curve is orthogonal to the constant-offset summation curves.
(b) Summation curves of constant tome: Consider a set of horizontal cross-sections of the traveltime pyramid as shown in Figure E-3c (Bancroft and Geiger, 1994; Bancroft et al., 1997). Sum the amplitudes along each of the constant-time curves, independently, and place the result for each at the maximum offset on the summation curve. The summation, again, collapses the pyramidal surface onto the hyperbolic traveltime curve, which is formed by combining the maximum-offset points of the constant-time curves. This hyperbolic traveltime curve is orthogonal to the constant-time summation curves. The event associated with the resulting hyperbolic moveout trajectory is on the h e t h e t h_(e)-th_{e}-thet plane of a common-scatter-point (CSP) gather (Bancroft et al., 1998), where the equivalent offset h e h e h_(e)h_{e}he is given by equation (E-72b). The scatter point corresponds to the apex of the traveltime pyramid A 0 A 0 A_(0)A_{0}A0 in Figure E-3c.
(c) Summation curves of constant shot Consider a set of vertical cross-sections of the traveltime pyramid as shown in Figure E-3d (Berryhill, 1996). Sum the amplitudes along each of these constant-shot curves, independently, and place the result for each at the apex of the summation curve. The summation collapses the pyramidal surface onto the hyperbolic traveltime curve, which is formed by combining the apex points of the constant-shot curves. This hyperbolic traveltime curve is orthogonal to the constant-shot summation curves and is on the common-receiver plane that passes through the apex of the pyramid itself.
(d) Summation curves of constant angle: Consider a set of slanted cross-sections of the traveltime pyramid as shown in Figure E-3e (Ottolini, 1982). These slanted traveltime curves are associated with constant angle of incidence (Section 6.3). Sum the amplitudes along each
FIG. E-3. The nonzero-offset traveltime surface associated with a point scatterer and the various summation trajectories for prestack time migration (composed from Fowler, 1997). See Section E. 5 for details.
of the constant-angle curves, independently, and place the result tor each at the apex of the summation curve. The summation collapses the pyramidal surface onto the hyperbolic traveltime curve which is formed by combining the apex points of the constant-offset, curves. This hyperbolic traveltime curve is orthogonal to the constant-offset summation curves.

E. 6 Prestack Frequency-Wavenumber Migration

We start with prestack data in midpoint y y yyy and offset h h hhh coordinates, P ( y , h , z = 0 , t ) P ( y , h , z = 0 , t ) P(y,h,z=0,t)P(y, h, z=0, t)P(y,h,z=0,t), where t t ttt is the event time in the unmigrated position, and perform 3-D Fouricr transform
P ( k y , k h , 0 , ω ) = P ( y , h , 0 , t ) exp ( i k y y + i k h h i ω t ) d k y d k h d ω P k y , k h , 0 , ω = P ( y , h , 0 , t ) exp i k y y + i k h h i ω t d k y d k h d ω P(k_(y),k_(h),0,omega)=∭P(y,h,0,t)exp(ik_(y)y+ik_(h)h-i omega t)dk_(y)dk_(h)d omegaP\left(k_{y}, k_{h}, 0, \omega\right)=\iiint P(y, h, 0, t) \exp \left(i k_{y} y+i k_{h} h-i \omega t\right) d k_{y} d k_{h} d \omegaP(ky,kh,0,ω)=P(y,h,0,t)exp(ikyy+ikhhiωt)dkydkhdω
where k y , k h k y , k h k_(y),k_(h)k_{y}, k_{h}ky,kh, and ω ω omega\omegaω are the Fourier duals of the variables of the midpoint-offset coordinates, y y yyy, h h hhh, and t t ttt.
Extrapolate the prestack data from the surface z = 0 z = 0 z=0z=0z=0 to a depth z z zzz by the following extrapolation equation which we borrow from Section D. 1
P ( k y , k h , z , ω ) = P ( k y , k h , 0 , ω ) exp ( i k z z ) P k y , k h , z , ω = P k y , k h , 0 , ω exp i k z z P(k_(y),k_(h),z,omega)=P(k_(y),k_(h),0,omega)exp(-ik_(z)z)P\left(k_{y}, k_{h}, z, \omega\right)=P\left(k_{y}, k_{h}, 0, \omega\right) \exp \left(-i k_{z} z\right)P(ky,kh,z,ω)=P(ky,kh,0,ω)exp(ikzz)
The vertical wavenumber k z k z k_(z)k_{z}kz is given by
k z = ω v D S R ( Y , H ) k z = ω v D S R ( Y , H ) k_(z)=(omega )/(v)DSR(Y,H)k_{z}=\frac{\omega}{v} D S R(Y, H)kz=ωvDSR(Y,H)
where, the double-squarc-root (DSR) operator takes the following form in midpoint-offset coordinates (equation D-22 of Section D.1)
DSR ( Y , H ) = 1 ( Y + H ) 2 + 1 ( Y H ) 2 DSR ( Y , H ) = 1 ( Y + H ) 2 + 1 ( Y H ) 2 DSR(Y,H)=sqrt(1-(Y+H)^(2))+sqrt(1-(Y-H)^(2))\operatorname{DSR}(Y, H)=\sqrt{1-(Y+H)^{2}}+\sqrt{1-(Y-H)^{2}}DSR(Y,H)=1(Y+H)2+1(YH)2
The variables Y Y YYY and H H HHH are the normalized midpoint and offset wavenumbers, respectively
Y = v k y 24 Y = v k y 24 Y=(vk_(y))/(24)Y=\frac{v k_{y}}{24}Y=vky24
and
H = v k h 2 ω H = v k h 2 ω H=(vk_(h))/(2omega)H=\frac{v k_{h}}{2 \omega}H=vkh2ω
Assume a horizontally layered earth model associated with a vertically varying velocity function v ( z ) v ( z ) v(z)v(z)v(z). By inverse Fourier transforming equation (E-74), we have
P ( y , h , z , t ) = P ( k y , k h , 0 , ω ) exp ( i k z z ) exp ( i k y y i k h h + i ω t ) d k y d k h d ω P ( y , h , z , t ) = P k y , k h , 0 , ω exp i k z z exp i k y y i k h h + i ω t d k y d k h d ω P(y,h,z,t)=∭P(k_(y),k_(h),0,omega)exp(-ik_(z)z)exp(-ik_(y)y-ik_(h)h+i omega t)dk_(y)dk_(h)d omegaP(y, h, z, t)=\iiint P\left(k_{y}, k_{h}, 0, \omega\right) \exp \left(-i k_{z} z\right) \exp \left(-i k_{y} y-i k_{h} h+i \omega t\right) d k_{y} d k_{h} d \omegaP(y,h,z,t)=P(ky,kh,0,ω)exp(ikzz)exp(ikyyikhh+iωt)dkydkhdω
The imaging principle t = 0 t = 0 t=0t=0t=0 then is applied to get the image volume P ( y , h , z , t = 0 ) P ( y , h , z , t = 0 ) P(y,h,z,t=0)P(y, h, z, t=0)P(y,h,z,t=0),
P ( y , h , z , t = 0 ) = P ( k y , k h , 0 , ω ) exp ( i k y y i k h h i k z z ) d k y d k h d ω P ( y , h , z , t = 0 ) = P k y , k h , 0 , ω exp i k y y i k h h i k z z d k y d k h d ω P(y,h,z,t=0)=∭P(k_(y),k_(h),0,omega)exp(-ik_(y)y-ik_(h)h-ik_(z)z)dk_(y)dk_(h)d omegaP(y, h, z, t=0)=\iiint P\left(k_{y}, k_{h}, 0, \omega\right) \exp \left(-i k_{y} y-i k_{h} h-i k_{z} z\right) d k_{y} d k_{h} d \omegaP(y,h,z,t=0)=P(ky,kh,0,ω)exp(ikyyikhhikzz)dkydkhdω
This is the cquation for the prestack phase-shift method. Equation (E-79) involves integration over frequency ω ω omega\omegaω and 2-D inverse Fourier transformation along midpoint y y yyy and offset h h hhh axes.
We now consider the special case of constant velocity v v vvv. Stolt (1978) devised a prestack migration technique that involves an efficient mapping in the 3-D Fourier transform domain from temporal frequency ω ω omega\omegaω to vertical wavenumber k k k k k_(k)k_{k}kk.
First, combine equations (E-75) and (E-76)
v k z ω = 1 ( Y + H ) 2 + 1 ( Y H ) 2 v k z ω = 1 ( Y + H ) 2 + 1 ( Y H ) 2 (vk_(z))/(omega)=sqrt(1-(Y+H)^(2))+sqrt(1-(Y-H)^(2))\frac{v k_{z}}{\omega}=\sqrt{1-(Y+H)^{2}}+\sqrt{1-(Y-H)^{2}}vkzω=1(Y+H)2+1(YH)2
Square both sides
v 2 k z 2 ω 2 = 2 [ 1 ( Y + H ) 2 1 ( Y H ) 2 ] + [ 1 ( Y + H ) 2 ] + [ 1 ( Y H ) 2 ] v 2 k z 2 ω 2 = 2 1 ( Y + H ) 2 1 ( Y H ) 2 + 1 ( Y + H ) 2 + 1 ( Y H ) 2 {:[(v^(2)k_(z)^(2))/(omega^(2))=2[sqrt(1-(Y+H)^(2))sqrt(1-(Y-H)^(2))]],[+[1-(Y+H)^(2)]+[1-(Y-H)^(2)]]:}\begin{aligned} \frac{v^{2} k_{z}^{2}}{\omega^{2}} & =2\left[\sqrt{1-(Y+H)^{2}} \sqrt{1-(Y-H)^{2}}\right] \\ & +\left[1-(Y+H)^{2}\right]+\left[1-(Y-H)^{2}\right] \end{aligned}v2kz2ω2=2[1(Y+H)21(YH)2]+[1(Y+H)2]+[1(YH)2]
and simplify
v 2 k z 2 2 ω 2 ( 1 Y 2 H 2 ) = 1 2 Y 2 2 H 2 + Y 4 2 Y 2 H 2 + H 4 v 2 k z 2 2 ω 2 1 Y 2 H 2 = 1 2 Y 2 2 H 2 + Y 4 2 Y 2 H 2 + H 4 (v^(2)k_(z)^(2))/(2omega^(2))-(1-Y^(2)-H^(2))=sqrt(1-2Y^(2)-2H^(2)+Y^(4)-2Y^(2)H^(2)+H^(4))\frac{v^{2} k_{z}^{2}}{2 \omega^{2}}-\left(1-Y^{2}-H^{2}\right)=\sqrt{1-2 Y^{2}-2 H^{2}+Y^{4}-2 Y^{2} H^{2}+H^{4}}v2kz22ω2(1Y2H2)=12Y22H2+Y42Y2H2+H4
Define
K 2 = v 2 k z 2 2 ω 2 K 2 = v 2 k z 2 2 ω 2 K^(2)=(v^(2)k_(z)^(2))/(2omega^(2))K^{2}=\frac{v^{2} k_{z}^{2}}{2 \omega^{2}}K2=v2kz22ω2
and square both sides of equation (E-82). After some algebra, it follows that
K 4 2 K 2 + 2 K 2 Y 2 + 2 K 2 H 2 + 4 Y 2 H 2 = 0 K 4 2 K 2 + 2 K 2 Y 2 + 2 K 2 H 2 + 4 Y 2 H 2 = 0 K^(4)-2K^(2)+2K^(2)Y^(2)+2K^(2)H^(2)+4Y^(2)H^(2)=0K^{4}-2 K^{2}+2 K^{2} Y^{2}+2 K^{2} H^{2}+4 Y^{2} H^{2}=0K42K2+2K2Y2+2K2H2+4Y2H2=0
which can be rewritten as
2 K 2 = ( K 2 + 2 Y 2 ) ( K 2 + 2 H 2 ) 2 K 2 = K 2 + 2 Y 2 K 2 + 2 H 2 2K^(2)=(K^(2)+2Y^(2))(K^(2)+2H^(2))2 K^{2}=\left(K^{2}+2 Y^{2}\right)\left(K^{2}+2 H^{2}\right)2K2=(K2+2Y2)(K2+2H2)
Now substitute equations (E-77a,b) and (E-83) into equation (E-85), and simplify to obtain the final expression for the dispersion relation for prestack wave extrapolation
ω = v 2 k z ( k z 2 + k y 2 ) ( k z 2 + k h 2 ) ω = v 2 k z k z 2 + k y 2 k z 2 + k h 2 omega=(v)/(2k_(z))sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(h)^(2)))\omega=\frac{v}{2 k_{z}} \sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{h}^{2}\right)}ω=v2kz(kz2+ky2)(kz2+kh2)
By setting the offset wavenumber k h = 0 k h = 0 k_(h)=0k_{h}=0kh=0, we obtain the special case of zero-ofiset dispersion relation
ω = v 2 k z 2 + k y 2 ω = v 2 k z 2 + k y 2 omega=(v)/(2)sqrt(k_(z)^(2)+k_(y)^(2))\omega=\frac{v}{2} \sqrt{k_{z}^{2}+k_{y}^{2}}ω=v2kz2+ky2
as in equation (D-85) with x x xxx replaced by y y yyy.
By keeping the wavenumbers k y k y k_(y)k_{y}ky and k h k h k_(h)k_{h}kh unchanged and differentiating equation (E-80), we get
d ω = v 2 k z 2 k v 2 k h 2 ( k z 2 + k y 2 ) ( k z 2 + k h 2 ) d k z d ω = v 2 k z 2 k v 2 k h 2 k z 2 + k y 2 k z 2 + k h 2 d k z d omega=(v)/(2)(k_(z)^(2)-k_(v)^(2)k_(h)^(2))/(sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(h)^(2))))dk_(z)d \omega=\frac{v}{2} \frac{k_{z}^{2}-k_{v}^{2} k_{h}^{2}}{\sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{h}^{2}\right)}} d k_{z}dω=v2kz2kv2kh2(kz2+ky2)(kz2+kh2)dkz
By setting the offset wavenumber k h = 0 k h = 0 k_(h)=0k_{h}=0kh=0, we obtain the special case for zero-offsct
d ω = v 2 k z k z 2 + k v 2 d k z d ω = v 2 k z k z 2 + k v 2 d k z d omega=(v)/(2)(k_(z))/(sqrt(k_(z)^(2)+k_(v)^(2)))dk_(z)d \omega=\frac{v}{2} \frac{k_{z}}{\sqrt{k_{z}^{2}+k_{v}^{2}}} d k_{z}dω=v2kzkz2+kv2dkz
as in equation (D-86) with x x xxx replaced by y y yyy.
When equations ( E 86 E 86 E-86E-86E86 ) and (E-88) are substituted into equation (E-79), we get
P ( y , h 1 , z , t = 0 ) = [ v 2 k z 2 k y 2 k h 2 ( k z 2 + k y 2 ) ( k z 2 + k y 2 ) ] × P [ k y , k h , 0 , v 2 k z ( k z 2 + k y 2 ) ( k z 2 + k h 2 ) ] exp ( i k y v i k h h i k z z ) d k y d k h d k z . P y , h 1 , z , t = 0 ) = v 2 k z 2 k y 2 k h 2 k z 2 + k y 2 k z 2 + k y 2 × P k y , k h , 0 , v 2 k z k z 2 + k y 2 k z 2 + k h 2 exp i k y v i k h h i k z z d k y d k h d k z . {:[P(y,h_(1),z,t=:}0)=∭[(v)/(2)(k_(z)^(2)-k_(y)^(2)k_(h)^(2))/(sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(y)^(2))))]],[ xx P[k_(y),k_(h),0,(v)/(2k_(z))sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(h)^(2)))]exp(-ik_(y)v-ik_(h)h-ik_(z)z)dk_(y)dk_(h)dk_(z).]:}\begin{aligned} P\left(y, h_{1}, z, t=\right. & 0)=\iiint\left[\frac{v}{2} \frac{k_{z}^{2}-k_{y}^{2} k_{h}^{2}}{\sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{y}^{2}\right)}}\right] \\ & \times P\left[k_{y}, k_{h}, 0, \frac{v}{2 k_{z}} \sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{h}^{2}\right)}\right] \exp \left(-i k_{y} v-i k_{h} h-i k_{z} z\right) d k_{y} d k_{h} d k_{z} . \end{aligned}P(y,h1,z,t=0)=[v2kz2ky2kh2(kz2+ky2)(kz2+ky2)]×P[ky,kh,0,v2kz(kz2+ky2)(kz2+kh2)]exp(ikyvikhhikzz)dkydkhdkz.
Finally, sum over k h k h k_(h)k_{h}kh to obtain the image at zero offset, h = 0 h = 0 h=0h=0h=0
P ( y , h = 0 , z , t = 0 ) = [ v 2 k z 2 k y 2 k h 2 ( k z 2 + k y 2 ) ( k z 2 + k y 2 ) ] × P [ k y , k h , 0 , v 2 k z ( k z 2 + k y 2 ) ( k z 2 + k k 2 ) ] exp ( ı k y y i k z z ) d k y d k h d k z . P ( y , h = 0 , z , t = 0 ) = v 2 k z 2 k y 2 k h 2 k z 2 + k y 2 k z 2 + k y 2 × P k y , k h , 0 , v 2 k z k z 2 + k y 2 k z 2 + k k 2 exp ı k y y i k z z d k y d k h d k z . {:[P(y","h=0","z","t=0)=∭[(v)/(2)(k_(z)^(2)-k_(y)^(2)k_(h)^(2))/(sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(y)^(2))))]],[ xx P[k_(y),k_(h),0,(v)/(2k_(z))sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(k)^(2)))]exp(-ık_(y)y-ik_(z)z)dk_(y)dk_(h)dk_(z).]:}\begin{aligned} P(y, h=0, z, t=0) & =\iiint\left[\frac{v}{2} \frac{k_{z}^{2}-k_{y}^{2} k_{h}^{2}}{\sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{y}^{2}\right)}}\right] \\ & \times P\left[k_{y}, k_{h}, 0, \frac{v}{2 k_{z}} \sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{k}^{2}\right)}\right] \exp \left(-\imath k_{y} y-i k_{z} z\right) d k_{y} d k_{h} d k_{z} . \end{aligned}P(y,h=0,z,t=0)=[v2kz2ky2kh2(kz2+ky2)(kz2+ky2)]×P[ky,kh,0,v2kz(kz2+ky2)(kz2+kk2)]exp(ıkyyikzz)dkydkhdkz.
This is the equation for constant-velocity prestack Stolt migration. It involves two operations in the f k f k f-kf-kfk domain. First, the temporal frequency ω ω omega\omegaω is mapped onto the vertical wavenumber k z k z k_(z)k_{z}kz via equation (E-86). Second, the amplitudes are scaled by the quantity
S = v 2 k z 2 k y 2 k h 2 ( k z 2 + k y 2 ) ( k z 2 + k h 2 ) S = v 2 k z 2 k y 2 k h 2 k z 2 + k y 2 k z 2 + k h 2 S=(v)/(2)(k_(z)^(2)-k_(y)^(2)k_(h)^(2))/(sqrt((k_(z)^(2)+k_(y)^(2))(k_(z)^(2)+k_(h)^(2))))S=\frac{v}{2} \frac{k_{z}^{2}-k_{y}^{2} k_{h}^{2}}{\sqrt{\left(k_{z}^{2}+k_{y}^{2}\right)\left(k_{z}^{2}+k_{h}^{2}\right)}}S=v2kz2ky2kh2(kz2+ky2)(kz2+kh2)
The zero-offset image is then obtained by summing over the wavenumber k h k h k_(h)k_{h}kh (equation E-91), and inverse Fourier transforming in the midpoint y y yyy direction.

E. 7 Velocity Analysis by Wavefield Extrapolation

A method of migration velocity analysis besed on wavefield extrapolation is described in Section 5.4. The main computational steps of this method (Yilmaz and Chambers, 1984) are outlined below. We work with seismic data in midpoint-(half) offset ( y , h ) ( y , h ) (y,h)(y, h)(y,h) coordinates. We want to obtain a volume of focused energy at zero offset in ( y , v , τ ) ( y , v , τ ) (y,v,tau)(y, v, \tau)(y,v,τ) coordinates from a prestack data set in ( y , h , t ) ( y , h , t ) (y,h,t)(y, h, t)(y,h,t) coordinates. For a midpoint location y y yyy, migration velocity function then can be picked from the corresponding ( v , τ ) ( v , τ ) (v,tau)(v, \tau)(v,τ) plane.
First, a 3-D Fourier transformation is applied to the upcoming wavefield P ( y , h , τ = 0 , t ) P ( y , h , τ = 0 , t ) P(y,h,tau=0,t)P(y, h, \tau=0, t)P(y,h,τ=0,t), which is recorded at the surface
P ( k y , k h , τ = 0 , t ) = P ( y , h , τ = 0 , t ) exp ( ı k y y + ı k h h i ω t ) d k y d k h d ω P k y , k h , τ = 0 , t = P ( y , h , τ = 0 , t ) exp ı k y y + ı k h h i ω t d k y d k h d ω P(k_(y),k_(h),tau=0,t)=∭P(y,h,tau=0,t)exp(ık_(y)y+ık_(h)h-i omega t)dk_(y)dk_(h)d omegaP\left(k_{y}, k_{h}, \tau=0, t\right)=\iiint P(y, h, \tau=0, t) \exp \left(\imath k_{y} y+\imath k_{h} h-i \omega t\right) d k_{y} d k_{h} d \omegaP(ky,kh,τ=0,t)=P(y,h,τ=0,t)exp(ıkyy+ıkhhiωt)dkydkhdω
where t t ttt is the two-wny traveltime and
τ = 2 d z v ( z ) τ = 2 d z v ( z ) tau=2int(dz)/(v(z))\tau=2 \int \frac{d z}{v(z)}τ=2dzv(z)
is the two-way vertical time equivalent of downward continuation depth z z zzz in a modium with velocity v ( z ) v ( z ) v(z)v(z)v(z). The variables ( k y , k h , ω ) k y , k h , ω (k_(y),k_(h),omega)\left(k_{y}, k_{h}, \omega\right)(ky,kh,ω) are the Fourier duals of ( y , h , t ) ( y , h , t ) (y,h,t)(y, h, t)(y,h,t).
The surface wavefield given by equation (E-93) then is extrapolated down to depth τ τ tau\tauτ by
P ( k y , k h , τ , ω ) = P ( k y , k h , τ = 0 , ω ) exp ( i ω 2 τ D S R ) P k y , k h , τ , ω = P k y , k h , τ = 0 , ω exp i ω 2 τ D S R P(k_(y),k_(h),tau,omega)=P(k_(y),k_(h),tau=0,omega)exp(-i(omega)/(2)tau DSR)P\left(k_{y}, k_{h}, \tau, \omega\right)=P\left(k_{y}, k_{h}, \tau=0, \omega\right) \exp \left(-i \frac{\omega}{2} \tau D S R\right)P(ky,kh,τ,ω)=P(ky,kh,τ=0,ω)exp(iω2τDSR)
where
D S R [ 1 ( Y + H ) 2 ] 1 / 2 + [ 1 ( Y H ) 2 ] 1 / 2 2 D S R 1 ( Y + H ) 2 1 / 2 + 1 ( Y H ) 2 1 / 2 2 DSR-=[1-(Y+H)^(2)]^(1//2)+[1-(Y-H)^(2)]^(1//2)-2D S R \equiv\left[1-(Y+H)^{2}\right]^{1 / 2}+\left[1-(Y-H)^{2}\right]^{1 / 2}-2DSR[1(Y+H)2]1/2+[1(YH)2]1/22
and Y Y YYY and H H HHH are the normalized midpoint and offeet wavenumbers given by equations (E 77 a ) 77 a ) 77a)77 \mathrm{a})77a) and (E-77b). The -2 term puts the expression in retarded time form. (This term was not included in the previous definition of D S R D S R DSRD S RDSR given by equation E-76.) Equation (E-95) is used recursively to extrapolate the wavefield from one depth to another in steps of Δ T Δ T Delta T\Delta TΔT.
Next, we transform the extrapolated wave field P ( k y , k h , τ 1 , ω ) P k y , k h , τ 1 , ω P(k_(y),k_(h),tau_(1),omega)P\left(k_{y}, k_{h}, \tau_{1}, \omega\right)P(ky,kh,τ1,ω) into the space-time domain. In doing so, we only need to obtain the zero-offset information ( h = 0 ) ( h = 0 ) (h=0)(h=0)(h=0). By summing the extrapolated wavefield over k h k h k_(h)k_{h}kh in equation (E-95), we get the wave field at zero offset. P ( k , h = P ( k , h = P(k,h=P(k, h=P(k,h=
0 , τ , ω ) 0 , τ , ω ) 0,tau,omega)0, \tau, \omega)0,τ,ω). By doing the 2-D inverse transform over ( k y , ω ) k y , ω (k_(y),omega)\left(k_{y}, \omega\right)(ky,ω). we obtain
P ( y . h = 0 , τ , t ) = P ( k y , h = 0 , τ , ω ) exp ( ı k y y + i ω t ) d k y d ω . P ( y . h = 0 , τ , t ) = P k y , h = 0 , τ , ω exp ı k y y + i ω t d k y d ω . P(y.h=0,tau,t)=∬P(k_(y),h=0,tau,omega)exp(-ık_(y)y+i omega t)dk_(y)d omega.P(y . h=0, \tau, t)=\iint P\left(k_{y}, h=0, \tau, \omega\right) \exp \left(-\imath k_{y} y+i \omega t\right) d k_{y} d \omega .P(y.h=0,τ,t)=P(ky,h=0,τ,ω)exp(ıkyy+iωt)dkydω.
Here, P ( y , h = 0 , τ , t ) P ( y , h = 0 , τ , t ) P(y,h=0,tau,t)P(y, h=0, \tau, t)P(y,h=0,τ,t) is the zero-offset section at various depth levels from which we want to extract velocity information.
Suppose that velocity v e v e v_(e)v_{e}ve were used to extrapolate the surface wavefield down to depth τ τ tau\tauτ. Equation (E-95) is written with v e v e v_(e)v_{e}ve and τ τ tau\tauτ as
P ( k y , k h , τ , ω ) = P ( k y , k h , τ = 0 , ω ) exp [ i ω 2 τ DSR ( v c ) ] P k y , k h , τ , ω = P k y , k h , τ = 0 , ω exp i ω 2 τ DSR v c P(k_(y),k_(h),tau,omega)=P(k_(y),k_(h),tau=0,omega)exp[-i(omega)/(2)tau DSR(v_(c))]P\left(k_{y}, k_{h}, \tau, \omega\right)=P\left(k_{y}, k_{h}, \tau=0, \omega\right) \exp \left[-i \frac{\omega}{2} \tau \operatorname{DSR}\left(v_{c}\right)\right]P(ky,kh,τ,ω)=P(ky,kh,τ=0,ω)exp[iω2τDSR(vc)]
Now suppose that the true medium velocity v v vvv were used to extrapolate the surface wavefield down to depth τ = t τ = t tau=t\tau=tτ=t. By rewriting equation (E-95) with v v vvv and t t ttt, we have
P ( k y , k h , t , ω ) = P ( k y , k h , τ = 0 . ω ) exp [ i ω 2 t D S R ( v ) ] P k y , k h , t , ω = P k y , k h , τ = 0 . ω exp i ω 2 t D S R ( v ) P(k_(y),k_(h),t,omega)=P(k_(y),k_(h),tau=0.omega)exp[-i(omega)/(2)tDSR(v)]P\left(k_{y}, k_{h}, t, \omega\right)=P\left(k_{y}, k_{h}, \tau=0 . \omega\right) \exp \left[-i \frac{\omega}{2} t D S R(v)\right]P(ky,kh,t,ω)=P(ky,kh,τ=0.ω)exp[iω2tDSR(v)]
Match the two extrapolated wavefields in equations (E-98a) and (E-98b) to get a relationship between v e , τ , v v e , τ , v v_(e),tau,vv_{e}, \tau, vve,τ,v, and t t ttt
τ D S R ( v e ) = t D S R ( v ) τ D S R v e = t D S R ( v ) tau DSR(v_(e))=tDSR(v)\tau D S R\left(v_{e}\right)=t D S R(v)τDSR(ve)=tDSR(v)
Because of the complexity of DSR [equation (E-96)], equation (E-99) does not provide an explicit expression for v v vvv in terms of the other three variables τ , t τ , t tau,t\tau, tτ,t, and v e v e v_(e)v_{e}ve. However, we can get an approximate expression by expanding the square roots in equation ( E g E g E-g\mathrm{E}-\mathrm{g}Eg ) in the Taylor series and retaining the terms with Y 2 Y 2 Y^(2)Y^{2}Y2 and H 2 H 2 H^(2)H^{2}H2, only. By using this approximate form and the definitions given by equations (E-77a) and (E-77b), the following approximate relationship results
τ v e 2 = t v 2 τ v e 2 = t v 2 tauv_(e)^(2)=tv^(2)\tau v_{e}^{2}=t v^{2}τve2=tv2
This expression suggests that downward continuation with the correct (medium) velocity to a wrong depth is equivalent to downward continuation to the correct depth with the wrong velocity (Doherty and Claerbout, 1974).
The derivation of equation (E-100) assumes that v e v e v_(e)v_{e}ve is constant. When v e v e v_(e)v_{e}ve is depth-variable, then the relationship in equation (E-100) still holds because equation (E-95) is valid for a stratified earth model. However, quantity v e v e v_(e)v_{e}ve in that equation is replaced by the rms velocity.
Because the approximation made to equation (E-96) is best for small ratios of offet-toreflector depth, the accuracy of the mapping procedure based on equation (E-100) degrades at very shallow depths. Refer to Section 5.4 for the practical considerations of the migration velocity estimation technique described in this appendix.

REFERENCES

Artley, C. and Hale, D., 1994, Dip-moveout processing for depth-variable velocity: Geophysics, 59, 610 622 610 622 610-622610-622610622.
Bale, R. and Jacubowitz, H., 1987, Poststack prestack migration: 57th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 714-717.
Bancroft, J. C. and Geiger, H. D., 1994, Equivalent-offset CRP gathers 64th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 672-675.
Bancroft, J. C., Geiger, H. D, and Margrave, G., 1998, The equivalent offset method of prestack t1me migration: Geophysics, 63, 2042-2053.
Bancroft, J. C., Margrave, G., and Geiger 2 2 _(2){ }_{2}2 H. D., 1997, A knematic comparison of DMO-PSI and equivalent offset migration (EOM): 67 th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 1575 1578 1575 1578 1575-15781575-157815751578.
Baysal, E., Kosloff, D., and Sherwood, J. W. C., 1984, A two-way nonreflecting wave equation: Geophysics, 49, 132-141.
Berkovitch, A., Keydar, S., Landa, E., and Trachtman, P., 1998, Multifacusing in practice: 68 t b 68 t b 68tb68 \mathrm{tb}68tb Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 1748-1751.
Berryhill, J. R., 1996, System and method of seismic shot-record migration: U. S. Patent 5,544,126.
Biondi, B. and Ronen, J., 1987, Dip moveout in shot profiles: Geophysics, 52, 1473-1482.
Black, J., Schleicher, K. L. and Zhang, L., 1993, True-amplitude imaging and dip moveout: Geophysics, 58, 47-66.
Black, J.L., MeMahon, I.T., Memardus, H., and Henderson, I., 1985, Applications of prestack migration and dip moveout: Presented at the 55th Ann. Internat. Mtg., Sac. Expl. Geophys.
Bleistein, N., 1990, Born DMO revisited: 60th Ann. Internat. Mtg., Soc. Expl. Geophys., Exparded Abstracts, 1366-1369.
Bulondi, G., Loinger, E. and Rocca, F., 1982, Offset continuation of seismic sections: Geophys. Prasp., 30, 813-828.
Bolond, G., Loinger, E. and Rocca, F., 1984, Offset continuation in theory and practice: Geophys. Prosp., 32, 1045-1073.
Bolondi, G. and Rocca, F., 1985, Normal moveout correction, offset continuation and prestack partial migration compared as prestack processes: n n nnn Fitch, A. A., Ed., Developments in geophysical exploration methods, 6, Elsevier Applied science Publ., Ltd.
Cabrera, J. and Levy, S., 1989, Shot dip-moveout with logarithmic transformations: Geophysics, 54, 1038-1041.
Claerbout, J.F., 1985, Imaging the earth's interior: Blackwell Scientific Publications.
Clayton, R., 1978, Common midpoint migration: Stanford Expl. Proj., Rep. No. 14, Stanford University.
de Bazelaire, E., 1988, Normal-moveout correction revisted: Inhomogeneous media and curved interfaces: Geophysics, 53, 14:-157.
Deregowski, S. M., 1982, Dip-moveout and reflector-point dispersal: Geophys Prusp., 30, 318-322.
Deregowski, S. M., 1986, What is DMO?: First Break, 4, 7-24.
Deregowski, S. M., 1987, An integral implementation of dip-moveout: Geophys. Trans. of Geophys. Inst. of Hungary, 33, 11-22.
Deregowski, S. M. and Rocca, F., 1981, Geometrical optics and wave theory for constant-offset sections in layered med1a: Geophys. Prosp., 29, 374-406.
Doherty, S. M., 1975, Structure-independent velocity estimation: Ph. D. thesis, Stanford Unviersity,
Doherty, S.M. and Claerbout, J.F., 1974, Velocity analysis besed on the wave equation: Stanford Expl. Proj., Rep. No. 1, Stanford University.
Faye, J-P. and Jeannaut, J-P., 1986, Prestack migration velocities from focusing depth analysis: 56th Ann. Internat. Mtg. Soc. Expl. Geophys., Expanded Abstracts, 438-440.
Fowler, P., 1984, Velocity-independent imaging of seismic reflectors: 54th Ann. Internat. Mtg., Soc. Explor. Goophys., Expanded Abstracts, 383-385.
Fowler, P., 1997, A comparative overview of prestack timc migration methods: 67th Ann. Int. Soc. Explor. Geophys. Mtg., Soc. Expl, Geophys., Expanded Abstracts, 1571-1574.
French, W.S., Perkins, W.T., and Zoll, R.M., 1984, Partial migration via true CRP stacking; 54th Ann. Internat. Mtg, Soc. Explor Geophys., Expanded Abstracts, 799-802.
Gardner, G. F. H. and Forel, D., 1990, Amplitude preservation equations for DMO: Geophysics, 55, 485 487 485 487 485-487485-487485487.
Gard ner, G.H.F., French, W.S., and Matzuk, T., 1974, Elements of migration and velocity analysis: Geophysics, 39, 811-825.
Gardner, G. F. H., Wang, S. Y., Pan, N. D., and Zhang, Z., 1986, Dip noveout and prestack imaging: Expended Abstracts, 75-84, 18th Ann. Ofshore Tech. Conf.
Gelchinsky, B., 1988, The common-reflecting-element (CRE) method: ASEG/SEG Internat. Geophys. Conf., Extended Abstracts, 71-75.
Gelchinsky, B., Berkovitch, A., and Keydar, S.,1999a, Multifocusing homoemorphic imaging: Part I: Basic concepts and formulas: J. Appl. Geophys., 42, 229-242.
Gelchinsky, B, Berkovitch, A., and Keydar, S.,1999b, Multifocusing homoemorphic imaging: Part II: Multifold data set and mult focusing: J. Appl. Geophys., 42, 243-260
Gunzalez-Serrano, A. and Claerbout, J.F, 1979, Wave-equation velocity analysis: Stanford Expl. Proj,-, Rep. No. 16, Stanford University.
Granser, H., 1994, Shot gather DMO in the double-log domain: Geophysics, 49, 1305-1307.
Hale, D., 1983, Dip moveout by Fourier transform: Ph.D. thesis, Stanford University.
Hale, D., 1984, Dip moveout by Fourier transform: Geophysics, 49, 741-757.
Hale, D., 1991, A nonaliased integral methot for dip moveout: Geophysics, 56, 795-805.
Hale, D. and Artley, C., 1992, Squeezing dip-moveout for depth-variable velocity: Geophysics, 58, 257-264.
Hale, D., Hill, N. R*, and Stefanj, J., 1992, Imaging salt with turning seisme waves: Geophysics, 57 , 1453 1462 57 , 1453 1462 57,1453-146257,1453-146257,14531462.
Höcht, G., 1998, Common-reflection-surface stack: Master's thesı, Karlsruhe University.
Jacubowicz, H., 1990, A simple efficient method of dip-moveout correction: Geophys. Prosp., 38, 221-245.
Landa, E., Gurevich, B., Keydar, S., and Trachtman, P., 1999, Application of multifocusing method for subsurface imagingł J. Appl. Geophys., 42, 283-300.
Levin, F.K., 1971, Apparent velocity from dipping interface reflections: Geophysics, 36, 510-516.
Li, Z., Lynn, W., Chambers, R., Larner, K. and Abma, R., 1991, Enhancements to prestack frequency-wavenumber ( f k f k f-kf-kfk ) migration: Geophysics, 56 , 27 40 56 , 27 40 56,27-4056,27-4056,2740.
Liner, C. L., 1990, General theory and comparative anatony of dip-moveout Geophysics, 55, 595-607.
Margrave, G., Bancroft, J. C., and Geiger, H. D., 1999. Fourier prestack migration by cquivalent wavenumber: Geophysics, 64, 197-207.
Marcoux, M. O., Godfrey, R. J., and Notfors, C. D., 1987, Migration for optimum velocity evaluation and stacking: Presented at the 49th Ann. Mtg. European Asn. Expl. Geophys.
Nutfors, C. D. and Godfrey, R. J., 1987, Dip-moveout in the frequency-wavenumber doman: Geophysics, 52, 1718-1721.
Ottolni, R., 1982, Migration of seismic data in angle-midpoint coordinates: Ph D. thess, Stanford University.
Ratcliff, D. W., Gray, S. H., and Whitmore, N. D., 1992, Scismic imaging of salt structures in the Gulf of Mexico: The Leading Edge, 11, no. 4, 15-31.
Rocca, F., Bolondi, G., and Loinger, E., 1982, Offset continuation of seismic sections: Geophys. Prosp., 30, 813-828.
Salvador, L. and Savelli, S., 1982, Offset continuation for seismic stacking: Geophys. Prosp., 30, 829-849.
Sherwood, J.W.C., Schultz, P.S., and Judson, D.R., 1978, Equalizing the stacking velocities of dipping events va Devilish: Presented at the 48th Ann. Internat. Soc. Expl. Geophys. Mtg.
Shurtleff, R., 1984, An F K F K F-KF-KFK procedure for prestack migration and velocity analysis: Presented at the 46th Ann. Mtg. European Asn. Expl. Geophys.
Sorin, V. and Ronen, J., 1989, Ray-geometrical analysis of dip moveout amplitude distribution: Geophysics, 54, 1333-1335.
Stolt, R.H., 1978, Migration by Fourier transform: Geophysics, 43, 23-48.
Taner, M.T. and Kochler, F., 1969, Velocity spectra - digital computer derivation and applications of velocity functions: Geophysics,32, 859-881.
Tygel, M., Müller, T., Hubral, P., and Schleicher, J,, 1997, Eigenwave-based multiparameter traveltime exparsions: 67 th 67 th  67^("th ")67^{\text {th }}67th  Ann. Internat. Mtg, Soc. Expl. Geophys., Expanded Abstracts, 1770 - 1773.
Yilmaz, O, and Chambers, R+, 1984, Migration velocity analysis by wave field extrapolation: Geophysics, 49, 1664-1674.
Yilmaz, O. and Olacrbout, J.F., 1980, Prestack partial migration: Geophysics, 45, 1753-1777.
Zhou, B, Mason, I. M., and Greenalgh, S.A., 1996, Accurate and efficient shot-gather dip-moveout. processing in the log-stretch domain: Geophys. Prosp., 43, 963-978.

6 Noise and Multiple Attenuation

  • Introduction *\cdot Coherent Linear Noise - Treatment of Coherent Linear Noise by Conventional Processing \bullet Reverberations and Multiples \bullet Trectment of Reverberations and Multiples by Conventional Processing \bullet Spatially Random Noise - Multiple Attenuation in the CMP Domain - Periodicity of Multiples - Velocity Discrimination Between Primaries and Multiples *\cdot Karhunen-Loeve Transform - Modeling of Multiples *\cdot Frequency-Wavenumber Filtering *\cdot Random Noise and Frequency-Wavenumber Filtering *\cdot Statics Corrections and Frequency-Wavenumber Filtering - Dip Filtering of Coherent Linear Noise - Frequency-Wavenumber Multiple Attenuation - The SlantStack Transform *\cdot Physical Aspects of Slant Stacking *\cdot Slant-Stack Transformation - Practical Aspects of Slant Stacking *\cdot Slant-Stack Parameters *\cdot Time-Variant Dip Filtering *\cdot Slant-Stack Multiple Attenuation \bullet The Radon Transform *\cdot Velocity-Stack Transformation *\cdot The Discrete Radon Transform - The Parabolic Radon Transform - Practical Considerations *\cdot Impulse Response of the Velocity-Stack Operator ~  Field Data Examples *\cdot RadonTransform Multiple Attenuation *\cdot Linear Uncorrelated Noise Attenuation - Design of Spatial Prediction Filters *\cdot Field Data Examples - Exercises - Appendix F: Multichannel Filtering Techniques for Noise and Multiple Attenuation - Analysis of Guided Waves *\cdot Wavefield Extrapolation in the τ p τ p tau-p\tau-pτp Domain \bullet Mathematical Foundation of the Discrete Radon Transform *\cdot Free-Surface Multiple Attenuation *\cdot Water-Bottom Multiple Attenuation - Spatial Prediction Filter *\cdot References

6.0 INTRODUCTION

In Section 1.3, we examined noise and signal characteristics of seismic data from 40 common-shot gathers. Noise generally is classified into two categories - random noise and coherent noise. The random noise category includes noise in the temporal direction and spatially random noise that is uncorrelated from trace to trace. The first type of random noise usually is stronger at late times than early times in recorded data. Timevariant bandpass filtering usually is applied to attenuate much of the temporally random noise. A powerful process that attenuates much of the random noise uncorrelated from trace to trace is conventional CMP stacking. By using multiple receivers per channel, nu]tiple sources per record and multiple fold of coverage, signal-to-noise ratio is increased significantly. A comprehensive review of random noise and its analysis is given by Sengbush (1983). The coherent noise category includes linear noise, and reverberations and multiples. Coherent linear noise types include guided waves, which often are abundantly present in shallow marine data, ground roll and noise associated with shallow waterbottom side scatterers.

Coherent Linear Noise

Two types of coherent linear noise that deserve special attention are guided waves and side-scattered energy. Figure 6.0-1 shows field data with coherent linear noise in three different domains - common-shot gather, common-midpoint gather, and CMP stack. The dispersive waves labeled as A A AAA in Figure 6.0-1a are guided waves, and the linear events B B BBB and C C CCC and the events D D DDD with curvature are associated with side scatterers. Guided waves manifest themselves as dispersive linear noise on both common-shot and CMP gathers, but are attenuated largely by stacking.
Guided waves are trapped in a water layer or in a low-velocity near-surface layer and travel in the horizontal direction. They are dispersive - each frequency component propagates with a different phase velocity, and are best described by norral-mode propagation. Numerical modeling of guided waves using normalmode propagation theory is presented in Section F.1. Since they do not contain any useful reflection energy, guided waves usually are muted on CMP gathers. When one mode splits away from the rest of the guided wave packet and travels at lower speeds, and thus overlaps with reflection events, then dip filtering in the f k f k f-kf-kfk domain is needed (Section 6.2).
An excellent example of guided waves is seen on the field record (between 1 and 4.5 s 4.5 s 4.5s4.5 \mathrm{~s}4.5 s at far offset) shown in Figure 6.0-2. The first part of the wave packet between 1 and 1.5 s 1.5 s 1.5s1.5 \mathrm{~s}1.5 s at far offset contains low frequencies. High frequencies ride along the direct arrival path at approximately 0.3 s 0.3 s 0.3s0.3 \mathrm{~s}0.3 s at near offset and 1.8 s 1.8 s 1.8s1.8 \mathrm{~s}1.8 s at far offset, followed by moderate frequencies between 1.8 2.8 s 1.8 2.8 s 1.8-2.8s1.8-2.8 \mathrm{~s}1.82.8 s at far offset. The very-low frequency dispersed wavetrain with high amplitudes between 2.8-4.5 s s s\mathrm{s}s at far ofiset corresponds to the mode that has split from the rest of the guided-wave modes. This happens when there is a shallow, soft water bottom associated with a mud layer. Also seen on this record is the backscattered guided wave (zone B B BBB ) with reverse linear moveout, which indicates the presence of irregularities over the ocean bottom. These irregularities also cause arrivals (zone A A A\boldsymbol{A}A ) that represent point scatterers.
The dispersive nature of guided waves can vary along a seismic traverse depending on water depth and water-bottom conditions. The shallower the water depth and the softer the water bottom, the more the dispersion and splitting of modes associated with guided waves (Figure 6.0-3).
Side-scattered energy has a large noveout range depending on the position of the scatterer acting as a point source at the water bottom with respect to the position of the recording cable (events B , C B , C B,CB, CB,C, and D D DDD in Figure 6.0-1a). Side-scattered energy manifests itself with varying moveout on common-shot gathers (Figure 6.0-1a), and is not apparent on CMP gathers (Figure 6.0 1 b 6.0 1 b 6.0-1b6.0-1 \mathrm{~b}6.01 b ), but reappears as linear noise on stacked sections (Figure 6.0-1c) (Larner et al., 1983).
Side-scattered energy stacks at high velocities along the linear flanks of its traveltime curve. We then anticipate that the linear noise seen on a stacked section, particularly at late times, most likely is scattered energy along the flanks of its traveltime curve, stacked together with high-velocity primary energy (Figure 6.04).
Linear noise associated with side scatterers is recognized easily on time slices from a 3-D volume of stacked data. Note in Figure 6.0-5 the circular patterns expanding out from the source of a series of point scatterers at the water bottom. In this case, certain parts of the sea-bottom pipelines act as point scatterers.
Attenuation of coherent linear noise associated with side scatterers may be achieved by f k f k f-kf-kfk filtering (Section 6.2), τ p τ p tau-p\tau-pτp transform (Section 6.3) or Radon transform (Section 6.4) techniques. A linear event on a shot record maps onto a radial line in the f k f k f-kf-kfk domain, and thus can be rejected by f k f k f-kf-kfk dip filtering. A linear event on a shot record maps onto a point in the τ p τ p tau-p\tau-pτp domain, and thus can be rejected by muting in the τ p τ p tau-p\tau-pτp domain. Finally, spatially random noise and coherent linear noise are not included in the mapping from CMP domain to Radon-transform domain based on hyperbolic moveout. As a result, the reconstructed CMP gather by way of inverse transform will be free of noise.
Coherent linear noise also exists in land data in the form of dispersive Rayleigh wave, commonly known as ground roll. This type of coherent noise has low group velocity and large amplitudes and is limited to low frequencies. In fact, as shown in Figure 6.0-6, ground-roll energy aimost always dominates the reflection energy that may be present in the recorded data. Only after some type of amplitude scaling, reflections becorne visible (Figure 6.0-7). Note from the selected shot records in Figure 6.06 that the dispersive waves associated with the ground-roll energy change in strength and stepout (the dip of the linear noise trend) as a result of variations in the near-surface conditions.
Swell noise manifests itself on shot records in the form of low-frequency vertical streaks (Figure 6.0-8). This type of noise arises from rough weather conditions during marine seismic recordings, especially in shallow waters. A low-cut filter often removes the swell noise from shot records.
Finally, cable noise is one other type of coherent noise that manifests itself in the form of low-frequency linear events with very large stepout as seen on the shot records in Figure 6.0-9. Note the increase in the
a
6.0-2. A shot gather containing predominantly gunded waves. See text for a description of the labeled events.
energy level of the cable noise as the water depth becomes shallower. As for the swell noise, a low-cut filter often removes the cable noise from shot records.

Treatment of Coherent Linear Noise by Conventional Processing

We shall apply a processing sequence to a marine 2 D D DDD data set that includes very basic steps without any special attempt to attenuate coherent linear noise. The objective is to examine the treatment of such noise by the three principal processes deconvolution, stacking and migration.
Figure 6.0-10 shows selected raw shot records from the marine line under consideration. Note the presence of guided waves in all the records in the form of a prominent dispersive wave package. The dispersive nature of guided waves is pronounced especially in shallow water. Because of their high amplitudes, guided waves dominate recorded marine data before the correction for geometric spreading. Since they travel in the horizontal direction within the water layer, guided waves do not contribute to the useful reflection energy. Therefore, these waves are often muted in shallow records as shown in Figure 6.0-11. Unfortunately, some reflection energy at far offsets is inadvertently removed as a result of muting the guided waves.
Following t 2 t 2 t^(2)t^{2}t2-scaling of amplitudes to compensate for geometric spreading, we note the enhancement of coherent noise at late times. Note in Figure 6.0-11, the records at shot points 300 and 400 contain linear noise below 2 s 2 s 2s2 \mathrm{~s}2 s, and all records except at shot point 200 contain coherent noise with a curvature below 3 s 1 3 s 1 3s_(1)3 s_{1}3s1 all associated with side scatterers. Additionally, observe the low-frequency cable noise with large stepout especially at near offsets below 3 s 3 s 3s3 \mathrm{~s}3 s on the records at shot points 300 , 400 , 600 300 , 400 , 600 300,400,600300,400,600300,400,600, and 700 .
Deconvolution flattens the spectrum and as a result enhances the low-frequency cable noise as seen in Figure 6.0-12. After the application of a wide bandpass filter, very low-frequency and very high-frequency noise components are removed. Nevertheless, the side-scattered energy with varying moveout still remains in the shot records (Figure 6.0-13).
When data are sorted to CMP gathers, the linear nature of the coherent noise associated with side scatterers disappears (Figure 6.0-14). On the other hand, side-scatterer noise with curvature behaves like events with nonhyperbolic moveout. Following the normalmoveout correction and stacking, the side-scatterer energy reappears as in Figure 6.0-15. Note the dipping linear noise along the steep flanks of the diffractions associated with the side scatterers in the water bottom. The steeply dipping linear noise at water velocity should
6.0-5. A time slice from an unmigrated 3-D volume of stacked data which exhibits circular patterns associated with point scatterers along sea-bottom pipelines. (Data courtesy Total Argentina.)
not be confused with the diffractions of the flanks of the salt diapirs at higher velocities.
Coherent linear noise asociated with side scatterers are attenuated largely by dip-moveout correction (Section 5.2). Compare the stacked section in Figure 6.0-16 with that in Figure 6.0-15, and note that DMO correction has enhanced the diffractions associated with the salt flanks while it has attenuated the linear noise associated with the side scatterers. Any remaining sidescatterer related noise at late times is overmigrated as a result of the higher primary velocities (Figure 6.0-17).

Reverberations and Multiples

In this chapter, we shall discuss multiple attenuation techniques based on velocity discrimination betwern multiples and primaries, and periodicity of multiples. While these techniques seem to have a good conceptual basis, their performance on field data can be disappointing. There are several possible explanations for this.
First, for velocity discrimination techniques to be effective, significant moveout differences must texist between primaries and multiples. However, the inability
FIG. 6.0-9. Selected shot records from a marine 2-D line with swell noise.

(a)
(b)
(c)
(d)
6.0-18. A sketch of raypaths associated with various types of multiples. The shallowest interface in each case represents the water bottom. See text for details.
to exploit the large moveout differences between primaries and multiples in the mute zone works against the methods based on velocity discrimination.
Periodicity of multiples is preserved for the ideal case of zero offset and horizontally layered earth. At nonzero offsets, periodicity often is destroyed even for the horizontally layered case. Nevertheless, periodicity is better preserved for the horizontally layered earth in the slant-stack domain. Multiple attenuation in this domain is discussed in Section 6.3.
There is also a problem caused by the application of geometric spreading correction (Section 1.4), when it is applied using the primary velocity function. This type of correction usually results in enhancement of the amplitudes of multiple reflections. The slant-stack approach (Section 6.3) is implemented before the geometric spreading correction, so there is no danger of amplifying the multiple energy.
In Sections F. 4 and F.5, we shall review the theory of multiple attenuation using wave extrapolation techniques. These are targeted for a specific class of multiples those which are either associated with the free surface or water bottom.
We now examine the various types of multiples in recorded marine data in different domains shot records, common-offset sections and CMP gathers. Most multiple reflections arise from an interface with a strong impedance contrast such as the free surface and water bottom. Figure 6.0-18 shows raypath diagrams for:
(a) water-bottom multiples of first- and second-order,
(b) free-surface multiples of first- and second-order,
(c) peg-leg multiples of first- and second-order,
(d) intrabed multiples of first- and second-order, and
(e) interbed multiples of first- and second-order.
These are but a few of the numerous configurations of raypaths associated with multiple reflections encountered in recorded data. Regardless of the type of multiples, they all have two common properties that can be exploited to attenuate them with varying degree of success perodicaty and moveout that is different from primaries.
Figure 6.0-19 shows selected marine shot records which exhibit a broad range of multiples. The shot records over the deep water contain long-period waterbottom multiples and peg-leg multiples associated with reflectors just below the water bottom. Whereas the shot records over the shallow water contain short-period multiples and reverberations. Note the guided waves in the shallow-water records that also contain multiples which have raypaths within the water layer.
Figure 6.0-20 and 6.0-21 show selected CMP gathers and segments of near-offet sections associated with the data as in Figure 6.12-19. The near-offset sections have been moveout-corrected to zero offset - thus the small differences in the arrival times between those on the near-offset trace in the CMP gathers and traces in these moveout-corrected near-offset sections. Observe the existence of a broad range of multiple types in these pairs of CMP gathers and near-offset sections. The velocity spectra computed from the CMP gathers in Figures 6.0 20 6.0 20 6.0-206.0-206.020 and 6.0 21 6.0 21 6.0-216.0-216.021 are displayed in Figure 6.0-22.

Treatment of Reverberations and Multiples by Conventional Processing

We shall apply a processing sequence to a marine 2D data set that includes very basic steps without any special attempt to attenuate multiples. The objective is to examine the treatment of various types of multiples by prestack and poststack deconvolution, the stacking process itself, and by prestack and poststack migration.
Figures 6.0 23 6.0 23 6.0-236.0-236.023 through 6.0 34 6.0 34 6.0-346.0-346.034 show portions of the following processing products associated with the data as in Figure 6.0-20 and 6.0-21:
(a) a movenut-corrected near-offset section,
(b) CMP-stacked section with no prestack and poststack deconvolution,
(c) CMP-stacked section with prestack deconvolution, only, and
(d) CMP-stacked section with prestack and poststack deconvolution.
The velocity spectra computed at the central CMP locations from the data as in (b) and (c) for each panel are shown in Figures 6.0 35 6.0 35 6.0-356.0-356.035 and 6.0 36 6.0 36 6.0-366.0-366.036.
Note from the near-offset sections in Figures 6.023a through 6.0 34 6.0 34 6.0-346.0-346.034 a the abundance of a wide variety of multiples. CMP stacking itself (Figures 6.0 23 b 6.0 23 b 6.0-23b6.0-23 \mathrm{~b}6.023 b through 6.0 34 b 6.0 34 b 6.0-34b6.0-34 \mathrm{~b}6.034 b ) without the aid of any special multiple attenuation process suppresses a significant amount of energy associated with the multiples based on the moveout difference between the primaries and multiples.
Prestack deconvolution with the added power of conventional stacking (Figures 6.0 23 c 6.0 23 c 6.0-23c6.0-23 \mathrm{c}6.023c through 6.0 34 c 6.0 34 c 6.0-34c6.0-34 \mathrm{c}6.034c ) greatly suppresses a larger portion of the energy associated with the multiples. The corresponding velocity spectra shown in Figures 6.0 35 6.0 35 6.0-356.0-356.035 and 6.0 36 6.0 36 6.0-366.0-366.036 illustrate the combined power of prestack deconvolution and conventional stacking in attenuating multiples. The cascaded effect of pre- and poststack deconvolution in attenuating multiples is demonstrated in Figures 6.0-23d through 6.0-34d.
Despite the theoretical limitation that periodicity of multiples strictly is preserved only for zero-offset recording over a horizontally layered earth, practical experience as exemplified by Figures 6.0-23 through 6.0-36 convincingly suggests that statistical deconvolution can be a powerful tool for multiple attenuation. Coupled with conventional stacking, which exploits the velocity discrimination property, these two processes constitute a powerful combination to attenuate a broad range of multiples.
How does migration treat multiples? Figure 6.0-37 shows shallow portion of a CMP stack before and after poststack migration. Note the diffracted first-order water-bottom multiple reflection at approximately 750 ms. Migration collapses the diffractions along the water bottom. However, the diffractions accompanying the first-order multiple reflection are overmigrated since the migration velocity is the primary velocity at 750 m s 750 m s 750ms750 \mathrm{~ms}750 ms. The diffracted multiples would have been collapsed had the water velocity been used to migrate the data.
Figure 6.0-38a shows a portion of a CMP-stacked section that contains a strong primary reflection between 1 and 2 s 2 s 2s2 \mathrm{~s}2 s and the associated first-order multiple with a steeper apparent dip between 1.8 and 3.2 s 3.2 s 3.2s3.2 \mathrm{~s}3.2 s, The overmigration of multiple reflections by poststack migration (Figure 6.0-38b) is more pronounced in that the apparent dip of a multiple reflection is greater than the dip of the primary associated with that multiple. Poststack migration has treated the multiple reflection in Figure 6.0-38a as a dipping primary and moved it to a position based on the primary velocity that was used to migrate the stacked section.
Prestack migration can provide the bonus effect of attenuating multiples as a result of velocity discrimination between primaries and multiples. More specifically, by using a velocity field that is appropriate for migrating primaries, multiples are undermigrated. This



菼识豆 름 응

त्े율 考
몯하
露雚



곤 홀
로을
웅울
동 8
댕 항융
ف. 8
FIG. 6.0-37. Shallow portion of a CMP stack (top) and the same portion after time migration (bottom). Note the overmigrated diffracted water-bottom multiple at 0.75 s 0.75 s 0.75s0.75 \mathrm{~s}0.75 s.
would result in residual moveout associated with multiples on common-reflection-point (CRP) gathers derived from prestack migration. Subsequent stacking of the CRP gathers would have an attenuation effect on multiples. Note the absence of the multiple in the prestack migrated section in Figure 6.0-38c.
Figure 6.0-39 shows selected CRP gathers from prestack time migration of data as in Figure 5.4-21 using the same velocity field as in Figure 5.4-20, but with no multiple attenuation. Note the large moveouts associated with the multiple reflections. As a result of the moveout difference between primaries and multiples, stacking of the CRP gathers can to a large extent attenuate multiples. Often, as in conventional CMP stacking, CRP stacking with (Figure 5.4-22) and without (Figure 6.0-40) multiple attenuation yields comparable image quality from prestack time migration. Nevertheless, the CRP gathers derived from data that have been subjected to multiple attenuation are preferred if a postmigration velocity update is required. Compare the CRP gathers from prestack time migration of data with multiple attenuation (Figure 5.4-21) and without multiple attenuation (Figure 6.0-39), and note the interference of multiples when picking flat primaries.

Spatially Random Noise

The spatially random noise uncorrelated from trace to trace is largely attenuated by CMP stacking (Section 1.5). Any remaining noise on stacked data can be attenuated by spatial prediction filters. Figure 6.0 41 6.0 41 6.0-416.0-416.041 shows a stacked section before and after noise attenuation. The process of noise attenuation is meant to achieve attenuation of noise so as to enhance coherent events such as reflections on a stacked section. It is not meant to create any coherent events that do not exist in the data.
The spatial prediction filters also can be applied to common-offset data prior to stacking. They are conveniently designed and applied in the frequency-space domain. What is predictable by a prediction filter for a given frequency component is a signal in the lateral
FIG. 6.0-38. (a) A portion of a CMP stack; (b) poststack time migration; (c) prestack time migration. direction and what is not predictable is considered spatially random noise. This is just the opposite of what is intended by statistical deconvolution (Chapter 2). Specifically, the predictive deconvolution operator is a prediction error filter, and the output from predictive deconvolution is the unpredictable part of the input the white reflectivity series. What is predictable by predictive deconvolution is multiples contained in a onedimensional (1-D) seismogram associated with vertical incidence.
In Section 6.5, a frequency-space prediction filter for attenuation of spatially random noise is presented accompanied by a mathematical discussion in Section F.4.

6.1 MULTIPLE ATTENUATION IN THE CMP DOMAIN

We have observed many types of multiples on shot gathers in Section 1.3. Multiples are attenuated based on two principle criteria - periodicity and velocity discrimination. As in the case of coherent linear noise, these criteria are exploited in whichever domain they are applicable. For instance, periodicity is preserved to a great extent for short-period multiples and reverberations on CMP gathers, especially at near offsets. Periodicity also is preserved in the τ p τ p tau-p\tau-pτp domain, provided multiples are associated with near-horizontal reflectors.
CMP stacking facilitates attenuation of multiples besed on velocity discrimination between primaries and multiples. This criterion to attentate multiples also can be exploited in the f k , τ p f k , τ p f-k,tau-pf-k, \tau-pfk,τp, and Radon-transform domains. The degree of success depends on the moveout difference between primaries and multiples, and hence, on velocities and arrival times of primary reflections, and the cable length. Specifically, the moveout difference between primaries and multiples decreases at shallow times, low velocities, and at near offsets.

Periodicity of Multiples

When periodicity is preserved adequately, predictive deconvolution can be used to predict and attenuate multiples either in CMP or in the τ p τ p tau-p\tau-pτp domain. For instance, short-period multiples and reverberations are largely attenuated by the application of predictive deconvolution to prestack data. Figure 6.1-1 shows selected CMP gathers along a marine line with the accompanying amplitude spectra and their autocorrelograms averaged over the traces of each gather. Note the abundance of guided
FIG. 6.0-39. Selected image gatbers from prestack time migration using the velocity field shown in Figure 5.4-20. These gathers were obtained from data that were not subjected to multiple attenuation prior to prestack time migration. Compare with the gathers shown in Figure 5.4-21.
FIG. 6.0-40. The stack of image gathers as in Figure 6.0-39 derived from prestack time migration. Compare with the stack shown in Figure 5.4-22.
(a)
(b)
(c)
FIG. 6.1-4. (a) CMP stack associated with the gathers shown in Figure 6.1-2 without prestack deconvolution; (b) CMP stack associnted with the gathers shown in Figure 6.1-3 with deconvolution before stack; (c) CMP stack as in (b) with the additional deconvolution after stack.
waves in the postcritical region (approximately between 0.0 .5 s 0.0 .5 s 0.0.5s0.0 .5 \mathrm{~s}0.0.5 s at near offset and 0 4 s 0 4 s 0-4s0-4 \mathrm{~s}04 s at far offset), and shortperiod multiples and reverberations in the subcritical region (below 0.5 s 0.5 s 0.5s0.5 \mathrm{~s}0.5 s at near offset and below 4 s 4 s 4s4 \mathrm{~s}4 s at far offset). (See Section F. 1 for modeling guided waves.) The peaks of the amplitude spectra are associated with the short-period multiples. The smaller the period of the multiples, the larger the separation of the peaks in the amplitude spectrum. The refracted arrival and its multiples as part of the guided wave energy indicate that the line has been recorded over a hard water-bottom area. Following t t ttt-squared scaling for geometric spreading correction and muting guided waves (Figure 6.1-2), the periodicity character of the multiples becomes more distinctive, particularly at near offsets. With the application of predictive deconvolution using unit-prediction lag (Figure 6.1-3), the amplitude spectrum is flattened within the passband, and multiples are greatly attenuated. The multiple attenuation also is indicated by the autocorrelograms of the deconvolved gathers in Figure 6.1-3.
Figure 6.1-4a shows the CMP stack associated with the gathers in Figure 6.1-2 without multiple attenuation, and Figure 6.1-4b shows the CMP stack associated with the gathers in Figure 6.1-3 with multiple attemation using deconvolution. Compare these two stacked sections and note that deconvolution before stack has attenuated much of the short-period multiples. Additional deconvolution after stack further improves the vertical resolution by restoring the flatness of the spectrum within the passband (Figure 6.1-4c).
Figure 6.1-5 shows a CMP gather with and without deconvolition. Aside from water-battom multiples, note the peg-leg multiples associated with the two primaries with arrival times of 1.5 and 2 s 2 s 2s2 \mathrm{~s}2 s at near offset. The autocorrelogram clearly exhibits periodicity of the multiples especially at near offsets. Following predictive deconvolution (in this case with a unit-prediction lag), multiples are largely attenuated as seen in Figure 6.1 . 4 b 6.1 . 4 b 6.1.-4b6.1 .-4 \mathrm{~b}6.1.4 b. The corresponding autocorrelogram is void of the energy associated with the reverberations and multiples. High-frequency random noise that has been boosted by the whitening effect of spiking deconvolution can be filtered out.
Figures 6.1-6 and 6.1-7 clearly demonstrate that conventional statistical deconvolution is a powerful method for attenuating not just short-period multiples and reverberations, but also moderately long-period multiples based on the periodicity criterion. The data shown in Figure 6.1-6 contain nearly flat primary reflections, while the data in Figure 6.1-7 contain some dipping primary reflections. The water-bottom multiples in both figures arrive at intervals of approximately
Autocorrelograms (a)
FIG. 6.1-5. A field record containing short-period reverberations before (a) and after deconvolution (b). The solid lines represent the start and end times for the autocorrelation estimation windows.
350 ms. There also exist peg-leg multiples associated with the primaries at approximately 1.5 and 2.5 s 2.5 s 2.5s2.5 \mathrm{~s}2.5 s in Figure 6.1-6, and the primaries at approximately 1.5 and 2.1 s 2.1 s 2.1s2.1 \mathrm{~s}2.1 s in Figure 6.1-7. In a conventional processing sequence, prestack and poststack deconvolution combined with CMP stacking, which exploits velocity discrimination between primaries and long-period maltiples, can significantly attenuate a large class of multiples.

Velocity Discrimination Between Primaries and Multiples

The CMP gathers in Figure 6.1-8a clearly illustrate the moveout difference between primaries and multiples. A primary p p ppp typically has less moveout than a multiple m m mmm. From the velocity spectrum in Figure 6.1-8b, note the difference between the velocity trends associated with primaries V P V P VPV PVP and multiples V M 1 V M 1 VM1V M 1VM1 and V M 2 V M 2 VM2V M 2VM2. The V M 1 V M 1 VM1V M 1VM1 and V M 2 V M 2 VM2V M 2VM2 velocity functions represent the water-bottom and peg-leg multiples, respectively. If NMO correction is applied using the primary velocities, as is normally done to generate final stacks, then the primaries are aligned while the multiples are undercorrected (Figure 6.1-8c). This suggests that CMP stacking itself is a viable method of multiple attenuation. The CMP stack derived from the gathers in Figure 6.1-8c is shown in Figure 6.1-8d.
The synthetic CMP gather in Figure 6.1-9c contains five primaries, including the water-bottom reflection W W WWW and the multiples associated with it. The velocity spectrum shows a significant separation between the velocity functions for multiples V M V M VMV MVM and primaries V P V P VPV PVP. Stacking with the primary velocity function should, to a large extent, discriminate against the multiples and result in a section that contains essentially the primary energy as shown in Figure 6.1-10. The stack trace in Figure 6.1-10c is repeated to better examine the relative amplitudes of the primaries and the multiples.
Stacking far offsets works to suppress multiples. However, stacking near offsets works against multiple attenuation, since the moveout difference between primaries and multiples is negligibly small on those offsets as in Figure 6.1-8c. The simplest way around this problem is to apply an inside mute to the CMP gathers before stacking. Another problem then emerges the outside mute. The severity of this mute governs the amount of far-offset data left at early times for velocity discrimination (Figure 6.1-8c). If there is a severe multiple problem, an effort must be made to preserve the maximum amount of far-offset data associated with target events. The stacked section of Figure 6.1-8d with inside mute applied is shown in Figure 6.1-11a. When compared with Figure 6.1-8d, note that the deeper pegleg multiple below 4 s 4 s 4s4 \mathrm{~s}4 s has been further attenuated by inside trace muting. The difference between the conventional CMP stack (Figure 6.1-8d) and the inside mute stack (Figure 6.1-11a) shown in Figure 6.1-11b indicates the amolint of energy, mostly multiples, that was removed by the inside mute.
A variation of conventional muting, such as optimum-weighted stacking can produce better results. In such a a aaa scheme, weights between 0 and 1 are assigned to each offet during stacking. The smaller weights are normally assigned to the near offsets.
In summary, because there is relatively less moveout differential between the primaries and multiples in the near-offset range, the inside mute (or some kind of weighted stacking) helps suppress multiples. Hence, it may help to cascade any one of the multiple attenuation techniques described in this chapter with inside mute during stacking.

Karhunen-Loeve Transform

Actually, there is a much more powerful technique than inside-trace muting or optimum-weighted stacking to attenuate multiples. It is based on Karhunen-Loeve (KL) transform (Jones and Levy, 1987; Ulrych et al., 1988; Al-Yahya, 1991). The basic underlying concept is that one can decompose a two-dimensional data set, such as a stacked section in space-time coordinates, into a number of components the so-called eigenimages, starting with the first eigenimage that contains the highest. correlatable events, moving onto the next eigenimage with events with less degree of correlation, all the way to the last eigenimage that comprises the least correlatable components. Each eigenimage comprises the same number of traces as the original data set. Singular-value decomposition (Section F.3) is one way of decomposing a data set into its eigenimages.
So, how is this transform applicable to stacking and multiple suppression? If you apply NMO correction to CMP gathers using the primary velocities, then the primaries will be flattened and thus will have the highest correlatability from trace to trace in the gathers. Hence, these primaries will map into the first eigenimage of the K L K L K-L\mathrm{K}-\mathrm{L}KL transform. By retaining only the first eigenimage and discarding the others, and stacking the traces in the first eigenimage, one can obtain a stacked trace that is virtually free of random and coherent noise such as multiples. Of comrse, in reality, there is always some noise component that creeps into the first eigenimage. This happens, for example, when there is very little moveout
(a)
(c)
(d)
FIG. 6.1-8. (a) Three CMP gathers with strong multiples; (b) velocity analysis at CMP 186 , where V P = V P = VP=V P=VP= primary velocity trend, V M 1 = V M 1 = VM1=V M 1=VM1= slow (water-bottom) multiples, and V M 2 = V M 2 = VM2=V M 2=VM2= fast (peg-leg) multiples. ( V B V B VBV BVB is the velocity function used in generating Figure 6.2-15a.) For reference, the CMP gather is displayed next to the velocity spectrum. (c) The same CMP gathers as in (a) after NMO correction using the primary velocities. (d) CMP stack using the gathers as in (c). (Data courtesy Petro-Canada Resources.)
(a)
(b)
(c)
(d)
FIG. 6.1-9. Synthetic CMP gathers containing (a) primaries, (b) water-bottom multiples, (c) superposition of (a) and (b). (d) The velocity spectrum derived from (c). Here, W = W = W=W=W= water-bottom primary, V M = V M = VM=V M=VM= velocity function for multiples, V P = V P = VP=V P=VP= velocity function for primaries, V B = V B = VB=V B=VB= a velocity function between V M V M VMV MVM and V P V P VPV PVP used in generating Figure 62 12 b 62 12 b 62-12b62-12 \mathrm{~b}6212 b
difference between primaries and multiples. An alternative strategy that is aimed at multiple suppression involves moveout correction using multiple velocities, rather than primary velocities.
Start with a modeled CMP gather as shown in Figure 6.1-12a that contains a primary (arriving at 0.2 s 0.2 s 0.2s0.2 \mathrm{~s}0.2 s at zero offset) and the associated multiples. This gather also contains three additional primaries (at 0.4 , 0.8 0.4 , 0.8 0.4,0.80.4,0.80.4,0.8 and 1.2 zero-offset times) that are weaker in amplitude compared to the multiples. The moveout difference between the multiples and primaries is less than 100 ms at the far offset.
Apply NMO correction using the multiple velocity, in this case constant 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s. Mutiples are flattened, and primaries are overcorrected (Figure 6.1-12b). Then perform singular-value decomposition, which is the basis for K-L transform, and examine the first eigenimage (Figure 6.1-12c). Note that the highest correlatable events in this gather are those events with the moveout velocity of 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s the primary at 0.2 -s zero-offset time and the associated multiples. Subtract this eigenimage from the original NMO-corrected gather (Figure 6.1-12b) to get the gather that is a composite of all the eigenimages except the first one (Figure 6.1-13a). Note that miltiples have been attenuated and the weak primaries have been retained. Because we did not reject the higher eigenimages associated with the least correlatable energy, including the random noise, this energy is present in the output gather in Figure 6.1-13a.
Finally, apply inverse NMO correction using the same multiple velocity function to obtain the gather after multiple attenuation (Figure 6.1-13b), which should
(a)
(b)
(c)
FIG. 6.1-10. (a) The CMP gather in Figure 6.1-9c and (b) after NMO correction using the primary velocity function ( V P V P VPV PVP in Figure 6.1-9d). (c) The stack trace derived from (b) repeated to emphasize the strong cvents.
(a)
(b)
6.1-11. (a) The CMP stack derıved from the CMP gathers in Figure 61 8 c 61 8 c 61-8c61-8 \mathrm{c}618c with inside mute apphed. The inside mute pattern can be recognized on the left edge of the section. Compare this stack with that shown in Figure 6.1-8d. (b) The difference between the conventional CMP stack (Figure 6 1-8d) and the inside mute stack (a). (Data courtesy Petro-Canada Resources.)
(a)
(b)
(c)
6.1-12. (a) A modeled CMP gather with a primary at 0.2 s s sss zero-offset time and its multiples, and with three additional primaries at 0.4 , 0.8 and 1.2 s 1.2 s 1.2-s1.2-\mathrm{s}1.2s zero-offset times. The gather also contains band-limited random noise. (b) the same gather after NMO correction using the velocity of multiples ( 3000 m / s 3000 m / s 3000m//s3000 \mathrm{~m} / \mathrm{s}3000 m/s ) and muting; (c) the eigenmage associated with the first eigenvalue derived from singular-value decomposition of the moveout-corrected gather. This eigenimage contains the primary at 02 -s zero-offset time and its associated multiples.
be compared with the original gather without multiple attenuation (Figure 6.1-13c). Note that, the K-L transform, in principle, is a very powerful data decomposition technique that can be used to attenuate multiples.
In addition to multiple attenuation, the K-L transform also can be used to attenuate random noise by simply rejecting the corresponding eigenimages. For instance, a 60 -trace CMP gather would be decomposed into 60 eigenimages. Those eigenimages with eigenvalues between, say 55 and 60 , would contain the random noise to be rejected.
Figure 6.1-14a shows a CMP gather that contains strong water-bottom and peg-leg multiples. Following moveout correction using the water velocity, the waterbottom multiples are flattened, peg-legs are slightly overcorrected and primaries, which are visible at far offsets below 2 s 2 s 2s2 \mathrm{~s}2 s, are significantly overcorrected (Figure 6.1-14b).
By the K-L transform, the gather is decomposed into its eigenimages. Figure 6.1-15 shows the reconstructed gather as in Figure 6.1-14b using only a subset of the eigenimages. The reconstructed gather using only the first eigenimage contains just a few of the strong moveout-corrected multiples. With the inclusion of additional eigenimages, the reconstructed gather is allowed to contain events with some moveout. By exam-
(a)
(b)
(c)
6.1-13. (a) The difierence gather derived from subtracting the first elgenimage gather (Figure 6.1-12c) from the moveout-corrected gather (Figure 6.1-12b), (b) same difference gather after inverse moveout correction, and (c) original modeled gather as in Figure 6.1-12a with the stretch mute as in (b). The gathers in (c) and (b) are before and after multiple attenuation using the K-L transform.
ining the series of reconstructed gathers with a subset of eigenimages, a band of eigenimages that corresponds to multiples can be determined.
Figure 6.1 14 6.1 14 6.1-146.1-146.114 c shows such a reconstructed gather using the eigenimages that correspond to the first 20 eigenvalues. Subtract the gather in Figure 6.1 14 c 6.1 14 c 6.1-14c6.1-14 \mathrm{c}6.114c from that in Figure 6.1-14b to obtain the gather that presumably contains the primary reflections (Figure 6.114d). Following the application of inverse moveout correction (Figure 6.1-14e) the data are ready for velocity analysis after multiple attenuation. Figure 6.1-16 shows a portion of the CMP stack associated with the data in Figure 6.1-14 with and without multiple attenuation using the K-L transform. While this example demonstrates that the method can be successful in attenuating multiples associated with near-horizontal reflections, it also can be a robust technique in handling multiples associated with moderately complex reflections. Figure 6.1-17 shows a portion of a CMP stack that contains a strong primary at 1.2 s 1.2 s 1.2s1.2 \mathrm{~s}1.2 s at the left-hand edge of the section. The K-L transform method has largely attenuated the water-bottom and peg-leg mutiples associated with the strong primary, and enhanced the primary events above it. Following the eigenimage decomposition, caution must be exercised in determining the number of eignevalues included in the reconstruction of CMP gathers (Figure 6.1-15),
(a)
(b)
(c) (d)
(e) (f)
FIG. 6.1-14. (a) A CMP gather with an abundance of water-botton and peg-leg multiples; (b) after moveout correction using the water velocity so as to flatten the water-bottom multiples; (c) the reconstructed gather using the eigenimages from the K-L transform that correspond to the first 20 eigenvalues; (d) the difference gather obtained by subtracting (c) from (b); (e) the gather in (d) after inverse moveout correction; (f) the original gather as in (a) after the same stretch mute as in (e). The gathers in (f) and (e) are before and after multiple attenuation using the K-L transform.
FIG. 6.1-15. Reconstruction of the CMP gather in Figure 6.1-14a using the eigemmages from the K-L transform that correspond, from (a) to (f), to the first 1 , 2 , 3 , 4 , 5 1 , 2 , 3 , 4 , 5 1,2,3,4,51,2,3,4,51,2,3,4,5, and 10 eigenvalues.
FIG. 6.1-16. A portion of the CMP stack associated with the data in Figure 6.1-14, without (left) and with (right) multiple attenuation using the K-L transform.
As mentioned earljer, a flat event within a data window in time and space has the highest degree of correlation from trace to trace, and thus, maps into the first eigenimage. Doicin and Spitz (1991) exploited this property in the frequency-space domain based on the earlier work by White (1984) to better separate primaries from peg-leg multiples into different eigenimages. Consider a portion of a common-offset section in Figure 6.1-18a associated with a marine data set. The water bottom is nearly flat at approximately 150 m s 150 m s 150ms150 \mathrm{~ms}150 ms. The commonoffset section exhibits a primary reflection ( K ) ( K ) (K)(K)(K) associated with an erosional unconformity in the neighborhood of 3 s 3 s 3s3 \mathrm{~s}3 s. The flat water bottom gives rise to a series of peg-leg multiples ( M 1 M 1 M_(1)M_{1}M1 and M 2 M 2 M_(2)M_{2}M2 ) of the primary reflection ( K ) ( K ) (K)(K)(K), arriving at an equal time interval.
If we perform horizon flattening on the primary reflection ( K ) ( K ) (K)(K)(K), then the multiple reflections ( M 1 M 1 (M_(1):}\left(M_{1}\right.(M1 and M 2 M 2 M_(2)M_{2}M2 ) would also be flattened. The eigenimage decomposition of the data window that excludes the flattened primary but includes the flattened multiples maps these into the first eigenimage. Reject the first few eigenimages and reconstruct the data window from the remaining eigenimages without the peg-leg multiples. The final step involves unflattening of the data. This process is applied to each of the common offset sections and the data are stacked. Note the absence of the peg-leg multiples on the stacked section shown in Figure 6.1-18b. This section lends itself to an improved image of the dipping events below the unconformity (Figure 6.1-18c).
Peg-leg multiples associated with a reflector below a dipping water bottom exhibit a complex traveltime

b
C
FIG. 6.1-18. (a) A portion of a common-offset section with a series of peg-leg multiples ( M 1 M 1 M_(1)M_{1}M1 and M 2 M 2 M_(2)M_{2}M2 ) associated with a primary reflection ( K ) ( K ) (K)(K)(K), (b) the stacked section that corresponds to the data as in (a) after the application of peg-leg multiple attenuation using a frequency-space eigenimage decomposition, and (c) time migration of the stacked section as in (b) (Doicin and Spitz, 1991.)
FIG. 6.1-19. Selected CMP gathers that exhibit split peg-leg multiples (Levin and Shah, 1977.)
hehavior (Levin and Shah, 1977). Figure 6.1-19 shows selected CMP gathers that include peg-leg multiples of a complex nature. A sketch of raypaths associated with peg-leg multiples is shown in Figure 6.1-20. For a horizontally layered earth model, the peg-leg raypath segment on the source end (the solid path) of the CMP raypath and the peg-leg raypath segment on the receiver end (the dotted path) of the CMP raypath give rise to coincident arrival times on the CMP gather (Figure 6.1 20 a ) 6.1 20 a ) 6.1-20a)6.1-20 \mathrm{a})6.120a). When there are dipping reflectors along the raypaths of the peg-leg multiples, the peg-leg raypath segment on the source end of the CMP raypath and the peg-leg raypath segment on the receiver end of the CMP raypath give rise to split peg-leg multiple arrivals (Figure 6.1-20b). Also note that, while the minimum arrival time of the primary reflection is at near-offset trace, the minimum arrival time of the peg-leg multiple reflections is at some nonzero-offset trace. The split peg-leg multiples can be extremely troublesome when interpreting data recorded over a continental slope.

Modeling of Multiples

Another approach to multiple attenuation based on velocity discrimination operates on CMP gathers directly in the t x t x t-xt-xtx domain. Again, consider the synthetic CMP gather in Figure 6.1-21a, which is the same as that in Figure 6.1-9c. Apply NMO correction, this time using
a
b
FIG, 6.1-20. Raypaths and traveltimes for peg-leg multiples associated with (a) horizontally layered earth model, and (b) an earth model with dipping reflectors.
the multiple velocity function labeled as V M V M VMV MVM in Figure 6.1-9d. The result is shown in Figure 6.1-21b, while the stack trace is shown in Figure 6.1-21c. This stack trace is called the model trace for multiples since it almost entirely contains the multiple energy. Stubtract the model trace from the individual traces of the NMOcorrected gather (Figure 6.1-21b). The resulting traces essentially should contain only primary energy. Note that this model-based approach applies to one multiple velocity function at a time.
The main problem with this technique is constructing a model trace that contains only multiples. Because of slight waveform changes and the variation of the moveout differential between primaries and multiples with offset, the model trace for multiples will not represent multiples equaily well for each offset. Better representations of multiple energy can be obtained by constructing individual model traces for each offset by stacking only a few traces on both sides of the trace associated with that offset.
(a)
(b)
(c)
FIG. 6.1-21. (a) The modeled CMP gather in Figure 6.19c, (b) after NMO correction using the multiple velocity function (VM in Figure 6.1-9d). (c) The stack trace is repeated to emphasize the strong events.
Even if individual model traces were used, it is still difficult to generate model traces that do not contain some primary energy. Good attenuation of primary energy in the model trace ultimately depends on the moveout differential between primaries and multiples being a substantial fraction of the period of the seismic wavelet. At lower temporal frequencies, this usually is not the case and, hence, the model trace often includes some of the low-frequency components of the primaries. Consequently, subtraction of the model trace from the moveout-corrected traces often leads to attenuation of the multiples and the low-frequency components of the primaries. Exclusion of the low-frequency end of the spectrum in building the model traces is a way to deal with this latter problem.
To study the results of this subtraction technique on field data, consider the selected CMP gathers in Figure 6.1-8a. From the velocity spectrum in Figure 6.1 8 b 6.1 8 b 6.1-8b6.1-8 \mathrm{~b}6.18 b, note that the multiples can have more than one velocity trend (the velocity trends Iabeled as V M 1 V M 1 VM1V M 1VM1 and V M 2 V M 2 VM2V M 2VM2 ). The NMO-corrected CMP gathers in Figure 6.1-22a are obtained by using one of the velocity trends (VM1). The primaries are overcorrected, while the multiples associated with the velocity trend V M 1 V M 1 VM1V M 1VM1 are flattened.
The velocity spectrum after multiple attenuation using the model-based subtraction technique (Figure 6.1-22b) shows an enhanced primary velocity trend. Also note the removal of the multiple trend (VM1) from the velocity spectrum. The selected CMP gathers following moveout correction using the primary velocities from Figure 6.1-22b are shown in Figure 6.1-22c. The stacked section after applying the multiple attenuation procedure is shown in Figure 6.1-22d.
The model-based approach can be cascaded to attenuate more than one class of multiples present in the data. Use of the multiple velocity trend labeled as V M 2 V M 2 VM2V M 2VM2 in Figure 6.1-8b, yields the results shown in Figure 6.123. Input CMP gathers to the second pass (Figure 6.123a) are the output CMP gathers from the first pass (Figure 6.1-22c). Note the attenuation of the multiple trend V M 2 V M 2 VM2V M 2VM2 from the velocity spectrum (Figure 6.123b). The deeper peg-leg multiple below 4 s 4 s 4s4 \mathrm{~s}4 s has been attenuated further (compare Figures 6.1-22d and 6.123d).
The stacked sections resulting from the first pass (Figure 6.1-22d) and the second pass (Figure 6.1-23d) have a high-frequency character compared to the conventional CMP stack (Figure 6.1-8d). As indicated earlier, this effect can be suppressed by excluding the low frequencies from the model traces. Multiple attenuation using the filtered versions of the model traces yields the stacked sections in Figure 6.1-24.

6.2 FREQUENCY-WAVENUMBER FILTERING

Coherent linear events in the t x t x t-xt-xtx domain can be separated in the f k f k f-kf-kfk domain by their dips. This allows us to eliminate certain types of unwanted energy from the data. In particular, coherent linear noise in the form of ground roll, guided waves, and side-scattered energy commonly obscure primary reflections in recorded data. These types of noise usually are isolated from the reflection energy in the f k f k f-kf-kfk domain. From the field record in Figure 6.2-1a, note how ground-roll energy can dominate the data. Ground roll is a type of dispersive waveform that propagates along the surface and is low-frequency, large-amplitude in character. Typically, ground roll is suppressed in the field by using a suitable receiver array.
Figure 6.2 1 b 6.2 1 b 6.2-1b6.2-1 \mathrm{~b}6.21 b is the 2-D amplitude spectrum of the field record in Figure 6.2-12. Here, various types of energy are well isolated from one another. Ground roll A A AAA, its backscattered component B B BBB, and guided waves C C CCC, are identifiable. Reflections D D DDD are situated around the frequency axis. As shown in Figure 6.2-1c, a fan is imposed on this spectrum within which the undesired energy is rejected. This is followed by inverse mapping back to the t x t x t-xt-xtx domain. The resulting filtered record in Figure 6.2-1d is largely free of ground-roll energy, except for the backscattered component. Defining a reject fan in the f k f k f-kf-kfk domain is one implementation of the process known as f k f k f-kf-kfk dip filtering.
Note that dip fitering is but one type of f k f k f-kf-kfk filtering. The reject zone in the f k f k f-kf-kfk domain may be specified not just as a fan but also as a shape suitable for the objective in mind. For instance, the reject zone may be defined as one entire quadrant of the f k f k f-kf-kfk plane in the case of multiple attenuation. It may only be one half of one quadrant in the case of a spatial antialiasing filter (Section 1.2). The following are the steps involved in f k f k f-kf-kfk filtering:
(a) Starting with a common-shot or a CMP gather, or a CMP-stacked section, apply 2-D Fourier transform.
(b) Define a 2-D reject zone in the f k f k f-kf-kfk domain by setting the 2-D amplitude spectrum of the f k f k f-kf-kfk filter to zero within that zone and set its phase spectrum to zero.
(c) Apply the 2-D f k f k f-kf-kfk filter by multiplying its amplitude spectrum with that of the input dat a set.
(d) Apply 2-D inverse Fourier transform of the filtered data.
(d)
FIG. 6.1-22. (a) The CMP gathers in Figure 6 1-8a after NMO correction using siow multiple velocities (VM1 in Figure 6 18b). (b) The velocity spectrum at CMP 186 after single-pass model-based subtraction for multiple attenuation. For reference, the CMP gather after multiple attenuation is shown to the left of the velocity spectrum. (Compare this with Figure 6.1-8b.) (c) The same CMP gathers as in (a) after the single-pass model-based subtraction for multiple attenuation, followed by NMO correction using primary velocitics derived from velocity spectrum (b), (d) The CMP stack derived from the CMP gathers as in (c) after multiple suppression.
(d)
FIG. 6.1-23. (a) The CMP gathers from the first-pess model-based subtraction for multiple attenuation (Figure 6.1-22) after NMO correction using fast multuple velocitis (VM2 in Figure 6.1-8b) (b) The velocity spectrum at CMP 186 after the second-pass model-based subtraction for multiple attenuation. For reference, the CMP gather after multiple attemiation is shown to the left of the velocity spectrum. (c) The same CMP gathers as in (a) after the second-pass model-based subtraction for multiple attenuation, followed by NMO correction using primary velocities from (b). (d) The CMP stack derived from the CMP gathers as in (c) after the second-pass model-based subtraction for multiple attenuation.
(a)
(b)
FIG. 6.1-24. The CMP stacks after the model-based subtraction for multiple attenuation, which was implemented using filtered model traces. (a) First pass using multiple velocities V M 1 V M 1 VM1V M 1VM1 and (b) second pass using multiple velocities V M 2 V M 2 VM2V M 2VM2, as depicted in Figure 6.1-8b.
号 粦粦号
员寻占
卷药
FIG. 6.2-2. (a) A synthetic CMP gather with band-limited random noise uncorrelated from trace to trace; the same gather after f k f k f-kf-kfk filtering with different pass-fans with dip bands: (b) ( + 2 , 2 ) m s / t r a c e ( + 2 , 2 ) m s / t r a c e (+2,-2)ms//trace(+2,-2) \mathrm{ms} / \mathrm{trace}(+2,2)ms/trace, and (c) ( + 4 , 4 ) m s / ( + 4 , 4 ) m s / (+4,-4)ms//(+4,-4) \mathrm{ms} /(+4,4)ms/ trace. The f k f k f-kf-kfk spectra are shown at the bottom of each panel. Note that random noise in t x t x t-xt-xtx domain maps onto a rectangular zone in the f k f k f-kf-kfk domain, with its top and base corresponding to the low- and high-frequency end of the passband.
FIG. 6.2-3. A synthetic CMP gather as in Figure 6.2-2 with band-limited random noise uncorrelated from trace to trace after f k f k f-kf-kfk filtering with different pass-fans with dip bands (a) ( + 6 , 6 ( + 6 , 6 (+6,-6(+6,-6(+6,6 ) ms/trace, (b) ( + 8 , 8 ) m s / t r a c e ( + 8 , 8 ) m s / t r a c e (+8,-8)ms//trace(+8,-8) \mathrm{ms} / \mathrm{trace}(+8,8)ms/trace, and (c) (+10,-10) m s / t r a c e m s / t r a c e ms//trace\mathrm{ms} / \mathrm{trace}ms/trace. The f k f k f-kf-kfk spectra are shown at the bottom of each panel.
Practical issues associated with the 2-D Fourier transform and specifying a fan reject zone are outlined below:
(a) Conventional implementations of the Fourier transform itself produce wraparound noise. This is apparent in Figure 6.2-1d, location F F FFF. To avoid this problem, the data must be extended beyond the ranges of the spatial and temporal axes by padding with zeroes. The size of the input gather typically is increased by a factor of 4 , which is equivalent to doubling the length in t t ttt and x x xxx. This increases the cost but removes the wraparound effects.
(b) The fan width must not be too narrow. This follows from previous observations of the 1-D Fourier analysis of frequency filters (Section 1.1). If the bandwidth of the reject zone were narrow, then the t x t x t-xt-xtx response of the dip filter would have a large array of nonzero elements. Fortunately, coherent noise with large stepouts, such as ground roll, often is isolated in the f k f k f-kf-kfk domain from the zone that includes the reflection signal. This is demonstrated by the example in Figure 6.2-1b. In such cases, ground-roll energy A A AAA is attenuated without damaging the reflection signal by using a large fan (Figure 6.2-1c).
(c) As for the 1-D frequency filters (Section 1.1), the amplitude spectrum of the f k f k f-kf-kfk filter must not have sharp boundaries. There must be a smooth transition from the reject zone to the pass zone. This is accomplished by tapering the fan edges, which is analogous to using slopes in frequency filtering The amount of tapering must be large enough to be effective. On the other hand, it must not be so wide that it suppresses signal in the pass zone. Extra precaution is taken at low frequencies. As the fan thins to a zero width at the origin of the f k f k f-kf-kfk domain, as in a wedge, the actual reject zone may invade the low-frequency components of the pass zone. This invasion occurs because the fan cannot get too narrow. It may be desirable to stop the reject zone just short of the low frequencies. This effectively excludes the low frequencies from the f k f k f-kf-kfk dip filtering action.
(d) Spatial aliasing often causes poor f k f k f-kf-kfk filter performance. The fan reject zone must be extended to the spatially aliased frequency components. A practical approach to this problem is to apply linear moveout correction to the data before f k f k f-kf-kfk filtering so that the unwanted signal appears at lower dips, thus eliminating the spatial aliasing effects. The linear moveout then is removed after f k f k f-kf-kfk filtering. Unfortunately, this may not always work, since events that are not spatially aliased before may be spatially aliased after linear moveout.
FIG. 6.2-4. (a) Stack of synthetic CMP gathers as in Figure 6.2-2a without f k f k f-kf-kfk filtering, and (b) stack of synthetic CMP gathers as in Figure 6.2 2 b 6.2 2 b 6.2-2b6.2-2 \mathrm{~b}6.22 b with f k f k f-kf-kfk filtering using a dip band of ( + 2 , 2 ) m s / t r a c e ( + 2 , 2 ) m s / t r a c e (+2,-2)ms//trace(+2,-2) \mathrm{ms} / \mathrm{trace}(+2,2)ms/trace.

Random Noise and Frequency-Wavenumber Filtering

Treatment of random noise uncorrelated from trace to trace by f k f k f-kf-kfk filtering is an important aspect of the process. Figure 6.2-2 shows a synthetic CMP gather which contains only band-limited random noise. Note that the f k f k f-kf-kfk spectrum exhibits the random character of the data there is energy at all wavenumbers up to the Nyquist and at all frequencies within the passband.
After the application of a narrow-fan f k f k f-kf-kfk dip filter, note that the CMP gather contains coherent events with dips that correspond to the pass-fan in the f k f k f-kf-kfk domain. By widening the pass-fan of the f k f k f-kf-kfk dip filter, dip range of the coherent events in the gather is broadened as demonstrated in Figure 6.2-3. As the pass-fan is widened, the coherence of events in the gather becomes increasingly less apparent, while the randomness character becomes more predominant and eventually similar to that of the input gather.
Figure 6.2-4a shows a stack of several CMP gathers as in Figure 6.2-2a with band-limited random noise. Note that stacking of CMP gathers which contain just random noise yields a stack which contains, again, random noise. The f k f k f-kf-kfk spectrum exhibits the random character of the stacked data - there is energy at all wavenumbers up to the Nyquist and at all frequencies within the passband. Figure 6.2 4 b 6.2 4 b 6.2-4b6.2-4 \mathrm{~b}6.24 b shows a stack of f k f k f-kf-kfk filtered CMP gathers as in Figure 6.2-2b. Note that stacking of f k f k f-kf-kfk filtered CMP gathers with random noise yields, once again, a section which largely contains just random noise, despite the nonrandom character of the input gathers (Figure 6.2-2b).
The stacked section in Figure 6.2-4a was displayed at a very high gain to differentiate the noise levels at shallow and late times. The reason why the noise level is stronger at the shallow portion is because the muting after NMO correction has caused lower fold in stacking, and hence less attenuation of the random noise during stacking. The stack of the CMP gathers with f k f k f-kf-kfk dip filtering (Figure 6.2-4b) does not exhibit the organized character seen in the CMP gathers themselves (Figure 6.2 2 b 6.2 2 b 6.2-2b6.2-2 b6.22b ), because the stacked amplitudes are uncorrelated from one gather to another. The relatively higher amplitudes at late times in Figure 6.2 4 b 6.2 4 b 6.2-4b6.2-4 \mathrm{~b}6.24 b result from less attenuation of the organized noise on CMP gathers at late times during stacking - less attenuation, because the stepout of the organized noise at late times happens to be very similar to the moveout implied by the velocity function used in NMO correction.

Statics Corrections and
Frequency-Wavenumber Filtering

It should be noted that coherent linear noise on shot gathers can be influenced kinematically by surface topography and a near-surface refractor geometry. Specifically, linearity of the coherent noise may be distorted across a shot record. Distortions along a linear event in the t x t x t-xt-xtx domain cause smearing of energy over a broad range of wavenumbers in the f k f k f-kf-kfk domain. This, in turn, would make it difficult to specify a pass-fan for reflection energy. It can be concluded that statics corrections, at least in the form of field statics, should be applied to shot records prior to f k f k f-kf-kfk filtering.

Dip Filtering of Coherent Linear Noise

Figure 6.2-5 shows four cornmon-shot gathers, while Figure 6.2-6 shows their f k f k f-kf-kfk spectra before and after f k f k f-kf-kfk dip filtering. The pass or reject zones in the f k f k f-kf-kfk spectra do not need to be constrained to fan shape. The left half of the spectra mostly contain spatially aliased data. By keeping the fan shape in the right quadrant, while zeroing out most of the left quadrant, the coherent noise trains, including the aliased energy, are eliminated.
Because aliasing is a serious concern in f k f k f-kf-kfk filtering, it is advisable to apply it to shot gathers rather than to CMP gathers, since CMP gathers can have twice the trace spacing of shot gathers. Nevertheless, two neighboring CMP gathers can be interleaved before applying f k f k f-kf-kfk dip filtering, then split afterward, thus alleviating aliasing. Such implementation is permissible provided the composite gather does not exhibit any traveltime shifts caused by changes in reflector geometries or lateral variations in velocities. Coherent noise as seen on the shot gathers in Figure 6.2 5 6.2 5 6.2-56.2-56.25 is best attenuated in the shot-gather domain. When sorted into CMP gathers, no significant remnant of this noise is left in the data (Figure 6.2-7). Figure 6.2-8a shows the stacked section derived from the CMP gathers in Figure 6.2-7a with no f k f k f-kf-kfk filtering. Note the linear noise left in the stacked section. The CMP gathers with f k f k f-kf-kfk filtering (Figure 6.2 7 b ) 6.2 7 b ) 6.2-7b)6.2-7 \mathrm{~b})6.27 b) yield a stack that is virtually free of linear noise (Figure 6.2-8b).
Coherent linear noise on stacked data also can be suppressed by poststack migration that incorporates dip filtering. If coherent linear noise is associated with side scatterers, then much of it can be attenuated by a constant-velocity DMO correction (Section 5.2). If f k f k f-kf-kfk filtering were not applied to common-shot gathers containing side-scat tered energy, then a stacked section with coherent linear noise could result (Figure 6.2-9a). Figure 6.2 9 b 6.2 9 b 6.2-9b6.2-9 \mathrm{~b}6.29 b shows that this noise can be attenuated by f k f k f-kf-kfk dip filtering the stacked section. Could this noise at tenuation be done better? If an f k f k f-kf-kfk filter were applied to shot records, then the stack in Figure 6.2-9c results. When compared to the result in Figure 6.2 9 b 6.2 9 b 6.2-9b6.2-9 \mathrm{~b}6.29 b, the result in Figure 6.2-9c seerns to offer better resolution. The prestack f k f k f-kf-kfk filtered data also yield an improved velocity analysis (Figure 6.2-10).
Practical experience with f k f k f-kf-kfk filtering proves that an even better stack may result when both commonshot and common-receiver gathers are f k f k f-kf-kfk filtered.
(a)
(b)
FIG. 6.2-5. Four shallow marine records (a) before and (b) after f k f k f-kf-kfk dip filtering to remove coherent linear noise. TI coherent noise seen in these records is primarily of the guided wave type. (Data courtesy Deminex Petroleum.)
(I
(a)
(b)
FIG. 6.2-7. The CMP gathers from a shallow marine survey (a) before and (b) after f k f k f-kf-kfk dip filtering implemented in the shot-gather domain to remove coherent linear noise. (These are the same data as in Figure 6.2-5.) (Data courtesy Derninex Petroleum.)
(a)
(b)
FIG. B.2-8. (a) CMP stack with some coherent linear noise; and (b) f k f k f-kf-kfk dp filtering before stack. Selected CMP gathers are shown in Figure 6.2-7. (Data courtesy Deminex Petroleum.)
(a)
(c)
(b)
(d)
FIG. 6.2-9. (a) CMP stack contaminated by coherent noise. Associated common-6hot and CMP gathers are shown in Figure 6.0-1. (b) The same CMP stack f k f k f-kf-kfk filtered after stack. (c) CMP stack f k f k f-kf-kfk filtered before stack. (d) CMP stack f k f k f-kf-kfk filtered twice before stack first, in common-shot domain, second, in common-receiver domain. (Data courtesy Taylor Woodrow Energy Ltd.)
(a)
(b)
PIG. 6.2-10. Velocity spectrum associated with the data in Figure 60 1 b 60 1 b 60-1b60-1 \mathrm{~b}601 b (a) without and (b) with f k f k f-kf-kfk dip filtering.
primary and multiple velocities. The resulting NMOcorrected gather and its 2-D amplitude spectrum are shown in Figure 6.2-11b. The multiples are undercorrected, while the primaries are overcorrected. In the f k f k f-kf-kfk domain, the multiples and primaries for the most part map onto two different quadrants (labeled as P P PPP for primaries and M M MMM for multiples). The exception to this separation is the near-offset energy (both primary and multiple), which almost entirely maps along the frequency axis. This occurs because multiples and primaries have no significant moveout difference at near offsets. Aliased energy (such as A A AAA ) is wrapped around and mapped to the wrong quadrant. (Spatial aliasing is discussed in detail in Section 1.2.)
Multiples can be attenuated by zeroing the quadrant corresponding to multiple energy in the f k f k f-kf-kfk domain (Figure 6.2-11c) (Ryu, 1980; Sengbush, 1983). However, note that spatially aliased multiple energy remains in the gather (labeled as A A AAA in Figure 6.12 11 c 6.12 11 c 6.12-11c6.12-11 \mathrm{c}6.1211c ). A shown in Figure 6.2-11d, besides zeroing out the multiple quadrant, a reject zone labeled as R R RRR can be imposed on the primary quadrant. The f k f k f-kf-kfk filtered CMP gather (Figure 6.2-11d) now also is free of the aliased energy (compare with Figure 6.2-11c). Inverse NMO correction (Figure 6.2-1le) using the same intermediate velocity function V B V B VBV BVB (Figure 6.1-9d) restores the original moveout of the primaries. Following this procedure, apply NMO correction using the primary velocity function V P V P VPV PVP (Figure 6.1-9d) as shown in Figure 6.2-11f.
The stacked trace of this gather displayed repeatedly exhibits very little multiple energy (Figure 6.2 11 g 6.2 11 g 6.2-11g6.2-11 \mathrm{~g}6.211 g ).
The sequence for f k f k f-kf-kfk filtering of multiple attenuation is as follows:
(a) Apply moveout correction to CMP gathers using a velocity function v b v b v_(b)v_{b}vb such that v m < v b < v p v m < v b < v p v_(m) < v_(b) < v_(p)v_{m}<v_{b}<v_{p}vm<vb<vp, where v m v m v_(m)v_{m}vm and v p v p v_(p)v_{p}vp are velocity functions associated with multiples and primaries, respectively.
(b) Apply 2-F Fourier transform.
(c) Zero the quadrant associated with the multiples and, if required, the zone that contains the energy associated with the aliased multiples within the primaries quadrant.
(d) Apply inverse 2-D Fourier transform.
(e) Apply inverse moveout correction using the velocity function v b v b v_(b)v_{b}vb as in step (a).
(f) Perform velocity analysis to update the picks for primary velocity functions.
Now consider the field data example shown in Figure 6.2-12. The moveout difference between the primaries and multiples is apparent in the CMP gathers (Figure 6.1-8a). To the left of the primary velocity function labeled as V P V P VPV PVP in Figure 6.1-8b, all peaks are associated with water-bottom and peg-leg multiples. Apply moveout correction using a velocity function V B V B VBV BVB that lies between the primary and multiple velocities. As a result, the multiples are undercorrected and the primaries are overcorrected as shown in Figure 6.2-12a. Now consider the moveout of primaries and multiples in the f k f k f-kf-kfk domain. The primary and multiple indicated in Figure 6.1-8a map to the same quadrant (say positive quadrant) in the f k f k f-kf-kfk domain before moveout correction. The same events after moveout correction using an intermediate velocity map into two different quadrants; in particular, the multiple maps into the positive quadrant and the primary maps into the negative quadrant. Thus, by zeroing one quadrant in which the multiples are clustered, the primaries can be enhanced.
A CMP gather and the associated velocity spectrum following f k f k f-kf-kfk multiple attenuation are shown in Figure 6.2-12b. When compared with Figure 6.1-8b, Figure 6.2-12b shows that the energy in the multiples region in the velocity spectrum was attenuated, while the primary velocity trend was enchanced. Finally, Figure 6.2-12c shows selected CMP gathers after moveout correction using the primary velocities picked from the velocity spectrum in Figure 6.2-12b. Stacking of these gathers yields the section in Figure 6.2-12d. This section should be compared with Figures 6.1-8d.
(a)
(c)
FIG. 6.2-12. (a) The CMP gathers in Figure 6.1-8a after NMO correction using a velocity function (labeled as VB in Figure 6.1 8 b 6.1 8 b 6.1-8b6.1-8 b6.18b ) between the primary and multiple velocities; (b) velocity spectrum at CMP 186 estrmated from the f k f k f-kf-kfk dip-filtered gather shown to the left of the spectrum. Compare this with Figure 6.1-8b. (c) The same CMP gathers as in (a) after f k f k f-kf-kfk multiple attenuation followed by NMO correction asing the primary velocties derived from velocity spectrum (b). (d) The CMP stack derived from the CMP gathers as in (c) after f k f k f-kf-kfk multiple attenuation.

FIG. 6.2-15. An NMO-corrected CMP gather (left column) and the corresponding velocity spectrum (right column) associated with: (top row) the stacked data shown in Figure 6.2-13, and (bottom row) the stacked data shown in Figure 6.2-14.
In practice, there are variations in selecting the velocity function used to apply moveout correction prior to f k f k f-kf-kfk filtering. An alternative strategy is to apply NMO correction using the multiple velocity, then zero the energy along the frequency axis in addition to that in the multiple quadrant of the f k f k f-kf-kfk spectrum. Another strategy is to apply NMO correction using primary velocities and place a tight pass-zone around the frequency axis. Finally, note that the f k f k f-kf-kfk method of velocity discrimination is one type of f k f k f-kf-kfk filtering. Thus, we must deal with the same practical issues discussed in Section 1.2 - in particular, wraparound, spatial aliasing, and tapering over the boundary between the pass and reject zones.
Multiples are best attenuated when a combination of two methods based on periodicity of multiples and velocity discrimination between primaries and multiples are used. Figure 6.2-13 shows a CMP-stacked section with no attempt made to attenuate the multiples. Specifically, the processing sequence did not include deconvolution nor f k f k f-kf-kfk filtering. Note the abundance of peg-leg multiples associated with the strong reflections; these multiples dominate the section below 2 s 2 s 2s2 \mathrm{~s}2 s.
By combining prestack deconvolution with f k f k f-kf-kfk filtering followed by poststack deconvolution, as demonstrated in Figure 6.2-14, multiples in Figure 6.2-13 are Iargely attenuated despite the complicated nature of the reflectors that originate the peg-legs. The class of multiples present in the stacked section of Figure 6.2-13 is clearly identified in the corresponding velocity spectrum shown in Figure 6.2-15. Note that much of the energy associated with the multiples is absent in the velocity spectrum shown in Figure 6.2 15 6.2 15 6.2-156.2-156.215 corresponding to the stacked section in Figure 6.2-14. Compare the velocity spectra in Figure 6.2-15 computed from the CMP gather without and with multiple attenuation and note that, following multiple attenuation, the energy of the primeries has been enhanced relative to that of the multiples.
Prestack deconvolution alone has limited effect in attenuating multiples (Figure 6.2-16). When combined with poststack deconvolution, however, it often is successful in attenuating a large class of multiples (Figure 6.2-17). The key to effective multiple attenuation by predictive deconvolution is to be generous with the operator length. As for the example shown in Figure 6.2-17, an operator length as long as 480 m s 480 m s 480ms480 \mathrm{~ms}480 ms may need to be considered.
A combination of prestack deconvolution and f f f-f-f k k kkk filtering for muitiple attenuation yields the section shown in Figure 6.2-18. Compare with Figure 6.2-17 and note the more effective multiple attenuation by combining deconvolution with f k f k f-kf-kfk filtering. The addition of poststack deconvolution to the sequence that includes prestack deconvolution and f k f k f-kf-kfk filtering yields the most favorable result within the context of multiple attenuation (Figure 6.2-14).

6.3 THE SLANT-STACK TRANSFORM

In Section 1.2, we learned that the 2-D Fourier transform is one way to decompose 8 wavefield into its planewave components, each with a unique frequency and each traveling at a unique angle from the vertical direction. In this section, we shall discuss the domain of ray parameter and present another way to decompose the wavefield into its plane-wave components.
Plene-wave decomposition of a wavefield, such as a common-shot gather, can be achieved by applying linear moveout and summing amplitudes over the offset axis. This procedure is called slant stacking. An underlying assumption of slant stacking is that of a horizontally layered earth model. Conventional processing is done primarily in midpoint-offset coordinates. Slant stacking replaces the offset axis with the ray parameter p p ppp axis. The ray parameter is the inverse of the horizontal phase velocity. A group of traces with a range of p p ppp values is called a slant-stack gather.
Several processing techniques have been devised, with varying degres of success, in midpoint-rayparameter coordinates. Examples include trace interpolation, multiple attenuation, time-variant dip filtering, refraction inversion, velocity anslysis, migration before stack, and deconvolution. Taner (1977) was the first to introduce the midpoint-ray-parameter coordinates. He discussed the interpretive use of plane-wave stacks, where several constant p p ppp sections are superpositioned over a restricted range of p p ppp values to enhance dipping events. Other processing methods were investigated later, such as migration (Ottolini, 1982) and velocity analysis (Schultz and Claerbout, 1978; Dicbold and Stoffa, 1981; and Gonzalez-Serrano, 1982). Alam and Lasocki (1981) and Alam and Austin (1981) discussed possible applications in trace interpolation and multiple attenuation, respectively. McMechan and Yedlin (1981) devised a method to obtain phase velocity curves for dispersive waves using slant-stack transformation (Section F.1). Clayton and McMechan (1981) devised a method to invert a refracted wavefield, which involves downward continuation in the slant-stack domain (Section F.2). Based on downward continuation of a slant-stack gather, Schultz (1982) developed a technique to estimate interval velocities.

Physical Aspects of Slant Stacking

We now examine the physical aspects of constructing a slant-stack gather. Each trace in this gather represents
FIG. 6.3-1. A seismic source generates waves that propagate in all directions; waves traveling in different durections are recorded at different receiver locations.
a plane wave that propagates at a certain angle from vertical. In reality, when a dynamite source explodes, the energy propagates at all angles (Figure 6.3-1). The reflected energy arrives at different receiver groups at different angles because of the offset between source and receiver locations. The farther the offset or the shallower the reflecting interface, the more oblique the angle of the upcoming wavefront
As an aid in defining a scheme for constructing slant-stack gathers, first consider how plane waves car be generated. Imagine a line of point sources as shown in Figure 6.3-2. Assume that this line of sources is activated so that all points on the line are excited simultaneously, and each point generates a spherical wavefield. Some distance from the surface, the spherical wavefronts superimpose and result in a plane wave that travels vertically downward. This plane wave reflects from an interface and is recorded by a receiver at the surface (Actually, there are source types, such as Geoflex and Primacord, which approximate short line sources.)
Instead of a vertically traveling plane wave, a plane wave that travels at a desired angle from vertical can be generated using the same line of point sources as illustrated in Figure 6.3-3. To do this, the point sources must be activated in succession starting at one end of
FIG. 6.3-2. A vertically incident plane wave is gcnerated by setting of mary shots in unison.
FIG. 6.3-3. A plane wave that travels at angle θ θ theta\thetaθ from vertical is generated by setting off many shots (starting from lefit) at appropriate time intervals.
the line with an equal time delay between them. When a particular point source is activated, the wavefront generated from the previous source location already will have traveled a certain distance into the earth. When all the spherical wavefronts generated by the various sources superimpose, the result is a tilted plane wavefront. This plane wave then propagates, refects from an interface, and is recorded by a receiver at the surface.
The amount of tilt of the wavefront, defined by the angle of propagation of the plane wave, can be controlled. Consider the raypath-wavefront geometry in Figure 6.3-4. By the time the wavefront generated at source location S 1 S 1 S_(1)S_{1}S1 reaches point A A AAA in the subsurface, the point source at location S 2 S 2 S_(2)S_{2}S2 should be excited so that the desired angle is attained. Define the distance between S 1 S 1 S_(1)S_{1}S1 and S 2 S 2 S_(2)S_{2}S2 as Δ x Δ x Delta x\Delta xΔx, and the medium velocity with which the waves travel as v v vvv. If it takes Δ t Δ t Delta t\Delta tΔt time for the wavefront to go from S 1 S 1 S_(1)S_{1}S1 to A A AAA, using the triangle S 1 A S 2 S 1 A S 2 S_(1)AS_(2)S_{1} A S_{2}S1AS2, then the dip angle θ θ theta\thetaθ of the plane wave is given by
sin θ = v Δ t Δ x sin θ = v Δ t Δ x sin theta=(v Delta t)/(Delta x)\sin \theta=\frac{v \Delta t}{\Delta x}sinθ=vΔtΔx
FIG. 6.3-4. Computation of time interval between shots (S) to generate the oblique plane wave in Figure 6.3-3.
FIG. 6.3-5. The reciprocity principle applied to the geometry of Figure 6.3-4 to replace shots ( S ) ( S ) (S)(S)(S) with receivers ( R ) ( R ) (R)(R)(R).
The active source location must therefore travel with speed given by
Δ x Δ t = v sin θ Δ x Δ t = v sin θ (Delta x)/(Delta t)=(v)/(sin theta)\frac{\Delta x}{\Delta t}=\frac{v}{\sin \theta}ΔxΔt=vsinθ
along the horizontal direction, and the point source at location S 2 S 2 S_(2)S_{2}S2 must be excited so that we can catch the wavefront at S 1 S 1 S_(1)S_{1}S1 as it reaches point A A AAA on the wavefront in the subsurface. The velocity ( v / sin θ ) ( v / sin θ ) (v//sin theta)(v / \sin \theta)(v/sinθ) with which the source location must move is called the horzontal phase velocity.
From the experiments illustrated by Figures 6.3-2 and 6.3 3 6.3 3 6.3-36.3-36.33, note that a plane wave propagating at an angle from the vertical can be generated by:
(1) Placing a line of point sources at the earth's surface.
(2) Exciting the point sources in succession with a time delay.
(3) Superimposing the responses that are in the form of spherical wavefronts.
The superimposed response is recorded on a single receiver (Figure 6.3-3). This response is in the form of a plane wave that is reflected from an interface. Superposition means summing over the shot axis for a given receiver location. Using the reciprocity principle, summation also can be performed over the receiver axis for a given shot location.
We just discussed how a common-shot gather as a single wavefield can be decomposed into its plane-wave components. By replacing the shot axis in Figure 6.3-4 with the receiver axis, the raypath geometry in Figure 6.3 5 6.3 5 6.3-56.3-56.35 results. The time delay associated with the plane wave that travels at angle θ θ theta\thetaθ from the vertical is given by
Δ t = sin θ v Δ x Δ t = sin θ v Δ x Delta t=(sin theta)/(v)Delta x\Delta t=\frac{\sin \theta}{v} \Delta xΔt=sinθvΔx
Snell's law says that the quantity sin θ / ν sin θ / ν sin theta//nu\sin \theta / \nusinθ/ν, which is the inverse of the horizontal phase velocity, is constant
FIG. 6.3-6. If the ray parameter p p ppp is specified, then the ray can be traced in a horizontally layered earth model with a known velocity function v ( z ) v ( z ) v(z)v(z)v(z).
along a raypath in a layered medium (Figure 6.3-6). This constant is called the ray parameter p p ppp. Equation (6-3a) then is rewritten as
Δ t = p Δ x . Δ t = p Δ x . Delta t=p Delta x.\Delta t=p \Delta x .Δt=pΔx.
The angle of propagation of the plane wave is controlled by adjusting the p p ppp value. If the ray parameter p p ppp is specified, then the ray can be traced in a horizontally layered earth model with a known velocity function v ( z ) v ( z ) v(z)v(z)v(z). Setting p = 0 p = 0 p=0p=0p=0 corresponds to a plane wave that travels vertically.
Given the ray parameter p p ppp and the velocity function v ( z ) v ( z ) v(z)v(z)v(z) for the layered earth, the fanily of raypaths associated with a particular p p ppp value can be traced as shown in Figure 6.3-7. A plane wave that travels in a layered earth is called a Snell wave (Claerbout, 1978). This type of plane wave changes its direction of propagation at each layer boundary according to Snell's law (Figure 6.3-6). For a single p p ppp value, note that the signal is recorded at many offsets (Figure 6.3-7).
In general, receivers at all offsets record plane waves of many p p ppp values. To decompose a shot gather into its plane-wave components, all the trace amplitudes in the gather must be summed along several slanted paths, each with a unique time delay defined by equation (6-3b).
FIG, 6.3-7. Some raypaths for a given p p ppp value, corresponding to a single trace in the τ p τ p tau-p\tau-pτp domain.
As long as there is no dip, the traveltimes in a common-shot and a common-midpoint gather are indistinguishable. Since a CMP gather is not a single wavefield, plane-wave decomposition would not seem to apply to CMP gathers. However, the equivalence of CMP gathers and common shot gathers in a horizontally layered earth provides a rationale for applying plane-wave decomposition to both types of gathers.

Slant-Stack Transformation

Two steps typically are used in synthesizing plane waves by summing amplitudes in the ofiset domain along slanted paths (Figure 6.3-8). First, a linear moveout (LMO) correction is applied to the data through a coordinate transformation defined by (Claerbout, 1978)
τ = t p x τ = t p x tau=t-px\tau=t-p xτ=tpx
where p p ppp is the ray parameter, x x xxx is the offset, t t ttt is the two-way traveltime, and τ τ tau\tauτ is the intercept time at p = 0 p = 0 p=0p=0p=0. Next, the data are summed over the offset axis by
S ( p , τ ) = x P ( x , τ + p x ) S ( p , τ ) = x P ( x , τ + p x ) S(p,tau)=sum_(x)P(x,tau+px)S(p, \tau)=\sum_{x} P(x, \tau+p x)S(p,τ)=xP(x,τ+px)
where, S ( p , r ) S ( p , r ) S(p,r)S(p, r)S(p,r) represents a plane wave with ray parameter p = sin θ / v p = sin θ / v p=sin theta//vp=\sin \theta / vp=sinθ/v. By repeating the LMO correction for a range of p p ppp values and performing the summation in equation (6-4b), a complete slant-stack gather is constructed. A slant-stack gather, in practice, alternatively is referred to as a τ p τ p tau-p\tau-pτp gather; it consists of all the dip components within the specified range of p p ppp values in the original offset data.
The mapping from the t x t x t-xt-xtx domain to the τ p τ p tau-p\tau-pτp domain is reversible (Thorson, 1978). First, apply inverse linear moveout (LMO) correction to the data in the τ p τ p tau-p\tau-pτp domain by
t = τ + p x t = τ + p x t=tau+pxt=\tau+p xt=τ+px

P ( x , t ) : P ( x , t ) : P(x,t):P(x, t):P(x,t): input data

darr\downarrow

slant-stack gather

FIG. 6.3-8. Construction of slant-stack gathers.
Then, sum the data in the τ p τ p tau-p\tau-pτp domain over the ray parameter p p ppp axis to obtain
P ( x , t ) = p S ( p , t p x ) P ( x , t ) = p S ( p , t p x ) P(x,t)=sum_(p)S(p,t-px)P(x, t)=\sum_{\boldsymbol{p}} S(p, t-p x)P(x,t)=pS(p,tpx)
To restore amplitudes properly, tho filtering is applied before inverse mapping. This is accomplished by multiplying the amplitude spectrum of each slant-stack trace by the absolute value of the frequency. Rho filtering is equivalent to differentiating the wavefield before the summation that is involved in the integral formulation of migration (Section 4.1).
There is a distinction between slant stack and the exact plane-wave decomposition of a wavefield. Treitel et al. (1982) mathematically analyzed the planewave decomposition process and distinguished between conventional slant stack described here and what may be called the proper slant stack. A conventional slant stack yields an exact plane-wave decomposition when we deal with line sources; a proper slant stack yields an exact plane-wave decomposition when we deal with point sources. A proper slant stack is generated using the same steps that we just described for a conventional slant stack except that a convolution of the LMO-applied wavefield by a filter operator is performed before summation. This operator corrects for 3-D effects by converting a wavefield that was obtained from a point source into a wavefield that was obtained from a line source. As far as kinematics is concerned, the two types of slant stacking are equivalent. They differ only in treatment of amplitudes (Treitel, personal communication).
A schematic description of the plane-wave mapping given by equations ( 6 4 a , b ) 6 4 a , b ) 6-4a,b)6-4 a, b)64a,b) is shown in Figure 6.3-9. We
FIG. 6.3-9. A hyperbola in a CMP gather maps onto an ellipse in the r p r p r-pr-prp domain.
start by summing amplitudes in the offet domain along the horizontal path p = 0 p = 0 p=0p=0p=0. This line intersects the reflection hyperbola in the vicinity of apex A A AAA. Thus, point A A AAA maps onto point A A A^(')A^{\prime}A on the τ p τ p tau-p\tau-pτp plane, corresponding to the trace with p = 0 p = 0 p=0p=0p=0. By tilting the line of summation, the hyperbola is intersected at location B B BBB, which maps onto B B B^(')B^{\prime}B. Note that a major contribution to summation along the slanted path comes in the area of the tangential point B B BBB. This zone of tangency is called the Fresnel zone.
The Fresnel zone gets broader for higher velocities and deeper events. In fact, the summation over the offset axis after linear moveout correction can be confined to the Fresnel zone. The steepest necessary path of summation is along p = 1 / v p = 1 / v p=1//vp=1 / vp=1/v, which is the asymptote to the hyperbola. This path corresponds to rays that are 90 degrees to the vertical. The energy along the asymptote maps to C C C^(')C^{\prime}C on the p p ppp-axis. By using the mapping described previously - linear moveout correction followed by summation over the offset axis for a range of p p ppp-values (equations 6-4a,b), the hyperbolic trajectories in the t x t x t-xt-xtx domain are mapped to elliptical trajectories in the r p r p r-pr-prp domain. In reality, we never record a hyperbola with infinite extent nor a zero-offset trace. Therefore, the elliptical path in the τ p τ p tau-p\tau-pτp domain never is complete from A A A^(')A^{\prime}A to C C C^(')C^{\prime}C.
Figure 6.3-10 illustrates the τ p τ p tau-p\tau-pτp transform of more than one hyperbolic event in the t x t x t-xt-xtx domain. Subcritical reflections A A AAA and D D DDD (those with an angle of incidence smaller than the critical angle) map into the region of lower p p ppp-values, while supercritical reflections C C CCC (wideangle reflections) map into the region of higher p p ppp values. Ideally, a linear event in the offset domain, such as a refraction arrival B B BBB, maps to a point in the slant-stack domain. Conversely, a linear event in the slant-stack domain maps to a point in the offset domain.
FIG. 6.3-10. Various arrivals on a CMP gather mapped onto the corresponding τ p τ p tau-p\tau-pτp gather. Events A , B , C A , B , C A,B,CA, B, CA,B,C and D D DDD map onto A , B , C A , B , C A^('),B^('),C^(')A^{\prime}, B^{\prime}, C^{\prime}A,B,C and D D D^(')D^{\prime}D.
Figure 6.3-11 shows a shot gather that contains predominantly water-bottom and peg-leg multiples. The horizonted axis in the τ p τ p tau-p\tau-pτp domain, in this example, is horizontal phese velocity 1 / p 1 / p 1//p1 / p1/p. Besides the waterbottom reflection W W W\boldsymbol{W}W, there are two distinct primaries, P 1 P 1 P_(1)P_{1}P1 and P 2 P 2 P_(2)P_{2}P2. Multiple reflections map along the elliptical trajectories that converge at p = ( 1 / 1500 ) s / m p = ( 1 / 1500 ) s / m p=(1//1500)s//mp=(1 / 1500) \mathrm{s} / \mathrm{m}p=(1/1500)s/m, the inverse of the water velocity.
A shot gather containing linear events is shown in Figure 6.3-12. Note the strong amplitudes on the τ p τ p tau-p\tau-pτp gather that correspond to the guided waves observed in the offset data. Again, the horizontal axis in the τ p d o τ p d o tau-pdo-\tau-p \mathrm{do}-τpdo main is horizontal phase velocity 1 / p 1 / p 1//p1 / p1/p. In both field data examples shown in Figures 6.3-11 and 6.3-12, the τ p τ p tau-p\tau-pτp gathers were constructed using only positive p p ppp-values. Thus, the backscattexed energy, for instance in the shot gather shown in Figure 63-12, is not represented in the τ p τ p tau-p\tau-pτp gather.

Practical Aspects of Slant Stacking

First, we examine the interrelations between various domains used in seismic data processing. Consider a bandlimited dipping event in the t x t x t-xt-xtx domain as shown in Figure 6.3-13. The offset range is from 250 to 5000 m 5000 m 5000m5000 \mathrm{~m}5000 m with a trace spacing of 50 m 50 m 50m50 \mathrm{~m}50 m. This event is mapped along a radial line A A A A AA^(')A A^{\prime}AA in the f k f k f-kf-kfk domain.
The slope of the radial line, ω / k x ω / k x omega//k_(x)\omega / k_{x}ω/kx is related to the horizontal phase velocity v / sin θ v / sin θ v//sin thetav / \sin \thetav/sinθ by the relationship
ω k x = v sin θ ω k x = v sin θ (omega)/(k_(x))=(v)/(sin theta)\frac{\omega}{k_{x}}=\frac{v}{\sin \theta}ωkx=vsinθ
(a)
Phase Veloclty ( k m / s ) ( k m / s ) (km//s)(\mathrm{km} / \mathrm{s})(km/s)
(b)
FIG. 6.3-11. (a) A shot gather containing primary and multiple refiections, (b) the corresponding τ p τ p tau-p\tau-pτp gather. The horizontal axis in (b) is horizontal phase velocity 1 / p 1 / p 1//p1 / p1/p. (Data courtesy Shell and Esso.)
(a) (b)
FIG. 6.3-12. (a) A τ p τ p tau-p\tau-pτp gather and (b) the corresponding shot gather. The horizontal axis in (b) is horizontal phase velocity 1 / p 1 / p 1//p1 / p1/p
FIG. 6.3-13. A single dipping event in various domains.
FIG. 6.3-14. A spatially aliased single dipping event in various domains.
(a)
(b)
(c)
FIG. 6.3-15. Slant stacking is invertible: (a) A CMP gather is mapped from t z t z t-zt-ztz domain onto τ p τ p tau-p\tau-pτp domain (b), from which the original gather can be reconstructed (c). The linear streaks labeled as C T C T CTC TCT in (b) are caused by the finite cable length.
Substitute for p = sin θ / v p = sin θ / v p=sin theta//vp=\sin \theta / vp=sinθ/v to find the relationship between the variables in the transform domain given by
k x = p ω . k x = p ω . k_(x)=p omega.k_{x}=p \omega .kx=pω.
Figure 6.3-13 also shows the mapping of the dipping event to the τ p τ p tau-p\tau-pτp domain. Note that a linear event in the t x t x t-xt-xtx domain maps onto a point in the τ p τ p tau-p\tau-pτp domain. Converse also is true - a linear event in the τ p τ p tau-p\tau-pτp domain maps onto a point in the t x t x t-xt-xtx domain.
A 1-D Fourier transform of the slant-stack traces in the time direction gives the amplitude spectrum in the w p w p w-pw-pwp domain, which also is shown in Figure 6.313. Actually, the ψ p ψ p psi-p\psi-pψp plane describes the frequency dependency of horizontal phase velocity and is used in analyzing guided waves (Section F.1). The energy along the radial direction A A A A AA^(')A A^{\prime}AA in the ω k x ω k x omega-k_(x)\omega-k_{x}ωkx domain is equivalent to that along the vertical direction B B B B BB^(')B B^{\prime}BB in the w p w p w-pw-pwp domain.
Figure 6.3-14 shows a spatially aliased dipping event. Again, as in Figure 6.3-13, the offset range is from 250 to 5000 m 5000 m 5000m5000 \mathrm{~m}5000 m with a trace spacing of 50 m 50 m 50m50 \mathrm{~m}50 m. The wraparound observed in the ω k x ω k x omega-k_(x)\omega-k_{x}ωkx plane results from the inadequate spatial sampling of the event. Note that both the unaliased component, segment 1 , and the aliased component, segment 2 , map onto a single p p ppp trace. We expect the spatially aliased part to map onto a number of negative p p ppp traces. However, if this wexe the case, then the aliased frequency range (21 to 42 H z 42 H z 42Hz42 \mathrm{~Hz}42 Hz ) would be absent from the ω p ω p omega-p\omega-pωp plane in which only the positive p p ppp values were included.
(a)
(p)
(c)
(d)
(a)
FIG. 6.3-16. Slant stack can be used for trace interpolation: (a) a t x t x t-xt-xtx gather is transformed to a T p T p T-pT-pTp gather (c), and is reconstructed using a finer trace spacing (d). The corresponding f k f k f-kf-kfk spectra show spatial aliasing in the original gather (b), which was eliminated after reconstruction (e).
We now outline the steps involved in slant-stack processing that includes forward and inverse τ p τ p tau-p\tau-pτp transforms.
(a) Start with the offset data, apply linear moveout correction for a specified value of p p ppp, and sum over offset (equations 6-4a,b). Repeat for a range of p p ppp values, the output is the slant-stack gather (Figure 6.3 8 ) 6.3 8 ) 6.3-8)6.3-8)6.38).
(b) Apply a particular process in the slant-stack domain, such as dip filtering or deconvolution.
(c) Apply tho filterng to the processed slant-stack gather.
(d) Then, apply inverse linear moveout correction for a specified offset value, and sum over the p p ppp-range (equations 6-5a,b). Repeat for all offsets; the output is the slant-stack processed offset data.
We illustrate the forward and inverse τ p τ p tau-p\tau-pτp transforms using the synthetic CMP gather shown in Figure 6.3-15. This figure also shows the slant-stack and reconstructed CMP gather without any process applied, except the rho filter. The linear streaks labeled as C T C T CTC TCT
on the slant-stack gather in Figure 6.3-15 are caused by the finite cable length. To minimize the streaks, for each trace in the t x t x t-xt-xtx domain, Kelamis and Mitchell (1989) limit the mapping from the t x t x t-xt-xtx domain to the τ p τ p tau-p\tau-pτp domain to a time-variant zone in the τ p τ p tau-p\tau-pτp domain. Specifically, only one trace at a time from the t x t x t-xt-xtx domain is mapped onto all p p ppp traces. The resulting τ p τ p tau-p\tau-pτp gather is muted on both the low and high end of the p p ppp axis in a time-varying manner. The mute functions are based on a representative primary velocity function.
During reconstruction of the t x t x t-xt-xtx gather, we do not have to use the same trace spacing that was used for the original t x t x t-xt-xtx gather. Consider the synthetic CMP gather in Figure 6.3-16a. The 2-D amplitude spectrum shows that frequencies above 48 H z 48 H z 48Hz48 \mathrm{~Hz}48 Hz are spatially aliased (Figure 6.3-16b). This gather can be mapped to the slant-stack domain (Figure 6.3-16c) and reconstructed using a finer trace spacing (Figure 6.3-16d). The original trace spacing is 25 m 25 m 25m25 \mathrm{~m}25 m; the reconstructed gather has a trace spacing of 12.5 m 12.5 m 12.5m12.5 \mathrm{~m}12.5 m. The 2 D 2 D 2-D2-\mathrm{D}2D amplitude spectrum of the trace-interpolated gather shows that no frequencies are spatially aliased (Figure 6.3-16e). Nevertheless, note the missing high-frequency energy beyond 60 H z 60 H z 60Hz60 \mathrm{~Hz}60 Hz. This energy mainly is along the steep direct arrival path in the input gather (Figure 6.3-16a) and is absent in the output gather (Figure 6.3-16d). We see that reconstruction can be successful even for spatially aliased data, provided dips do not have a wide range of variation.

Slant-Stack Parameters

A single dipping event in the t x t x t-xt-xtx domain ideally maps onto a single trace in the τ p τ p tau-p\tau-pτp domain that represents the dip of that event (Figure 6.3-13). However, because of the discrete sampling along the p p ppp-axis and because only a finite number of p p ppp traces are spanned from a finite number of offset traces, an imperfect mapping results. When plotted with a higher gain, the slant-stack gather in Figure 6.3-13 seems surprisingly different (Figure 6.3-17b). The linear streaks are contributions from end points E E EEE and F F FFF of the dipping event in the t x t x t-xt-xtx domain. More specifically, point E E EEE maps onto A A AAA and B B BBB when p p ppp is set to its rninimum and maximum values, respectively. For any intermediate value of p p ppp, point E E EEE maps along A B A B ABA BAB. Similarly, the other end point F F FFF maps along C D C D CDC DCD.
Linear streaks that result from end effects associated with cable truncation are only one type of artifact encountered when constructing slant stacks. Another type of artifact is the high-frequency wavetrain that is especially apparent on traces with large p p ppp values as in
FIG. 6.3-17. Panels (a), (d), and (g) are the input CMP gathers, which contain a single dipping event E F E F EFE FEF. Panels (b), (e), and (h) are the corresponding slant-stack gathers. Panels (c), (f), and (i) are the reconstructed offet gathers. The slant-stack and reconstructed gathers are displayed at a higher gain than the input gathers.
Figure 6.3 17 a 6.3 17 a 6.3-17a6.3-17 \mathrm{a}6.317a. It occurs because the dipping event is sampled along steep slanted paths.
Several practical ronsiderations affect the artifact level in slant stacks. A short cable length in the t x t x t-xt-xtx
FIG. 6.3-18. (a) Input gather, (b) slant-stack gather, (c) reconstructed offset gather, (d) f k f k f-kf-kfk spectrum of panel (a), (e) f k f k f-kf-kfk spectrum of panel (c). Panels (f), (h), and (j) are the slant-stack gathers derived from the input gather (a) using different numbers of p p ppp-values and ranges, while panels (g), (i), and (k) are rœconstructions from them. Input (a) is the same for all cases. See text for details.
domain enhances the end effects and, thus causing poor reconstruction as demonstrated in Figure 6.3-17. Start with an offset gather that contains a single dipping event E F E F EFE FEF in panel (a). Panel (b) is the τ p τ p tau-p\tau-pτp gather and panel (c) is the reconstructed t x t x t-xt-xtx gather from it. To emphasize the artifacts, the last two panels of the sets of three are displayed at a higher gain compared to the original. Using two-thirds of the offet gather, panel (d), the τ p τ p tau-p\tau-pτp gather and the reconstruction from it were obtained as shown in panels (e) and (f). Finally, using only one-third of the original gather, panel (g), panels (h) and (i) are obtained. Note that short cables produce artifacts G G GGG and H H HHH on the slant-stack and reconstructed gathers. Accurate construction of slant-stack gathers usually requires sufficiently long cable length and adequately small offset interval,
To study the sampling along the p-axis and the range of p p ppp values used in constructing a slant-stack gather, consider the synthetic gather shown in Figure 6.3-18a, which consists of hyperbolic events. These events are mapped along the ellipses in the slant-stack gather (Figure 6.3-18b). The following values were chosen: the number of p p ppp traces n p n p n_(p)n_{p}np equal to the number of x x xxx traces n x n x n_(x)n_{x}nx; the minimum p p ppp value, p m 1 n = 0 p m 1 n = 0 p_(m1n)=0p_{m 1 n}=0pm1n=0; and the maximum p p ppp value, p max p max p_(max)p_{\max }pmax set to the largest dip present in the data. Reconstruction using these parameters produced an accurate result (Figure 6.3-18c). There is some difference in the 2-D amplitude spectra of the original, panel (d), and the reconstructed gathers panel (e), because p m i n p m i n p_(min)p_{m i n}pmin was set to zero.
What happens when the p-axis is undersampled? Figure 6.3-18f shows the slant-stack gather and Figure 6.3-18g shows the reconstructed gather that is obtained by setting n p = n x / 2 n p = n x / 2 n_(p)=n_(x)//2n_{p}=n_{x} / 2np=nx/2 and keeping ( p m m , p n a x p m m , p n a x p_(mm),p_(nax)p_{m m}, p_{n a x}pmm,pnax ) the same as in panel (b); thus, the p p ppp-increment is twice as large as in panel (b). The input gather is the same as it was
FIG. 6.3-19. The same sequence of panels as in Figure 6.3-18, except that the input gather contains spatially aliased frequency components. Note wraparound in the f k f k f-kf-kfk spectrum (d).
in panel (a). Note that undersampling along the p p ppp-axis introduces some noise, labeled as A A AAA in Figure 6.3 18 g 6.3 18 g 6.3-18g6.3-18 \mathrm{~g}6.318 g, into the reconstructed gather.
Consider the opposite situation of oversampling along the p p ppp-axis as in Figure 6.3-18h. Here, n p = 2 n x n p = 2 n x n_(p)=2n_(x)n_{p}=2 n_{x}np=2nx and the ( p m n , p m a x ) p m n , p m a x (p_(mn),p_(max))\left(p_{m n}, p_{m a x}\right)(pmn,pmax) range is the same as in Figure 6.3 18b. Note that oversampling in the p p ppp-axis does no harm, but gains nothing either (Figure 6.3-18i). Although not shown here, further experiments show that regardless of spread length, oversampling in the p p ppp-domain does not improve the quality of the reconstructed gather.
In practice, we may encounter an inappropriate choice of the ( p m i n , p m a x ) p m i n , p m a x (p_(min),p_(max))\left(p_{m i n}, p_{m a x}\right)(pmin,pmax) range, meaning that p m a x p m a x p_(max)p_{m a x}pmax corresponds to a larger dip than is present in the input gather (Figure 6.3-18j). Here, n p = n x , , p man = 0 n p = n x , , p man  = 0 n_(p)=n_(x,),p_("man ")=0n_{p}=n_{x,}, p_{\text {man }}=0np=nx,,pman =0, p max p max  p_("max ")p_{\text {max }}pmax  is twice as large as the value chosen in Figure 6.3-18b, and the p p ppp-increment is the same as in Figure 6.3-18f. Thus, the right half of the p p ppp-gather (Figure 6.3 18 j 6.3 18 j 6.3-18j6.3-18 \mathrm{j}6.318j ) does not contain dip components that are present in the input data (Figure 6.3-18a). Instead, the right half contains noise resulting from cable truncation and sampling along steep slanted paths with p p ppp-values associated with dips not contained in the offset data. This results in some noise in the reconstructed gather, labeled as B B BBB in Figure 6.3-18k. In practice, suitable muting in the p p ppp domain can eliminate the artifacts caused by spurious p p ppp traces as in the right half of Figure 6.3-18j.
Now consider a synthetic gather that contains spatially aliased events. Figure 6.3-19 shows panels that are equivalent to those in Figure 6.3-18, except that the input gather (Figure 6.3-19a) has spatially aliased frequency components. It is clear that the artifacts observed in Figure 6.3-19 are more pronounced. However, note that if the ( p m n n , p m a x ) p m n n , p m a x {:p_(mnn),p_(max))\left.p_{m n n}, p_{m a x}\right)pmnn,pmax) range, n p n p n_(p)n_{p}np and the p p ppp-increment are chosen properly (Figure 6.3-19b), then reconstruction is quite accurate, even with spatially aliased data. The amplitude spectrum of the original gather (Figure 6.3-19d) and that of the reconstructed gather (Figure 6.3-19e) are almost identical, except that the latter does not contain unaliased energy for p < 0 p < 0 p < 0p<0p<0, which was not included in constructing Figure 6.3-19b.
(a)
(b)
(c)
Offset ( m ) ( m ) (m)(m)(m)
Offset ( m ) ( m ) (m)(\mathrm{m})(m)
(e)
FIG. 6.3-20. (a) A field data set with strong ground-roll energy A A AAA, its backscattered component B B BBB, guided waves C 1 C 1 C_(1)C_{1}C1 and a strong reflection D 7 D 7 D_(7)D_{7}D7 (b) τ p τ p tau-p\tau-pτp gather obtained from this field data set; (c) reconstruction of the field record using the portion to the left of the solid vertical line in (b) (zone E); (d) dip-filtered data obtained by subtracting the gather in (c) from the original data in (a); (e) the original data set (a) after f k f k f-kf-kfk dip filtering. (Data courtesy Turkish Petroleum Corporation.)
Again, we see the case of an undersampled p p ppp-axis causing some noise in the reconstructed gather, the case of oversampled p p ppp-axis causing no harm, and finally, inappropriate inclusion of the p p ppp-values corresponding to dips absent from the input gather causing noise in the reconstructed gather.
This experimentad study and other similar studies of the parameters involved in slant-stack processing lead to the following empirical statements:
(a) n p = n x n p = n x n_(p)=n_(x)n_{p}=n_{x}np=nx is a good, general rule.
(b) The ( p m i n , p max p m i n , p max p_(min),p_(max)p_{m i n}, p_{\max }pmin,pmax ) range should only span the dip components of interest in the data. For example, for marine CMP data, p m x n = 0 , p m a x = ( 1 / 1500 ) p m x n = 0 , p m a x = ( 1 / 1500 ) p_(mxn)=0,p_(max)=(1//1500)p_{m x n}=0, p_{m a x}=(1 / 1500)pmxn=0,pmax=(1/1500) s / m s / m s//m\mathrm{s} / \mathrm{m}s/m
(c) The p p ppp-increment then is ( p max p m a n ) / n x p max p m a n / n x (p_(max)-p_(man))//n_(x)\left(p_{\max }-p_{m a n}\right) / n_{x}(pmaxpman)/nx. Sampling along the p p ppp-axis also can be done with equal increment in horizontal phase velocity 1 / p 1 / p 1//p1 / p1/p.

Time-Variant Dip Filtering

The slant-stack domain is convenient for implementing dip filtering. To illustrate this, consider the problem of attenuating the strong ground roll in the field record in Figure 6.3-20a, which was obtained from a walkaway noise test. For simplicity, ignore the backscattered
Rayleigh waves, since removing them would mean computing negative p p ppp traces. Figure 6.3 20 b 6.3 20 b 6.3-20b6.3-20 \mathrm{~b}6.320 b shows the τ p τ p tau-p\tau-pτp gather obtained from this field data set. Phase velocity is varied from 500 m / s 500 m / s 500m//s500 \mathrm{~m} / \mathrm{s}500 m/s to over 10000 m / s 10000 m / s 10000m//s10000 \mathrm{~m} / \mathrm{s}10000 m/s. The ground roll generally has very low phase velocity and is mapped to the left of the solid line at 2500 m / s 2500 m / s 2500m//s2500 \mathrm{~m} / \mathrm{s}2500 m/s, labeled as E E EEE in Figure 6.3-20b.
Suppose that the τ p τ p tau-p\tau-pτp gather traces that contain the ground roll are used to reconstruct the t t ttt x x xxx gather with the original offsets. The reconstructed gather shown in Figure 6.3-20c contains only the dips that we want to remove from the original wavefield. If this reconstructed gather is subtracted from the original gather (Figure 6.3-20a), the result is the dip-filtered shot record shown in Figure 6.3-20d. An alternate way to compute the dip-filtered shot record is to use, for reconstruction, the slant-stack traces that are only within zone F F FFF to the right of the solid line in Figure 6.3-20b. With either approach, the amplitudes at the boundary between the pass and reject zones, the solid line at 2500 m / s m / s m//s\mathrm{m} / \mathrm{s}m/s in Figure 6.3 20 b 6.3 20 b 6.3-20b6.3-20 \mathrm{~b}6.320 b, must be tapered to reduce artifacts in the reconstructed t x t x t-xt-xtx gather.
Dip filtering in the slant-stack domain should be nearly equivalent to the f k f k f-kf-kfk dip filtering process described in Section 6.2. Figure 6.2-1b shows the 2-D amplitude spectrum of the original field record of Figure 6.2-1a, which is the same data set as in Figure 6.3-20a.
The reject zone is defined by the fan in Figure 6.2-1c, which is equivalent to zone E E EEE to the left of the vertical line in Figure 6.3-20b.
When compared with the slant-stack output (Figure 6.3-20d), the result of f k f k f-kf-kfk dip filtering of the field data set in Figure 6.3-20e suggests basically no difference in performance. However, with the slant-stack approach, dip filtering can be applied in a time-variant manner. This means that the boundary between the pass and reject zones need not be vertical as in Figure 6.3-20b. Also, with the slant-stack technique, we can work with data that are irregularly spaced along the offset axis. This is not the case for the f k f k f-kf-kfk method of dip filtering, since the fast Fourier transform requires data with equal trace spacing. On occasion, dip filtering elso is incorporated into multiple attenuation in the slart-stack domain to further eliminate multiples.
An application of time-variant dip filtering to reduce the cable truncation effects on slant-stack gathers (Figure 6.3-17) is provided by Kelamis and Mitchell (1989). Their procedure is outlined below:
(a) Map a single trace in the offset domain to the slantstack domain over a specified range of p-values (equations 6-4a,b).
(b) Apply a time-varying filter by muting inner and outer portions of the slant-stack gather. The mute functions are prescribed using a velocity filter that depends on time and offset.
(c) Repeat steps (a) and (b) for all offset traces in the input gather and sum the resulting slant-stack gathers.
(d) Apply tho filtering to the summed slant-stack gather
(d) Following a specific process in the slant-stack do main, such as deconvolution, apply inverse linear moveout correction for a specified offset value, and sum over the p p ppp-range (equations 6-5a,b). Repeat for all ofsets; the output is the slant-stack processed offset data.

Slant-Stack Multiple Attenuation

The slant-stack multiple attenuation technique is based on prediction of multiples. Alam and Austin (1981) and Treitel et al. (1982) investigated the application of predictive deconvolution in the slant-stack domain for multipie attentration. The application of predictive deconvolution to multiple attenuation is valid strictly for vertical incidence and the zero-offset case. Multiples are not periodic at nonzero offsets. Figure 6.3-21 shows a sketch of a shot gather with primary P P PPP (waterbottom reflection) and its multiples M 1 , M 2 M 1 , M 2 M_(1),M_(2)M_{1}, M_{2}M1,M2 with the corresponding slant-stack gather. The time separations
FIG, 6.3-21. The periodicity of multiples along radial trace O R O R ORO ROR and down the p p ppp traces.
between the multiple arrivals at a particular offset x 0 x 0 x_(0)x_{0}x0 are equal only if x = 0 x = 0 x=0x=0x=0.
Taner (1980) first recognized that the time separations between the arrivals are equal along a radial direction O R O R ORO ROR. A trace can be constructed by extracting the samples along one of these radial directions. The angle of propagation is constant along this radial trace (Ottolini, 1982). A radial trace in a layered medium is called a Snell trace (Claerbout, 1985). In a layered medium, the Snell trace would not follow a straight path as in Figure 6.3-21, since its angle of propagation changes at layer boundaries according to Snell's law (Figure 6.3-6).
Taner (1980) applied predictive deconvolution along radial traces to successfully eliminate long-period multiples. Note that the magnitude of the time separations between multiples is different from one radial trace to another (Figure 6.3-21). However, the time separations are equal along each of the slanted paths of summation. Therefore, a predictive deconvolution operator can be designed from the autocorrelogram of each p p ppp trace (such as that denoted by p 0 p 0 p_(0)p_{0}p0 in Figure 6.3-21) and applied to suppress multiples. This is demonstrated in Figure 6.3-22. The synthetic shot gather contains a water-bottom reflection and its multiples (Figure 6.322a). Note that the periodic nature of the multiples is not apparent on the autocor relogram. Therefore, predictive deconvolution should not be expected to do well in attenuating these multiples when applied to the shot gather.
The shot gather in Figure 6.3-22a now is transformed to the slant-stack domain. Figures 6.3 22 C 6.3 22 C 6.3-22_(C)6.3-22_{\mathrm{C}}6.322C and 6.3-22e show the slant-stack gather before and after predictive deconvolution was applied. Figure 6.3 22 g 6.3 22 g 6.3-22g6.3-22 \mathrm{~g}6.322 g shows
FIG. 6.3-22. Multiple attenuation in the slant-stack domain. (a) A shot gather; (b) its autocorrelogram; (c) the slant-stack gather; (d) the autocorrelogram of (c); (e) the slant-stack gather after predictive deconvolution, where operator length = 240 = 240 =240=240=240 ms and prediction lag at p = 120 m s p = 120 m s p=120msp=120 \mathrm{~ms}p=120 ms; (f) the autocorrelogram of (e); (g) reconstruction of the shot gather from (e).
reconstruction of the shot gather from the slant-stack gather in Figure 6.3-22e. Autocorrelograms before and after deconvolution in the slant-stack domain are shown beneath the respective panels. Unlike in the autocorrelogram of the shot gather in Figure 6.3-22b, the periodic nature of the multiples in the data is pronounced in the autocorrelogram of the slant-stack gather (Figure 6.3-22d). Note that the periodicity of multiples changes from one p p ppp trace to the next. The largest period occurs along the trace that corresponds to the minimum p p ppp value. The autocorrelogram after predictive deconvolution shows that the energy in the lags less than the specified prediction lag is retained, while the multiple energy is attenuated (Figure 6.3-22f).
Prediction lag α α alpha\alphaα and operator length n n nnn must be specified by examining the autocorrelogram of the slantstack gather (Figure 6.3-22d). These two parameters are specified for the trace corresponding to the lowest p p ppp value, as indicated in Figure 6.3-22d. Operator length is kept constant, while prediction lag is adjusted based
FIG. 6.3-23. (a) Simulation of the shot gather shown in Figure F-1a by normal-mode modeling; (b) autocorrelogram of this synthetic gather; (c) slant stack of the synthetic gather, (d) autocorrelogram of the slant-stack gather; (e) the slant-stack gather in (c) after predictive deconvolution; (f) the autocorrelogram of (e); (g) reconstruction of the synthetic gather from the slant-stack gather in (e). (Refer to the text for a description of the labeled events.
on the p p ppp value across the gather (Alam and Austin, 1981):
α ( p ) = α ( 0 ) 1 p 2 v w 2 , ( 6 8 ) α ( p ) = α ( 0 ) 1 p 2 v w 2 , ( 6 8 ) alpha(p)=alpha(0)sqrt(1-p^(2)v_(w)^(2)),quad(6-8)\alpha(p)=\alpha(0) \sqrt{1-p^{2} v_{w}^{2}}, \quad(6-8)α(p)=α(0)1p2vw2,(68)
where α ( 0 ) = α ( 0 ) = alpha(0)=\alpha(0)=α(0)= prediction lag at p = 0 p = 0 p=0p=0p=0 and v w v w v_(w)v_{w}vw is the velocity of the primaty reflection, the multiples of which are targeted for attenuation. At higher p p ppp values, the prediction lag decreases. Compare the reconstructed offset gather (Figure 6.3-22g) with the input gather (Figure 6.3 22 a 6.3 22 a 6.3-22a6.3-22 \mathrm{a}6.322a ), and note that the output contains the waterbottom primary (the only one present in the input data) and a residual of the first multiple.
Multiple attenuation in the slant-stack domain is demonstrated further by the synthetic data in Figure 6.3-23a. The synthetic shot record in Figure 6.3-23a is a simulation of the shot gather in Figure F-la using normal-mode modeling (Section F.1). Several arrivals are identified: C C CCC is the direct arrival; A A AAA is the refracted arrival associated with the hard water bottom; B B BBB is the water-bottom reflection; M 1 , M 2 M 1 , M 2 M1,M2M 1, M 2M1,M2, and M 3 M 3 M3M 3M3 are the refracted multiples; and m 1 , m 2 m 1 , m 2 m1,m2m 1, m 2m1,m2 and m 3 m 3 m3m 3m3 are the reflected multiples. D D DDD is an artifact of the normal-mode modeling technique (Section F.1).
Figure 6.3 23 c 6.3 23 c 6.3-23c6.3-23 \mathrm{c}6.323c is the slant-stack gather of the synthetic shot record in Figure 6.3-23a. This gather should be compared with the slant-stack gather of the field data in Figure F-1b. Refraction A A AAA and its multiples M 1 , M 2 M 1 , M 2 M1,M2M 1, M 2M1,M2, and M 3 M 3 M3M 3M3 map onto points in the slant-stack domain. Figure 6.3-23d is the autocorrelogram of the τ p τ p tau-p\tau-pτp gather. Unlike the autocorrelogram of the offset data (Figure 6.3-23b), note that it exhibits the periodic nature of the multiples in the data. After applying predictive deconvolution, the slant-stack gather in Figure 6.3-23e results. Only the refracted arrival A A AAA and the water-bottom reflection B B BBB remain. The nearly linear streaks, which also are present in the unprocessed slant-stack gather (Figure 6.3-23c), are artifacts caused by the finite cable length. The autocorrelogram after deconvolution is free from the multiple energy (Figure 6.3-23f). The prediction lag and operator length for the minimum p p ppp-value are as labeled in Figure 6.3-23d. Adjustment for the prediction lag was made across the gather using equation (6-8). Finally, reconstruction of the shot gather is shown in Figure 6.3-23g. When compared with Figure 6.3-23a, note that both the refracted and reflected primaries are retained, while their associated multiples are largely attenuated.
The performance of slant-stack multiple attenuation on field data now is examined. Figure 6.3-24a shows a shot gather that contains a strong water-bottom reflection A A AAA, two distinct primaries B B BBB and C C CCC, the waterbottom multiples D D DDD and E E EEE, and the peg-leg F F FFF, which is associated with the primary event B B BBB. The slant-stack gathers before and after predictive deconvolution are shown in Figures 6.3-24b and 6.3-24d with their respective autocorrelograms (Figures 6.3-24c and 6.3-24e). Note that multiples are significantly attenuated in the reconstructed gather (Figure 6.3-24f).
Choice of the prediction lag and operator length is tricky for this particular data set. From the autocorrelogram in Figure 6.3-24c, note the energy G G GGG, which is caused by the correlation of two primaries A A AAA and B B BBB in Figure 6.3-24a. Energy H H HHH is caused by the correlation of the water-bottom multiples. Prediction lag is chosen to retain primary energy G G GGG, and the operator length is chosen to include the multiple energy H H HHH. Note that in Figure 6.3-24e multiple energy H H HHH is significantly attenuated and primary energy G G GGG is preserved.
Since slant stacking is a plane-wave decomposition, and since plane waves do not have spherical divergence, input to slant stacking must not be compensated for by geometric spreading. Preserving correct amplitude relationships is essential for the effectiveness of slant-stack multiple attenuation. The geometric spreading correction is applied to offset data by using a primary velocity function. This enhasces the multiples in the data and destroys the amplitude relationship between them. Predictive deconvolution in the offet domain then may not suppress these multiples effectively.
After multiple attenuation in the slant-stack domain, reconstruction of the offset data is performed, the geometric spreading correction is applied, and processing is continued. Figures 6.3 25 a 6.3 25 a 6.3-25a6.3-25 \mathrm{a}6.325a and 6.3 25 b 6.3 25 b 6.3-25b6.3-25 \mathrm{~b}6.325 b show the shot gathers in Figures 6.3-24f and 6.3-24a after the geometric spreading correction. Note that strong multiples are attenuated significantly after deconvolution in the slant-stack domain. While the autocorrelogram of the shot gather with slant-stack processing (Figure 6.3 24 6.3 24 6.3-246.3-246.324 c) exhibits the presence of strong multiples, the autocorrelogram of the shot gather without slant-stack processing does not exhibit the periodicity of multiples (Figure 6.3-25c).
Figures 6.1-2, 6.1-3, and 6.1 5 6.1 5 6.1-56.1-56.15 show that when multiples are in the form of short-period reverberations, the autocorrelogram of the offset data seems to adequately represent the periodic nature of multiples. Hence, predictive deconvolution of the offset data often can remove reverberations. On the other hand, long-period multiples are poorly represented by the autocorrelogram of the offset data (Figure 6.3-25c) and are better defined in the slant-stack domain (Figure 6.3-24c).
Figure 6.3-26 shows the stacked section that corresponds to the field data in Figure 6.3-25b. The slantstack processed section, which corresponds to the data in Figure 6.3-25a, is shown in Figure 6.3-27. Major primary reflections stand out more distinctively in the slant-stack processed section.
(a)
(c)
(f)
FIG. 6.3-24. Multiple attenuation in the slant-stack domain. (a) A field record without geometric spreading correction; (b) the slant-stack gather obtained from it; (c) the autocorrelogram of (b); (d) the slant-stack gather after predictive deconvolution, where operator length = 400 m s = 400 m s =400ms=400 \mathrm{~ms}=400 ms and prediction lag (at p = 0 p = 0 p=0p=0p=0 ) = 700 m s = 700 m s =700ms=700 \mathrm{~ms}=700 ms; (e) the autocorrelogram of (d); (f) reconstruction of the shot gather from (d).
(a)
s s s\mathbf{s}s
(c)
FIG. 6.3-25. (a) Shot gather in Figure 6.3-24f after geometric spreading correction; (b) shot gather in Figure 6.3-24a after geometric spreading correction; (c) autocorrelogram of (b). Events A, B and C are the primaries labeled as in Figure 6.3 24 a 6.3 24 a 6.3-24a6.3-24 \mathrm{a}6.324a
FIG. 6,3-26. A CMP stack associated with the gather shown in Figure 6.3-25b.
FIG. 6.3-27. A CMP stack associated with the gather shown in Figure 63 25 63 25 63-2563-256325 a after slant-stack multiple attenuation. Compare with Figure 6 3-26.
ray parameter (half) offset velocity
FIG. 6.4-1. Slant-stack (left) and velocity-stack (right) mapping of a CMP gather (center). (See text for details.)

6.4 THE RADON TRANSFORM

In the previous section, we discussed slant-stack transformation and its application to multiple attenuation. Slant-stack transformation involves the application of linear moveout correction and summation over the offset axis. As a result of this mapping, the offset axis is replaced with the ray-parameter axis. The relationhsip between the input coordinates ( h , t ) ( h , t ) (h,t)(h, t)(h,t) and the transform coordinates ( p , τ ) ( p , τ ) (p,tau)(p, \tau)(p,τ) is given by the linear moveout equation
t = τ + 2 p h t = τ + 2 p h t=tau+2pht=\tau+2 p ht=τ+2ph
where p p ppp is the ray parameter (Section 6.3), t t ttt is the twoway traveltime, τ τ tau\tauτ is the two-way intercept time at p = 0 p = 0 p=0p=0p=0, and h h hhh is the half-offset.
A companion mapping is called velocity-stack transformation which involves application of hyperbolic moveout correction and summation over the offset axis. As a result of this mapping, the offset axis is replaced with the velocity axis. The relationship between the input coordinates ( h , t ) ( h , t ) (h,t)(h, t)(h,t) and the transform coordinates ( v , τ ) ( v , τ ) (v,tau)(v, \tau)(v,τ) is given by the hyperbolic moveout equation
t 2 = τ 2 + 4 h 2 ϑ 2 t 2 = τ 2 + 4 h 2 ϑ 2 t^(2)=tau^(2)+(4h^(2))/(vartheta^(2))t^{2}=\tau^{2}+\frac{4 h^{2}}{\vartheta^{2}}t2=τ2+4h2ϑ2
where t t ttt is the two-way traveltime, τ τ tau\tauτ is the two-way zerooffset time, h h hhh is the half-offset and v v vvv is the stacking velocity.
Refer to Figure 6.41 to review the nature of these two transformations. A linear event in the offset do- main, such as a refracted arrival R R RRR or linear noise G G GGG, adeally maps onto a point in the ray-parameter domain. A hyperbolic event such as a primary ( P 1 , P 2 ) P 1 , P 2 (P_(1),P_(2))\left(P_{1}, P_{2}\right)(P1,P2) or a multiple ( M 1 , M 2 , M 3 M 1 , M 2 , M 3 (M_(1),M_(2),M_(3):}\left(M_{1}, M_{2}, M_{3}\right.(M1,M2,M3 ) is mapped onto an ellipse in the ray-parameter domain. Since we always have a truncated hyperbola, we inevitably would have a truncated ellipse. A fast-velocity hyperbola maps onto a tighter ellipse than a slow-velocity hyperbola.
Multiples are not periodic in the offset domain, even for a horizontally layered earth model; but they are periodic in the ray-parameter domain. Thus we can use the periodicity for predicting and attenuating multiples in the slant-stack domain as was demonstrated in Section 6.3
Again, we refer to Figure 6.4-1 and now turn our attention to velocity-stack transformation. Since the mapping function is hyperbolic, in this case, a hyperbola in the ofset domain, such as a primary or a multiple, ideally maps onto a point in the velocity domain. Hence, we are able to distinguish between multiples and primaries in the velocity domain based on velocity discrimination and use this criterion to attenuate multiples.
The ideal circumstances described by Figure 6.41 that a linear event in the ofset domain maps onto a point in the ray-parameter domain using equation (6-9a), and a hyperbolic event in the offset domain maps onto a point in the velocity domain using equation (6-9b) do not hold in reality. Specifically, a conventhonal velocity-stack gather consists of constant-velocity
(a)
(b)
(c) velocity( k m / s ) k m / s ) km//s)\mathrm{km} / \mathrm{s})km/s)
2 3 2 3 2quad32 \quad 323
(d)
FIG. 6.4-2. (a) A synthetic CMP gather with three primary reflections; (b) a synthetic CMP gather with one primary reflection (arrival time at 0.2 s 0.2 s 0.2s0.2 \mathrm{~s}0.2 s at zero-offset time) and its multiples; (c) composite CMP gather containing the primaries and multiples in (a) and (b); (d) the conventional velocity-stack gather derived from the composste CMP gather using equation (6-10a). Note the amplitude smearing along the velocity axis.
FIG. 6.4-3. (a) The same velocity-stack gather as in Figure 6.4-2d; (b) the CMP gather reconstructed from the velocitystack gather in (a) using equation (6-10b); (c) velocity-stack gather derived from (b) using equation (6-10a); (d) CMP gather reconstructed from (c) using equation (6-10b). Note the degrudation of velocity resolution on the velocity-stack gather (c) due to reduction of far-offset amplitudes (b).
FIG. 6.4-4. (a) The CMP gather of Figure 6.42c before, and (b) after t 2 t 2 t^(2)t^{2}t2-stretching note the vertical axis is in unts of t 2 t 2 t^(2)t^{2}t2; (c) the velocity-stack gather that represents the Radon transform of (b) using the singular-value decomposition procedure described in Section F.3; (d) the same velocity-stack gather as in (c) after undoing the t 2 t 2 t^(2)t^{2}t2-stretching.
FIG. 6.4-5. (a) The same velocity-stack gather as in Figure 6 4-4d; (b) the CMP gather reconstructed from the velocity-stack gather in (a) using equation (a-10b); (c) velocity-stack gather that represents the Radon transform of (b) using the singularvalue decomposition procedure described in Section F.3; (d) CMP gather reconstructed from (c) using equation (6-10b). Note the accurate reconstruction of the CMP gather (b) from the proper velocity-stack gather (a) compared to the reduction of far-offset amplitudes on the CMP gather in Figure 6.4-3b reconstructed from the conventional velocity-stack gather in Figure 6.4 3 a 6.4 3 a 6.4-3a6.4-3 \mathrm{a}6.43a.
(a)
(b)
(c)
FIG. 6.4-6. (a) Synthetic CMP gather; (b) conventional velocty-stack gather; (c) reconstructed CMP gather
(a)
(b)
(c)
FIG. 6.4-7. (a) Synthetic CMP gather; (b) velocity-stack gather based on the discrete Radon transform; (c) reconstructed CMP gather.
CMP-stacked traces. It emphasizes the energy associated with the events that follow hyperbolic traveltime trajectories in the CMP gather. A fundamental problem with velocity-stack transformation is that a CMP gather only includes a cable-length portion of a hyperbolic traveltime trajectory. The finite cable length, discrete sampling along the offset axis and the closeness of hyperbolic summation paths at near offsets cause smearing of the stacked amplitudes along the velocity axis. Unless this smearing is removed, inverse mapping from the velocity domain back to the offset domain does not reproduce the amplitudes in the original CMP gather.
The gather resulting from the inverse mapping can be considered as the modeled CMP gather that contains only the hyperbolic events present in the actual CMP gather. A least-squares minimization of the energy contained in the difference between the actual CMP gather and the modeled CMP gather removes smearing of amplitudes on the velocity-stack gather and increases velocity resolution. A practical application of this procedure is in the separation of multiples from primaries.

Velocity-Stack Transformation

Consider the synthetic CMP gather in Figure 6.4-2c. This gather is a composite of the CMP gather with three primary reflections shown in Figure 6.4-2a and the CMP gather with one primary and its multiples shown in Figure 6.4-2b. Note that the three primaries of the CMP gather in Figure 6.4-2a arrive at the same zerooffset times as the multiples, and the moveout between the primaries and multiples is less than 100 m s 100 m s 100ms100 \mathrm{~ms}100 ms at the far offset ( 2350 m 2350 m 2350m2350 \mathrm{~m}2350 m ).
Traces in the composite CMP gather (Figure 6.42c) are stacked with a range of constant velocities, and the resulting stacked traces are displayed side by side, forming the conventional velocity-stack gather shown in Figure 6.4-2d. Note that the maximum stacked amplitudes correspond to the primary and multiple velocities. The lower-amplitude horizontal streaks in the velocitystack gather (Figure 6.4-2d) are a result of the contribution of small offsets, while the large-amplitude regions are a result of the contribution of the full range of offsets (Sherwood and Poe, 1972).
The mapping from the offset domain to the velocity domain is achieved by applying hyperbolic moveout correction and summing over offset given by
u ( v , τ ) = h d ( h . t = τ 2 + 4 h 2 / v 2 ) , ( 6 10 a ) u ( v , τ ) = h d h . t = τ 2 + 4 h 2 / v 2 , ( 6 10 a ) u(v,tau)=sum_(h)d(h.t=sqrt(tau^(2)+4h^(2)//v^(2))),quad(6-10 a)u(v, \tau)=\sum_{h} d\left(h . t=\sqrt{\tau^{2}+4 h^{2} / v^{2}}\right), \quad(6-10 a)u(v,τ)=hd(h.t=τ2+4h2/v2),(610a)
where t t ttt is the two-way traveltime, τ τ tau\tauτ is the two-way zerooffset time, h h hhh is the half-offset, and v v vvv is the stacking velocity. The input d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t) represents the CMP gather, and the ouptput u ( v , τ ) u ( v , τ ) u(v,tau)u(v, \tau)u(v,τ) represents the velocity-stack gather. The inverse mapping from the velocity space back to the offset space is achieved by applying inverse hyperbolic moveout correction and summing over velocity given by
d ( h , t ) = v u ( v , τ = t 2 4 h 2 / v 2 ) d ( h , t ) = v u v , τ = t 2 4 h 2 / v 2 d^(')(h,t)=sum_(v)u(v,tau=sqrt(t^(2)-4h^(2)//v^(2)))d^{\prime}(h, t)=\sum_{v} u\left(v, \tau=\sqrt{t^{2}-4 h^{2} / v^{2}}\right)d(h,t)=vu(v,τ=t24h2/v2)
where d ( h , t ) d ( h , t ) d^(')(h,t)d^{\prime}(h, t)d(h,t) represents the modeled CMP gather.
Figure 6.4-2d was obtained by using equation (610a) in which the summation is performed over a finite range of offsets. At first, it appears that by using equation (6-10b), in which the summation is performed over a range of velocities, the original data d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t) in Figure 6.4 2 c 6.4 2 c 6.4-2c6.4-2 c6.42c can be reconstructed from the data in Figure 6.4-2d. The modeled CMP gather d ( h , t ) d ( h , t ) d^(')(h,t)d^{\prime}(h, t)d(h,t) using equation (6-10b) is shown in Figure 6.4-3b. Observe the relative weakening of anplitudes at far offsets, especially along events with large moveout. Repeated transformations using equations ( 6 10 a ) 6 10 a ) 6-10a)6-10 \mathrm{a})610a) and (6-10b) from the velocity domain to the offset domain (Figure 6.4-3) further reduce the amplitudes at far offsets.
Results shown in Figure 6.4-3 demonstrate clearly that the discrete transforms given by equations (6-10a) and (6-10b) are not exact inverses of each other. The discrete summation in equation (6-10a) over a finte range of offets causes mapping of amplitudes along a hyperbolic event in the offset domain (Figure 6.4-2c) to depart from the ideal point in the velocity domain and results in the smearing of amplitudes along the velocity axis (Figure 6.4-2d). Amplitude smearing means the loss of velocity resolution between two events with little moveout difference.
To understand the inverse problem of restoring the data in the offset domain from the data in the velocity domain, consider the integral forms of equations (610a) and (6-10b). Reflection times on a CMP gather associated with a horizontally layered earth model can be represented by a Taylor series of the form t = t = t=t=t= τ + c 1 h 2 + c 2 h 4 + τ + c 1 h 2 + c 2 h 4 + tau+c_(1)h^(2)+c_(2)h^(4)+dots\tau+c_{1} h^{2}+c_{2} h^{4}+\ldotsτ+c1h2+c2h4+, where c 1 , c 2 , c 1 , c 2 , c_(1),c_(2),dotsc_{1}, c_{2}, \ldotsc1,c2, are scalar coefficients (Hubral and Krey, 1980). By including as many terms as desired in the Taylor expansion, the traveltime curve can be expressed by t = τ + ϕ ( v , h ) t = τ + ϕ ( v , h ) t=tau+phi(v,h)t=\tau+\phi(v, h)t=τ+ϕ(v,h). This makes the integral form of equation (6-10a) a special form of the generalized Radon transform (Beylkin, 1987) given by
ψ ( v , τ ) = d [ h , t = τ + ϕ ( v , h ) ] d h . ( 6 11 a ) ψ ( v , τ ) = d [ h , t = τ + ϕ ( v , h ) ] d h . ( 6 11 a ) psi(v,tau)=int_(-oo)^(oo)d[h,t=tau+phi(v,h)]dh.quad(6-11 a)\psi(v, \tau)=\int_{-\infty}^{\infty} d[h, t=\tau+\phi(v, h)] d h . \quad(6-11 a)ψ(v,τ)=d[h,t=τ+ϕ(v,h)]dh.(611a)
Here, the integration is along curves expressed as linear functions of traveltimes, t t ttt and τ τ tau\tauτ. Accordingly, d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t) and its Radon transform u ( v , r ) u ( v , r ) u(v,r)u(v, r)u(v,r) are defined as continvous functions in the offset and velocity domains, respectively.
The integral form of equation (6-10b), however, is not the exact inverse of equation (6-11a). Instead, Radon's inversion formula given by (Beylkin, 1987)
d ( h , t ) = ρ ( τ ) u [ v , τ = t ϕ ( v , h ) ] d v ( 6 11 b ) d ( h , t ) = ρ ( τ ) u [ v , τ = t ϕ ( v , h ) ] d v ( 6 11 b ) d(h,t)=int_(-oo)^(oo)rho(tau)**u[v,tau=t-phi(v,h)]dv(6-11 b)d(h, t)=\int_{-\infty}^{\infty} \rho(\tau) * u[v, \tau=t-\phi(v, h)] d v(6-11 b)d(h,t)=ρ(τ)u[v,τ=tϕ(v,h)]dv(611b)
incorporates convolution of u ( v , τ ) u ( v , τ ) u(v,tau)u(v, \tau)u(v,τ) with the rho filter ρ ( τ ) ρ ( τ ) rho(tau)\rho(\tau)ρ(τ) prior to integration over velocity. In equation (611b), the asterisk denotes convolution. For 2-D data, as for any process that involves summation over a finite spatial aperture (Section 4.1), the rho filter ρ ( τ ) ρ ( τ ) rho(tau)\rho(\tau)ρ(τ) has a Fourier transform of the form ω exp ( i π / 4 ) ω exp ( i π / 4 ) sqrtomegaexp(i pi//4)\sqrt{\omega} \exp (i \pi / 4)ωexp(iπ/4), where ω ω omega\omegaω is the temporal frequency.

The Discrete Radon Transform

In practice, a discrete form of the rho filter ρ ( τ ) ρ ( τ ) rho(tau)\rho(\tau)ρ(τ) can be convolved with the discrete form of u ( v , τ ) u ( v , τ ) u(v,tau)u(v, \tau)u(v,τ) prior to summing over a finite range of velocities to reconstruct the original data d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t). Note that the rho filter is a 1-D filter that operates on each trace of u ( v , τ ) u ( v , τ ) u(v,tau)u(v, \tau)u(v,τ), individually. It cam account for the suppression of high frequencies during summation along discretely sampled traveltime curves, t = τ + ϕ ( v , h ) t = τ + ϕ ( v , h ) t=tau+phi(v,h)t=\tau+\phi(v, h)t=τ+ϕ(v,h). However, one can intuitively contend that the rho filtering alone cannot remove the annplitude smearing along the velocity axis in Figure 6.4 2 d 2 d 2d2 \mathrm{~d}2 d. Based on a rigorous mathematical analysis, Beylkin (1987) showed that a discrete form of Radon's inversion formula (equation 6-11b) can be expressed as a leastsquares solution to a set of linear system of equations. We shall review the discrete Radon transform for the special case of velocity-stack transformation.
To reduce the amplitude smearing on conventional velocity-stack gathers Thorson and Claerbout (1985) proposed a least-squares formulation. There is one issue, however, we must take into consideration before we seek a practical scheme to compute the inverse Radon transform defined by equation (6-11b). To comply with the linear form the Radon transform defined by equation (6-11a), apply stretching in the time direction by setting t = t 2 t = t 2 t^(')=t^(2)t^{\prime}=t^{2}t=t2 and τ = τ 2 τ = τ 2 tau^(')=tau^(2)\tau^{\prime}=\tau^{2}τ=τ2 (Yilmaz, 1989). Equation (6-9b) then takes the form
t = τ + 4 h 2 v 2 t = τ + 4 h 2 v 2 t^(')=tau^(')+(4h^(2))/(v^(2))t^{\prime}=\tau^{\prime}+\frac{4 h^{2}}{v^{2}}t=τ+4h2v2
In the stretched coordinates, equations ( 6 10 a , b ) 6 10 a , b ) 6-10a,b)6-10 \mathrm{a}, \mathrm{b})610a,b) become:
u ( v , τ ) = h d ( h , t = τ + 4 h 2 / v 2 ) u v , τ = h d h , t = τ + 4 h 2 / v 2 u(v,tau^('))=sum_(h)d(h,t^(')=tau^(')+4h^(2)//v^(2))u\left(v, \tau^{\prime}\right)=\sum_{h} d\left(h, t^{\prime}=\tau^{\prime}+4 h^{2} / v^{2}\right)u(v,τ)=hd(h,t=τ+4h2/v2)
and
d ( h , t ) = v u ( v , τ = t 4 h 2 / v 2 ) d h , t = v u v , τ = t 4 h 2 / v 2 d^(')(h,t^('))=sum_(v)u(v,tau^(')=t^(')-4h^(2)//v^(2))d^{\prime}\left(h, t^{\prime}\right)=\sum_{v} u\left(v, \tau^{\prime}=t^{\prime}-4 h^{2} / v^{2}\right)d(h,t)=vu(v,τ=t4h2/v2)
As a result of the t 2 t 2 t^(2)t^{2}t2-stretching, hyperbolic events in the offset domain are transformed to parabolic events described by the traveltime equation (6-12). Note that, unlike the hyperbolic events, the moveout 4 h 2 / v 2 4 h 2 / v 2 4h^(2)//v^(2)4 h^{2} / v^{2}4h2/v2 associated with the parabolic events is time-independent.
The objective is to estimate the transform u ( v , τ ) u v , τ u(v,tau^('))u\left(v, \tau^{\prime}\right)u(v,τ) such that the difference between the actual CMP gather d ( h , t ) d h , t d(h,t^('))d\left(h, t^{\prime}\right)d(h,t) and the modeled CMP gather d ( h , t ) d h , t d^(')(h,t^('))d^{\prime}\left(h, t^{\prime}\right)d(h,t) is minimum in the least-squares sense. A direct solution for u ( u , τ ) u u , τ u(u,tau^('))u\left(u, \tau^{\prime}\right)u(u,τ) requires computing the inverse of a large matrix which may have dimensions of 60000 × 60000 60000 × 60000 60000 xx6000060000 \times 6000060000×60000 for a typical field data set (Section F.3).
To circumvent solving a problem that involves a very large matrix, Fourier transform the CMP gather d ( h , t ) d h , t d(h,t^('))d\left(h, t^{\prime}\right)d(h,t) in the direction of the stretch variable t t t^(')t^{\prime}t. Correspondingly, apply Fourier transform to equation (6-13b) with respect to t t t^(')t^{\prime}t :
d ( h , ω ) = v u ( v , ω ) exp ( i ω 4 h 2 / v 2 ) , ( 6 14 ) d h , ω = v u v , ω exp i ω 4 h 2 / v 2 , ( 6 14 ) d^(')(h,omega^('))=sum_(v)u(v,omega^('))exp(-iomega^(')4h^(2)//v^(2)),quad(6-14)d^{\prime}\left(h, \omega^{\prime}\right)=\sum_{v} u\left(v, \omega^{\prime}\right) \exp \left(-i \omega^{\prime} 4 h^{2} / v^{2}\right), \quad(6-14)d(h,ω)=vu(v,ω)exp(iω4h2/v2),(614)
where ω ω omega^(')\omega^{\prime}ω is the Fourier dual of t t t^(')t^{\prime}t.
For each ω ω omega^(')\omega^{\prime}ω, define d : d ( h , ω ) d : d h , ω d^('):d^(')(h,omega^('))\mathbf{d}^{\prime}: d^{\prime}\left(h, \omega^{\prime}\right)d:d(h,ω) and u : u ( v , ω ) u : u v , ω u:u(v,omega^('))\mathbf{u}: u\left(v, \omega^{\prime}\right)u:u(v,ω) as complex vectors in h h hhh and v v vvv, respectively. Now, consider equation (6-14) in matrix notation:
d = L u . d = L u . d^(')=Lu.\mathrm{d}^{\prime}=\mathbf{L} \mathbf{u} .d=Lu.
The complex matrix L L LLL is given by equation ( F 19 F 19 F-19F-19F19 ) of Section F.3. The complex vectors d d d^(')\mathbf{d}^{\prime}d and u u uuu have lengths n h n h n_(h)n_{h}nh, the number of offsets, and n v n v n_(v)n_{v}nv, the number of constant velocities used in the transform defined by equation (6-14), respectively. The complex matrix L L LLL then has dimensions n k × n y n k × n y n_(k)xxn_(y)n_{k} \times n_{y}nk×ny. For a typical field data set, n h = 60 n h = 60 n_(h)=60n_{h}=60nh=60 and n y = 60 n y = 60 n_(y)=60n_{y}=60ny=60; hence, the complex matrix L L L\mathbf{L}L may have dimensions of 60 × 60 60 × 60 60 xx6060 \times 6060×60. As such, instead of solving one single problem using equation (6-13b) in the stretched time t t t^(')t^{\prime}t domain that involves a very large matrix, we solve n ω n ω n_(omega)n_{\omega}nω problems, where n ω n ω n_(omega)n_{\omega}nω is the number of frequencies ω ω omega^(')\omega^{\prime}ω, in the Fourier transform domain using equation (6-14) involving a small matrix L L LLL of equation (F-19).
We now restate our objective within the context of the matrix equation (6-15): For each ω ω omega^(')\omega^{\prime}ω, estimate the complex vector u : u ( v , ω ) u : u v , ω u:u(v,omega^('))\mathbf{u}: u\left(v, \omega^{\prime}\right)u:u(v,ω) such that the difference e : e ( v , ω ) e v , ω e(v,omega^('))e\left(v, \omega^{\prime}\right)e(v,ω) between the complex vector of the actual CMP gather d : d ( h , ω ) d : d h , ω d:d(h,omega^('))\mathrm{d}: d\left(h, \omega^{\prime}\right)d:d(h,ω) and that of the modeled CMP gather d : d ( h , ω ) d : d h , ω d^('):d^(')(h,omega^('))\mathbf{d}^{\prime}: d^{\prime}\left(h, \omega^{\prime}\right)d:d(h,ω) is minimum in the least-squares sense.
Following Lines and Treitel (1984), the solution for equation (6-15) that minimizes the error vector e e eee in the least-squares sense is derived in Section F. 3 and is given by
u = ( L T L ) 1 L T d u = L T L 1 L T d u=(L^(T**)L)^(-1)L^(T**)d\mathbf{u}=\left(\mathbf{L}^{\mathbf{T} *} \mathbf{L}\right)^{-\mathbf{1}} \mathbf{L}^{\mathbf{T} *} \mathbf{d}u=(LTL)1LTd
where T T TTT denotes transpose of the matrix L L LLL, the aster: isk denotes complex conjugate and ( L T L ) 1 L T L T L 1 L T (L^(T**)L)^(-1)L^(T**)\left(\mathbf{L}^{\mathbf{T} *} \mathbf{L}\right)^{-1} \mathbf{L}^{\mathrm{T} *}(LTL)1LT is the least-squares (also called generalized) inverse of L L L\mathbf{L}L.
Equation (6-16) gives the unconstrained leastsquares solution for u u uuu, which may be unstable if the matrix L T L L T L L^(T**)L\mathbf{L}^{\mathbf{T} *} \mathbf{L}LTL does not have a stable inverse. Stability is attained by constraining the solution, which requires replacing L T L L T L L^(T**)L\mathbf{L}^{\mathbf{T *}} \mathbf{L}LTL in equation (6-16) with L T L + β I , w L T L + β I , w  L^(T**)L+betaI_(", w ")\mathbf{L}^{\mathbf{T} *} \mathbf{L}+\beta \mathbf{I}_{\text {, w }}LTL+βI, w  where β β beta\betaβ is called the damping factor (also called the Lagrange multiplier) and I is the identity matrix (Lines and Treitel, 1984). Also, there can be singularities or near singularities in the matrix L L LLL. This is primarily because of the nonuniqueness of hyperbolic summation paths at and near zero offset, and discrete sampling over a finite range of offsets. The method of singular-value decomposition (SVD) is used to obtain the least-squares solution for u u u\mathbf{u}u of equation (6-16) when the matrix L L L\mathbf{L}L is singular or near singular (Section F.3).
We now outline the velocity-stack processing with reduced amplitude smearing based, on the discrete hyperbolic Radon transform.
(a) Start with a CMP gather, d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t) and apply t 2 t 2 t^(2)t^{2}t2 stretching, d ( h , t = t 2 ) d h , t = t 2 d(h,t^(')=t^(2))d\left(h, t^{\prime}=t^{2}\right)d(h,t=t2).
(b) Fourier transform in the t t t^(')t^{\prime}t direction, d ( h , w ) d h , w d(h,w^('))d\left(h, w^{\prime}\right)d(h,w).
(c) For each ω ω omega^(')\omega^{\prime}ω, set up the L L L\mathbf{L}L matrix (equation F-16) based on the geometry of the CMP gather and solve for u u uuu of equation (6-16) using the singular-value decomposition (Section F.3).
(d) Inverse Fourier transform to get u ( v , τ ) u v , τ u(v,tau^('))u\left(v, \tau^{\prime}\right)u(v,τ).
(e) Undo the t 2 t 2 t^(2)t^{2}t2-stretching to get u ( v , τ ) u ( v , τ ) u(v,tau)u(v, \tau)u(v,τ), the velocitystack gather with reduced amplitude smearing.
(f) Perform a desired operation, such as muting the zone of multiples, in the velocity-stack domain.
(g) Finally, perform inverse mapping back to the offset domain to get the modeled CMP gather d ( h , t ) d ( h , t ) d^(')(h,t)d^{\prime}(h, t)d(h,t) using equation (6-10b). During this inverse mapping, multiples, primaries, or all of the hyperbolic events can be modelcd.
The velocity-stack gather estimated by equation (6-16) as described by the above sequence is one form of the generalized discrete forward Radon transform (Beylkin, 1987).
Recall that the minimum error associated with the least-squares solution is the difference between the actual CMP gather and the modeled CMP gather obtained from inverse mapping from the Radon transform domain back to the offset domain using equation (610b). Since the forward mapping defined by equation (6-10a) involves hyperbolic events, only, from the offset domain to the velocity domain, this difference gather should contain only the nonhyperbolic events, such as random or linear noise, that may be present in the original CMP gather.

The Parabolic Radon Transform

An alternative to stretching in the time direction to attain the linear form of the Radon transform (equations 6-13a,b) is given by Hampson (1986). First, the input CMP gather is NMO corrected using the hyperbolic moveout equation
t n = t 2 4 h 2 v n 2 t n = t 2 4 h 2 v n 2 t_(n)=sqrt(t^(2)-(4h^(2))/(v_(n)^(2)))t_{n}=\sqrt{t^{2}-\frac{4 h^{2}}{v_{n}^{2}}}tn=t24h2vn2
where t n t n t_(n)t_{n}tn is the time after NMO corection, and v n v n v_(n)v_{n}vn is the hyperbolic moveout correction velocity function. Resulting moveouts of the events, which were originally hyperbolic, are now approxmately parabolic:
t n = τ + q h 2 t n = τ + q h 2 t_(n)=tau+qh^(2)t_{n}=\tau+q h^{2}tn=τ+qh2
where τ τ tau\tauτ is the two-way zero-offet time, and q q qqq is the parameter that defines the curvature of the parabola.
In the coordinates of the NMO-corrected gather d ( h , t n ) d h , t n d(h,t_(n))d\left(h, t_{n}\right)d(h,tn), equations ( 6 10 a , b ) ( 6 10 a , b ) (6-10 a,b)(6-10 a, b)(610a,b) take the forms
u ( q , τ ) = h d ( h , t n = τ + q h 2 ) u ( q , τ ) = h d h , t n = τ + q h 2 u(q,tau)=sum_(h)d(h,t_(n)=tau+qh^(2))u(q, \tau)=\sum_{h} d\left(h, t_{n}=\tau+q h^{2}\right)u(q,τ)=hd(h,tn=τ+qh2)
and
d ( h , t n ) = q z ( q , τ = t n q h 2 ) d h , t n = q z q , τ = t n q h 2 d^(')(h,t_(n))=sum_(q)z(q,tau=t_(n)-qh^(2))d^{\prime}\left(h, t_{n}\right)=\sum_{q} z\left(q, \tau=t_{n}-q h^{2}\right)d(h,tn)=qz(q,τ=tnqh2)
The strategy for computing the hyperbolic Radon transform by performing least-squares minimization for each frequency component of the input data in the stretched coordinates also applies to the moveoutcorrected data to compute the parabolic Radon transform. Fourier transform the moveout-corrected CMP gather d ( h , t n ) d h , t n d(h,t_(n))d\left(h, t_{n}\right)d(h,tn) in the direction of the moveout correction time variable t n t n t_(n)t_{n}tn. Correspondingly, apply Fourier transform to equation (6-18b) with respect to t n t n t_(n)t_{n}tn to obtain
d ( h , ω n ) = q u ( q ω n ) exp ( i ω n q h 2 ) d h , ω n = q u q ω n exp i ω n q h 2 d^(')(h,omega_(n))=sum_(q)u(q*omega_(n))exp(-iomega_(n)qh^(2))d^{\prime}\left(h, \omega_{n}\right)=\sum_{q} u\left(q \cdot \omega_{n}\right) \exp \left(-i \omega_{n} q h^{2}\right)d(h,ωn)=qu(qωn)exp(iωnqh2)
where ω n ω n omega_(n)\omega_{n}ωn is the Fourier dual of t n t n t_(n)t_{n}tn.
For each ω n ω n omega_(n)\omega_{n}ωn, define d : d ( h , ω n ) d : d h , ω n d^('):d^(')(h,omega_(n))\mathbf{d}^{\prime}: \boldsymbol{d}^{\prime}\left(h, \omega_{n}\right)d:d(h,ωn) and u : u ( q , ω n ) u : u q , ω n u:u(q,omega_(n))\mathbf{u}: u\left(q, \omega_{n}\right)u:u(q,ωn) as complex vectors in h h hhh and q q qqq, respectively. With the new definitions of d d d^(')\mathrm{d}^{\prime}d and u u u\mathbf{u}u, equation (6-19) can then be pritten in the matrix form of equation (6-15), where L L L\mathbf{L}L now is a complex matrix given by equation (F-29) of Section F.3. The solution that minimizes the leastsquares error vector e: e ( h , ω n ) e h , ω n e(h,omega_(n))e\left(h, \omega_{n}\right)e(h,ωn), now defined in the ω n ω n omega_(n)\omega_{n}ωn domain, accordingly, is given by equation (6-16).
The complex vectors d d d^(')\mathrm{d}^{\prime}d and u u u\mathrm{u}u have lengths n h n h n_(h)n_{h}nh, the number of offsets, and n q n q n_(q)n_{q}nq, the number of constant q q qqq values used in the transform defined by equation (619), respectively. The complex matrix L L L\mathbf{L}L then has dimensions n h × n q n h × n q n_(h)xxn_(q)n_{h} \times n_{q}nh×nq. For a typical field data set, n h = 60 n h = 60 n_(h)=60n_{h}=60nh=60 and n q = 60 n q = 60 n_(q)=60n_{q}=60nq=60; hence, the complex matrix L L LLL may have dimensions of 60 × 60 60 × 60 60 xx6060 \times 6060×60. As for equation (6-13b), instead of solving one single problem using equation (6-18b) in the moveout correction time t t t^(')t^{\prime}t domain that involves a very large matrix, we solve n ω n ω n_(omega)n_{\omega}nω problems, where n ω n ω n_(omega)n_{\omega}nω is the number of frequencies ω n ω n omega_(n)\omega_{n}ωn, in the Fourier transform domain using equation (6-19) involving a small matrix L L L\mathrm{L}L of equation ( F 29 F 29 F-29\mathrm{F}-29F29 ).
We now outline the velocity-stack processing based on the discrete parabolic Radon transform (Hampson, 1986).
(a) Start with a CMP gather, d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t) and apply NMO correction, d ( h , t n ) d h , t n d(h,t_(n))d\left(h, t_{n}\right)d(h,tn).
(b) Fourier transform in the t n t n t_(n)t_{n}tn direction, d ( h , ω n ) d h , ω n d(h,omega_(n))d\left(h, \omega_{n}\right)d(h,ωn).
(c) For each ω n ω n omega_(n)\omega_{n}ωn, set up the L matrix (equation F-29) based on the geometry of the CMP gather and solve for u u u\mathbf{u}u of equation (6-16) using the singular-value decomposition (Section F.3).
(d) Inverse Fourier transform to get u ( q , τ ) u ( q , τ ) u(q,tau)u(q, \tau)u(q,τ), the parabolic Radon transform.
(e) Perform a desired operation, such as muting the zone of multiples, in the parabolic Radon transform domain.
(f) Perform inverse mapping back to the offset domain to get the modeled NMO-corrected CMP gather d ( h , t n ) d h , t n d^(')(h,t_(n))d^{\prime}\left(h, t_{n}\right)d(h,tn). During this inverse mapping, nultiples, primaries, or all of the hyperbolic events can be modeled.
(g) Undo the moveout correction to get the modeled CMP gather d ( h , t ) d ( h , t ) d^(')(h,t)d^{\prime}(h, t)d(h,t).
As events on the NMO-corrected CMP gather deviate from the ideal parabolic form, there can be degradation in the ability to map those events into the Radortransform domain ( q , r ) ( q , r ) (q,r)(q, r)(q,r) (Hampson, 1986). Moreover, stretch muting that is normally required after NMO correction can remove the far-offset data significantly. The t 2 t 2 t^(2)t^{2}t2-stretching circumvents these shortcomings and replaces the moveout correction of the CMP gather. In practice, both hyperbolic and parabolic schemes in various forms are used to attenuate multiples.

Practical Considerations

Figure 6.4-4 shows the modeled CMP gather before and after t 2 t 2 t^(2)t^{2}t2-stretching. Note that the hyperbolas in Figure 6.4-4a are replaced with parabolas in Figure 6.4-4b. The t 2 t 2 t^(2)t^{2}t2-transformation causes compression on data before 1 s s s\mathrm{s}s and stretching on data after 1 s 1 s 1s1 \mathrm{~s}1 s. As mentioned earlier, a nice property of the parabolic moveout is that it is invariant along the axis t = t 2 t = t 2 t^(')=t^(2)t^{\prime}=t^{2}t=t2 for a specific value of velocity (equation 6-12). The sampling rate along the t 2 t 2 t^(2)t^{2}t2-axis was set equal to t / n t t / n t t^(')//n_(t)t^{\prime} / n_{t}t/nt, where n t n t n_(t)n_{t}nt is the number of samples along the t t ttt-axis. There can be a potential problem of aliasing near t = 0 t = 0 t=0t=0t=0, causing frequency distortion for shallow events. This problem can be avoided by finer sampling along the t t t^(')t^{\prime}t-axis.
By using the singular-value decomposition procedure described in Section F.3, we obtain the Radon transform represented by the velocity-stack gather in the stretched coordinates as shown in Figure 6.4-4c. Finally, we undo the stretching to get the Radon transform represented by the velocity-stack gather in Figure 6.4-4c. Compare this with the conventional velocitystack gather in Figure 6.4-2d. Note the significant reduction of amplitude smearing and enhancement of velocity resolution in the velocity-stack gather based on the Radon transform. In particular, multiples and primaries now are clearly distinguishable. Nevertheless, there is some frequency distortion of the wavelet associated with the shallowest event in the Radon transform (Figure 6,4-4d), primarily because of stretching and unstretching.
By using the Radon transform (Figure 6.4-5a), the CMP gather can be faithfully reconstructed (Figure 6.4-5b). Compare the panels in Figure 6.4-5 with those in Figure 6.4-3. Note that, unlike the conventional velocity-stack gather, repeated application of the Radon transformation always reproduces the CMP gather with minimal amplitude distortion (Figures 6.4-5b and 6.45d), with the exception of frequency distortion at the very early times.
To summarize the construction of velocity-stack gathers using the conventional procedure defined by equation (6-10a) and the Radon transform based on equation (6-16), we refer to Figures 6.4-6 and 6.4-7. Starting with the synthetic CMP gather (Figure 6.46 a), we use equation (6-10a) to get the conventional velocity-stack gather (Figure 6.4-6b), and the reconstructed gather from it (Figure 6.5-6c) using equation (6-10b). Again, starting with the same synthetic CMP gather (Figure 6.4-7a), we obtain the velocitystack gather based on the Radon transform (Figure 6.47b) defined by equation (6-16), and the reconstructed gather from it (Figure 6.4-7c) using equation (6-10b). It is important to note that the reconstruction procedure using equation (6-10b) to obtain the modeled CMP gather is the same in both Figures 6.4-6 and 6.4-7. The difference lies in the way the velocity-stack gather is created - the conventional approach causes amplitude
(a)
(b) velocity( k m / s ) k m / s ) km//s)\mathrm{km} / \mathrm{s})km/s)
(c)
(d)
FIG. 6.4-8. (a) The synthetic CMP gather as in Figure 6.4-2c; (b) the same gather with added band-lmited random noise; (c) the conventional velocity-stack gather (b); (d) the discrete Radon transform of (b). Note the improved velocity resolution in (d) as compared to the amplitude smearing in (c).
(a)
(b)
(c)
(d)
FIG. 6.4-9. (a) Velocity-stack gathers associated with the noise-contaminated CMP gather shown in Figure 6.4-8b estimated using β β beta\betaβ factors incorporated into the computation of the discrete Radon transform based on equation (6-16): (a) 0.01 percent, (b) 0.5 percent, (c) 1 percent, and (d) 5 percent.
(a)
(b)
(c)
(d)
FIG. 6.4-10. (a) The modeled CMP gather reconstructed from the velocity-stack gather shown in Figure 6.4-8d; (b) the difference between the modeled CMP gather in (a) and the actual CMP gather in Figure 64-8b; (c) the noise component present in the actual CMP gather in (a); (d) difference between (b) and (c). Ideally, (d) should contain zero amplitudes.
smearing along the velocity axis (Figure 6.4-6c), and the procedure based on the Radon transform reduces this smearing and thus increases the resolution along the velocity axis (Figure 6.47 c 6.47 c 6.47c6.47 \mathrm{c}6.47c ).
Now we examine the performance of the Radon transform in the presence of random noise. Consider the CMP gather in Figure 6.4-8a after the addition of bandlimited random noise that is uncorrelated from trace to trace (Figure 6.4-8b). Figure 6.4-8c shows the conventional velocity-stack gather constructed by using equation (6-10a), and Figure 6.4-8d shows the velocity-stack gather constructed by using the Radon transform based on equation (6-16). When the data are contaminated by noise, choice of the damping factor β β beta\betaβ to stabilize the solution represented by equation (6-16) has a signifcant impact on the quality of the velocity-stack gather. It is important to emphasize that for the velocity-stack construction using the hyperbolic discrete Radon transform, noise is anything but hyperbolic events.
The β β beta\betaβ factor is equivalent to the prewhitening factor in Wiener-Levinson deconvolution. In this regard, the optimum β β beta\betaβ factor depends significantly upon the noise level in the data. Figure 6.4-9 shows estimates of the velocity-stack gathers using four different values of the β β beta\betaβ factor. For the noise-free case (Figure 6.4-7), theoretically, the best choice of β β beta\betaβ should be zero; however, to avoid exaggeration of numerical roundoff errors, β β beta\betaβ should be chosen to be a very small number. A practical rule of thumb is that stability in the SVD procedure does not improve further for β β beta\betaβ factors beyond a certain value (compare Figures 6.4-9c and d). For field data, a value of 1 % 1 % 1%1 \%1% of the largest eigenvalue of the matrix L T L L T L L^(T**)L\mathbf{L}^{\mathbf{T *}} \mathbf{L}LTL of equation (6-16) often yields adequate results (Section F.3).
Since the elements of the matrix L L LLL in equation (6-16) depends on the geometry of the CMP gather under consideration, estimation of the Radon trans-
form u u u\mathbf{u}u would normally require singular-value decomposition (equation F-22) for each individual gather. To circumvent the repeated application of the singular-value decomposition - a numerically intensive scheme, the Radon transform estimation procedure can be made efficient by implementing a two-staged computation. First, the part of the Radon transform associated with the operator L T L T L^(T**)L^{\mathrm{T} *}LT in equation (6-16) can be computed using the actual offset distribution of the input CMP gather. Second, the part of the Radon transform associated with the operator ( L T + L ) 1 L T + L 1 (L^(T+)L)^(-1)\left(\mathrm{L}^{\mathbf{T}+} \mathrm{L}\right)^{-1}(LT+L)1 is computed by the singular-value decomposition only once for the entire data set using an offset distribution that may be considered an acceptable average of the actual offset distributions of the CMP gathers along the line traverse.
Finally, we examine the ability of the Radon transform in separating hyperbolic events from band-limited random noise. Consider the same noisy gather as in Figure 6.4 8 b 6.4 8 b 6.4-8b6.4-8 \mathrm{~b}6.48 b. Reconstruct this CMP gather as shown in Figure 6.4.10a using the velocity-stack gather shown in Figure 6.48 d 6.48 d 6.48d6.48 \mathrm{~d}6.48 d, and subtract the result from the original noisy CMP gather (Figure 6,4-8b). This difference gather is shown in Figure 6.4 1 0 b 6.4 1 0 b 6.410b6.4 \mathbf{1 0 b}6.410b, and it represents the least-squares error e defined as the difference between the actual CMP gather d d ddd and the modeled CMP gather d d d^(')\mathbf{d}^{\prime}d defined by equation (6-15). Ideally, it should contain anything but hyperbolic events. Nevertheless, the missing high-frequency components in the shallowest part of the reconstructed CMP gather have leaked into the difference gather (Figure 6.4-10d). The actual random noise added to the original CMP gather (Figure 6.4-8a) is shown in Figure 6.4-10c. Compare the extracted noise (Figure 6.4-10b) with the actual noise (Figure 6.4-10c) and note that the difference between the two (Figure 6.4 10 d 6.4 10 d 6.4-10 d6.4-10 d6.410d ) contains negligibly small residual amplitudes aside from some remnants of the hyperbolic events.

Impulse Response of the Velocity-Stack Operator

An isolated spike in the offset domain (Figure 6.4-11a) maps to the velocity domain using equation (6-10a) along a curved trajectory (Figure 6.4-12a). Solve equation (6-9b) for v v vvv to obtain the equation for this trajectory in the velocity domain:
v = 2 h t 2 τ 2 v = 2 h t 2 τ 2 v=(2h)/(sqrt(t^(2)-tau^(2)))v=\frac{2 h}{\sqrt{t^{2}-\tau^{2}}}v=2ht2τ2
The curvature is greater for a spike situated at far offset than a spike situated at near offset (Figures 6.4-11b and 6.4-12b). Also, the curvature is greater for a spike situated at an early time on a given offset than a spike situated at a late time on the same offset (Figures 6.4 11 c 11 c 11c11 \mathrm{c}11c and 6.4 12 c 6.4 12 c 6.4-12c6.4-12 \mathrm{c}6.412c ).
Inverse transformation of the conventional velocitystack gathers (Figures 6.4-12a,b,c) back to the offset domain does not reproduce the isolated spikes (Figures 6.4-13a,b,c). Instead, the amplitudes are smeared across each of the CMP gathers. The amplitude smearing is worse for spikes situated at near offsets (Figure 6.4-13b) and late times (Figure 6.4 13 c 6.4 13 c 6.4-13c6.4-13 \mathrm{c}6.413c ).
Figures 6.4 14 a , b , c 6.4 14 a , b , c 6.4-14 a,b,c6.4-14 a, b, c6.414a,b,c show the velocity-stack gathers based on the Radon transform of equation (6-16) associated with the isolated spikes in Figures 6.4-11 a, b, c. Inverse mapping these velocity-stack gathers, in contrast with the results obtained from inverse mapping of the conventional velocity-stack gathers (Figures 6.4 13 a , b , c 13 a , b , c 13 a,b,c13 a, b, c13a,b,c ), yields a fairly good focusing of energy to the isolated spike locations (Figures 6.4-15a,b,c).
How is the velocity-stack processing affected by irregularities in the data? Refer to the CMP gather in Figure 6.411d. It contains a trace with a monofrequency signal, another trace with polarity reversed, a dead trace, and another trace with a dead zone. The conventional velocity-stack gather is shown in Figure 6.4 12 d 6.4 12 d 6.4-12d6.4-12 \mathrm{~d}6.412 d, and the CMP gather reconstructed from it is shown in Figure 6.4-13d. Compare this figure with Figure 6.4-11d and note the differences along the reflection hyperbolas in amplitude and curvature where the anomalous traces are located. Also, note the smearing of the monofrequency signal over a large range of traces away from the original trace location. The velocity-stack gather based on the Radon transform associated with the CMP gather in Figure 6.4-11d is shown in Figure 6.4-14d. The CMP gather reconstructed from it (Figure 6.4-15d) shows less smearing of the monofrequency signal. As with the conventional velocity-stack gather, however, the dead trace and the trace with a dead zone in the original CMP gather (Figure 6.4-11d) again have been replaced with nonzero amplitudes, and traveltimes have been distorted along the reflection hyperbolas where the anomalous traces are located.
The transform paraneters of practical importance are the velocity range and the velocity increment used in constructing velocity-stack gathers. The velocity range should span the velocities associated with primary and multiple reflections. A good practice for the choice of velocity increment is such that the number of traces in velocity space is set equal to the traces in the offset space.

Field Data Examples

We shall now consider field data examples of the Radon transform. Figure 6.4-16a shows a deep-water CMP
(a)
(b)
(c)
(d)
FIG. 6.4-11. Synthetic CMP gathers that contain (a) a single spike; (b) a series of spikes at equal time but at different offsets; (c) a series of spikes at equal offset but at different times; (d) anomalous traces.
(a)
(b)
(c)
(d)
FIG. 6.4-12. Conventional velocity-stack gathers associated with the CMP gathers in Figure 6.4-11.
(a)
(b)
(c)
(d)
FIG. 6.4-13. Reconstructed CMP gathers from the conventional velocity-stack gathers in Figure 6 4-12. Compare with Figure 6.4-11.
(a)
(b)
(c)
(d)
FIG. 6.4-14. Velocity-stack Eathers that represent the Radon transforms of the CMP gathers in Figure 6.4-11. Compare with Figure 6.4-12.
(a)
(b)
(c)
(d)
FIG. 6.4-15. Reconstructed CMP gathers from the proper velocity-stack gathers in Figure 6.4-14. Compare with Figures 6.4-11 and 6.4-13.
gather that contains strong multiples below 3.5 s 3.5 s 3.5s3.5 \mathrm{~s}3.5 s. The conventional velocity-stack gather (Figure 6.4-16b) shows the familiar amplitude smearing, whereas the velocity-stack gather based on the Radon transform (Figure 6.4-16c) shows better focusing of hyperbolic events. The reconstructed CMP gather (Figure 6.4-16d) contains all the hyperbolic events present in the original CMP gather (Figure 6.4-16a) and excludes noise. The amplitudes on the reconstructed CMP gather appear to be faithfully restored to their original values.
A noisier CMP gather from a shallow-water survey is shown in Figure 6.4-17a. Note the strong-amplitude, low-frequency bursts of energy similar to ground roll. A spike in the offset domain maps along a curved trajectory in the velocity domain; the larger the offset and the shallower the time at which this spike is located, the more the curvature of the trajectory (Figures 6.411 through 6.4-15). Note the presence of curved trajectories in the conventional velocity-stack gather in Figure 6.4-17b. Although the velocity-stack gather based on the Radon transform (Figure 6.4-17c) also contains these features, it does not have the amplitude smearing that dominates the conventional velocity-stack gather. The CMP gather reconstructed from the velocity-stack gather shown in Figure 6.4-17c contains all the hyperbolic events and excludes the random noise and coherent noise with linear moveout present in the original CMP gather (compare Figures 6.417a and d).
The result shown in Figure 6.4-17d suggests that velocity-stack transformation, when implemented as a special form of the discrete Radon transform, can be used to attenuate random and coherent linear noise on CMP data (Hampson, 1987).
Another potential application of velocity-stack processing is in the construction of high-resolution constant-velocity stacks. Figure 6.4-18 shows constantvelocity-stack panels constructed from about 100 CMP gathers. These panels were generated twice - by computing conventional velocity-stack gathers and sorting them to CVS panels, and by computing velocity-stack gathere using the Radon transform and sorting the results into CVS panels. The multiples contaminate the primaries on the panels based on conventional velocitystack gathers even though the constant-velocity range used is associated with the primaries. This is because of the lateral smearing of amplitudes associated with multiples and primaries in the velocity space as illustrated in Figure 6.4-2d. The multiples appear to be significantly attenuated on the panels based on the velocity-
(a)

velocity ( k m / s ) ( k m / s ) (km//s)(\mathrm{km} / \mathrm{s})(km/s)

(b)
(c)
(d)
FIG. 6.4-16. (a) A deep-water CMP gather with strong multuples; (b) the conventional velocity-stack gather; (c) the proper velocity-stack gather; (d) the CMP gather reconstructed from (c). Compare with (a) and note the preservation of amplitudes along hyperbolic events. (Data courtesy Norwegian Petroleum Drrectorate.)
(a)
(b)
(c)
(d)
FIG. 6.4-17. (a) A shallow-water CMP gather with strong linear nose; (b) conventıonal velocity-stack gather; (c) proper velocity-stack gather; (d) the CMP gather reconstructed from (c). Compare with (a) and note that hyperbolic events are enhanced, and random and linear noise are suppressed. (Data courtesy Abu Dhabi National Oil Company.)
stack gathers computed by using the Radon transform. The lateral smearing has been reduced in the velocity space by the Radon transform as illustrated in Figure 6.4 4 d 6.4 4 d 6.4-4d6.4-4 d6.44d.

Radon-Transform Multiple Attenuation

Consider the synthetic CMP gather in Figure 6.4-7a and the velocity-stack gather (Figure 6.47 b 6.47 b 6.47b6.47 \mathrm{~b}6.47 b ) estimated from it using the discrete Radon transform. By including the entire velocity-stack gather in the summation in equation (6-10b), we get the fully reconstructed CMP gather shown in Figure 6.47c. That result is reproduced in Figure 6.4-19a. Aside from the loss of high-frequency energy at early times, this modeled CMP gather is a close approximation to the original CMP gather (Figиге 6.4 7 a 6.4 7 a 6.4-7a6.4-7 \mathrm{a}6.47a ).
Instead of including the entire velocity-stack gather (Figure 6.3-15b) in the summation in equation (6-10b), a CMP gather with only multiples (Figure 6.4-19b) or only primaries (Figure 6.4-19c) can be reconstructed by simply assigning suitable pass-reject zones over the velocity-stack gather. Compare the modeled multiplesonly and primaries-only CMP gathers (Figures 6.419b,c) with the actual CMP gathers shown in Figures 6.4-2b,a. (The modeled shallow primary in Figure 6.4-19c corresponds to the primary in Figure 6.4-2b.) It appears that, although insignificant, the multiplesonly gather (Figure 6.4-19b) contains some residual primary energy, and the primaries-only gather (Figure 6.419c) contains some residual multiple energy. In practice, it often is desirable to model the multiples and subtract the result from the actual CMP gather (Hampson, 1986). One reason for this is the necessity to retain in CMP data some of the nonhyperbolic energy, such
FIG. 6.4-18. Constant-velocity-stacks using five constant velocities. Panels in (a) are based on conventional velocity starking and panels in (b) are based on proper velocity stacking using the Radon transform. The constant velocities fall in the range that corresponds to the primary velocity trend. Note the multiple contamination of the panels created from conventional velocity stacking (top).
(a)
(b)
(c)
(d)
FIG. 6.4-19. (a) Reconstruction of the noise free CMP gather in Figure 6.4-7a using (a) the entire velocity-stack gather in Figure 6.4-7b; (b) allowing only the multiple energy; (c) allowing only the primary energy; (d) subtraction of (b) from Figure 6.4 7 a 6.4 7 a 6.4-7a6.4-7 \mathrm{a}6.47a.
(a)
(b)
(c)
(d)
FIG. 6.4-20. Reconstruction of the noisc-contaminated CMP gather in Figure 6.4-8b using (a) the entire velocity-stack gather in Figure 6 4-8d; (b) allowing only the multiple energy; (c) allowing only the primary energy; (d) subtraction of (b) from Figure 6.4-8b. Aside from the muted zone, the noise in the original gather (Figure 6.4-8b) is retamed.
as diffractions. In the present example, Figure 6.4-19d shows the difference between the original CMP gather (Figure 6.4-7a) and the modeled multiples-only CMP gather (Figure 6.4-19b). When compared with Figure 6.4-19c, the subtraction result shown in Figure 6.4-19d shows differences at early times due to the t 2 t 2 t^(2)t^{2}t2-stretching artifacts.
The subtraction actually tends to retain the original texture of the data; this is demonstrated with the noise-contaminated CMP gather in Figure 6.4-8b. U8ing the entire velocity-stack gather (Figure 6.4-8d) associated with this CMP gather, we get the fully reconstructed CMP gather shown in Figure 6.4-20a. Note that this modeled CMP gather is a close approximation to the noise-free CMP gather (Figure 6.4-7a). Also, compare the modeled multiples-only and primaries-only CMP gathers (Figures 6.4-20b,c) with the corresponding results from the noise-free CMP gather (Figures 6.4 19 b , c 6.4 19 b , c 6.4-19b,c6.4-19 \mathrm{~b}, \mathrm{c}6.419 b,c ). Figure 6.4-20d shows the difference between the original CMP gather (Figure 6.4-8b) and the modeled multiples-only CMP gather (Figure 6.4-20b). When compared with Figure 6.4-20c, the subtraction result shown in Figure 6.4-20d retains the original noise component present in the data (Figure 6.4 8 b 6.4 8 b 6.4-8b6.4-8 \mathrm{~b}6.48 b ).
Now consider a field data example for separation of primaries and multiples by the discrete Radon transform. Shown in Figure 6.421 are the deep-water CMP gather, and the reconstructed primaries-only, multiplesonly, and the subtraction gathers. Corresponding velocity spectra in Figure 6.4-22 clearly show that multiples largely have been removed from the input CMP gather. Nevertheless, a complete separation of multiples from primaries is not achievable. As an example, note the residual primary energy especially visible above 4 s s sss in the multiples-only CMP gather (Figure 6.4-21c). Accordingly, the subtraction result (Figure 6.4-21d) inevitably will have some remnant multiple energy. This is especially apparent in the corresponding velocity spectrum (Figure 6.4-22d); note the small coherency peaks in the multiple zone below 4 s 4 s 4s4 \mathrm{~s}4 s.
Since the Radon-transform multiple attenuation using velocity-stack gathers exploits the velocity discrimination between primaries and multiples, it is appropriate to compare the techrique with other methods that also are based on the same criterion. Figure 6.4-23 shows the synthetic CMP gather with multiple attenuation using the Radon transform, model-based (Section 6.1) and frequency-wavenumber filtering (Section 6.2) methods. Note that the model-based method fails to preserve the amplitude characteristics of the input data (Figure 6.4-23c). This is a direct consequence of the problems in creating model traces for multiples as was referred to in Section 6.1. The frequency-wavenumber filtering method has caused attemation of priamries at near offsets an effect similar to inside-trace muting (Figure 6.4-23d). Among the three approaches, the
Radon transform method appears to best preserve amplitude and phase characteristics of the input data (Figure 6.4-23b).
Further comparisons between the three methods based on velocity discrimination can be made using the noise-contaminated CMP gather in Figure 6.4-24. Again, the Radon transform yields the most desirable result. In fact, whenever data, which require multiple attenuation, are used for amplitude inversion to estimate acoustic impedance or amplitude variation with offset (AVO) analysis, the preferred technique for multiple attemuation most often is the Radon transform.
A challenging data example with short-period interbed multiples is shown in Figure 6.4-25. The velocity spectra computed from the original CMP gather (Figure 6.4-25a) and the gather with multiples removed (Figure 6.4-25d) are shown in Figure 6.4-26. Portions of CMP stacked sections with and without velocity-stack processing for multiple suppression are shown in Figure 6.4-27. An important observation in Figure 6.4-27a is the apparent lateral continuity caused by the multiples. This continuity is replaced, in Figure 6.4-27b, with features that are perhaps geologically more detailed and plausable. Note the presence of a subtle structural closure at 1.5 s 1.5 s 1.5s1.5 \mathrm{~s}1.5 s in Figure 6.4-27b; this feature is completely disguised among the multiples in Figure 6.4-27a. Unfortunately, because of the unavailability of well log 1 log 1 log_(1)\log _{1}log1 no definite assessment can be made about the details in the CMP stacked section processed for multiple suppression (Figure 6.4-27b).
We now demonstrate application of the Radon transform to moveout-corrected CMP gathers (Hampson, 1986). Figures 6.4-28 shows a CMP stack without multiple attenuation. Water-bottom and peg-leg multiples dominate the lower half of the sections and interfere with primary reflections of interest. Strong multiple reflections also are seen on the selected CMP gather in Figure 6.4-29a. Most of the multiples water-bottom and the peg-legs associated with the depositional sequence boundary at 2 s 2 s 2s2 \mathrm{~s}2 s, are long-period
Hampson's implementation of the Radon transform requires input CMP gathers to be moveout-corrected using a primary velocity function (Figure 6.4-29b). The aim is to make the moveout of events primaries and multiples, approximately parabolic. Prior to Radon transformation, spatial interpolation of the data may be needed to make the trace interval sufficiently small (Figure 6.4-29c). The Radon transformation itself is done using the moveout at a reference offset, instead of velocity, as the variable for the horizontal axis (Figure 6.4-29d).
Multiple attenuation in the transform domain is achieved by rejecting a zone that includes the primaries
(a)
(b)
(c)
(d)
FIG. 6.4-21. (a) A deep-water CMP gather; (b) full reconstruction from the proper velocity-stack gather; (c) multiples-only reconstruction; (d) difference between (a) and (c). (Data courtesy Abu Dhabi National Oil Company.)
(a)
(b)
(c)
(d)
FIG. 6.4-22. Velocity spectrea associated with the CMP gathers in Figure 6.4-21.
FIG. 6.4-23. (a) Synthetic CMP gather as in Figure 6 4-2c; after multiple attenuation using (b) the Radon transform, (c) the modeling of multiples in t x t x t-xt-xtx domain (Section 6.1), and (d) the f k f k f-kf-kfk method (Section 6.2).
(a)
(b)
(c)
(d)
FIG. 6.4-24. (a) Synthetic CMP gather as in Figure 6.4-2c with added band-limited random noise; after multiple attenuation using (b) the Radon transform, (c) the modeling of multuples in t x t x t-xt-xtx domain (Section 6.1), and (d) the f k f k f-kf-kfk method (Section 6.2).
(a)
(b)
(c)
(d)
FIG. B.4-25. (a) A shallow-water CMP gather; (b) full reconstruction from the proper velocity-stack gather; (c) multiples-only reconstruction; (d) difference between (a) and (c). (Data courtesy Abu Dhabi National Oil Company.)
FIG. 6.4-26. Velocity spectra associated with (a) the CMP gather in Figure 6.425a; (b) the CMP gather in Figure 6 4-25d.
FIG. 6.4-27. (a) A portion of the CMP stacked section associated with the CMP gather in Figure 6.4-25a with short-period multiples; (b) same portion of the CMP stacked section associated with the CMP gather in Figure 6.4-25d with velocity-stack processing for multiple suppression. Note the apparent lateral continuity caused by the short-period multiples in (a); this false continuity is removed in (b), thereby uncovering a probable subtle structural feature at 1.5 s 1.5 s 1.5s1.5 \mathrm{~s}1.5 s below midpoint A. (Data courtesy Abu Dhabi National Oil Company.)
(Figure 6.4-30a). The inverse transform yields the reconstructed gather that contains presumably only multiples (Figure 6.4-30b). Again, to preserve data characteristics, rather than modeling the primaries by reconstruction, it is preferred to model the multiples (Figure 6.4 30 b 6.4 30 b 6.4-30b6.4-30 \mathrm{~b}6.430 b ) and subtract the modeled gather from the original (Figure 6.4-29c). The difference gather should contain the primaries (Figure 6.4-30c). Finally, traces which were generated during trace interpolation (Figure 6.4-29c) are dropped (Figure 6.4-30d). Compare Figure 6.4-30d the gather after multiple atteriuation, with Figure 6.4 29 b 6.4 29 b 6.4-29 b6.4-29 b6.429b - the gather before multiple attenuation. Aside from a residual of the water-bottom multiples, much of the energy associated with multiples has been removed.
Figure 6.4-31 shows the CMP stack after Radontransform multiple attenuation. Note that multiple attenuation has uncovered the primary the event at 3.5 s s sss associated with an unconformity. Multiple attenuation also helps migration to yield an improved image as shown in Figure 6.4-32.

6.6 LINEAR UNCORRELATED NOISE ATTENUATION

Random noise uncorrelated from trace to trace abounds in recorded data and retains its presence at almost all steps in a processing sequence. CMP stacking reduces the uncorrelated noise in the data significantly (Section 1.5). Noise that remains in the stacked data can have adverse effect on reflection continuity.
While time-variant filtering (Section 1.1) reduces noise in the temporal direction, it does not necessarily attenuate the noise uncorrelated from trace to trace. Although a number of multichannel signal enhancement techriques has been practiced, the one that best preserves relative amplitudes and retains the signal character without amplitude distortion is based on spatial prediction filtering invented by Canales (1984). Mathematical details of this uncorrelated noise attenuation technique is provided in Section F.5.
To understand the conceptual basis for spatial prediction filtering, first, recall from Section 2.3 the prediction filtering in the temporal direction. A recorded seismic trace is represented by a time series with two components - a predictable part that relates to the multiple reflections and an unpredictable part that relates to the primary reflections. The prediction process involves estimating some future value of the input series defined by the prediction lag from the past values of the input series. For the prediction process to work on a seismic trace, strictly, it must represent a zero-offset seismogram recorded over a horizontally layered earth so as to preserve periodicity of multiples. Assuming this
(a)
(b)
(c)
(d)
FIG. 6.4-29. (a) A CMP gather associated with the stacked section in Figure 6.4-28; (b) after moveout correction using primary velocities; (c) after trace interpolation using the f x f x f-xf-xfx method (Section G.1); (d) the parabolic Radon transform of (c). Shown beneath each panel is the autocorrelogram.
(a)
(b)
(c)
(d)
FIG. 6.4-30. (a) The Radon transform as in Figure 6.4-29d after muting the primary zone; (b) the reconstructed gather that contains only multiples; (c) the difference gather obtained by subtracting (b) from Figure 6.4-29c; (d) the same gatber as in (c) but retaining every otber trace with offsets as in Figure 6.4-29b. Compare (d) the gather after multiple attenuation. with Figure 6.4 29 b 6.4 29 b 6.4-29b6.4-29 \mathrm{~b}6.429 b - the gather before multiple attenuation.

to be the case, another fundamental assumption in predictive deconvolution is that the reflectivity series that contains the primaries is random. Hence, a prediction filter, when applied to the recorded seismic trace produces an estimate of the predictable part - the multiple reflections. The error in the prediction process then represents the random reflectivity series - the primary reflections.
Now consider the prediction process in the spatial direction. A spatial prediction filter, when applied to a stacked section, produces an estimate of the predictable part - the coherent signal. The error in the prediction process represents the noise uncorrelated from trace to trace. Whereas, the prediction lag for the temporal prediction filter is specified according to the period of the multiples, for the spatial application, a unit prediction lag is used. Since predictive deconvolution with a unit prediction lag is equivalent to spiking deconvolution, a spatial prediction filter is of the form of a spiking deconvolution operator.

Design of Spatial Prediction Filters

Spatially random noise is uncorrelated from trace to trace independent of temporal frequency. Therefore, spatial prediction filters can be conveniently designed and applied in the frequency-space domain. As such, spatial prediction filtering has come to be known in practice by the term f x f x f-xf-xfx deconvolution. While the theoretical review of the filter design and application is provided in Section F.5, below is a step-by-step procedure for f x f x f-xf-xfx deconvolution.
(a) Start with the CMP-stacked section P ( x , t ) P ( x , t ) P(x,t)P(x, t)P(x,t) and apply Fourier transform in the time direction to obtain the complex matrix P ( x , ω ) P ( x , ω ) P(x,omega)P(x, \omega)P(x,ω).
(b) Transpose the complex matrix P ( x , ω ) P ( x , ω ) P(x,omega)P(x, \omega)P(x,ω), so that, for each frequency component, P ( x , ω ) P ( x , ω ) P(x,omega)P(x, \omega)P(x,ω) is represented by the n n nnn-length complex vector P P P\mathbf{P}P : ( P 0 , P 1 , P 2 , , P n 1 ) P 0 , P 1 , P 2 , , P n 1 (P_(0),P_(1),P_(2),dots,P_(n-1))\left(P_{0}, P_{1}, P_{2}, \ldots, P_{n-1}\right)(P0,P1,P2,,Pn1), where n n nnn is the number of traces in the stacked section.
(c) For each frequency w w www within a specified band width, design a complex prediction filter F ( x ) F ( x ) F(x)F(x)F(x) with unit prediction lag (Section F.6) represented by the m m mmm length complex vector F : ( F 0 , F 1 , F 2 , , F m 1 ) F : F 0 , F 1 , F 2 , , F m 1 F:(F_(0),F_(1),F_(2),dots,F_(m-1))\mathbf{F}:\left(F_{0}, F_{1}, F_{2}, \ldots, F_{m-1}\right)F:(F0,F1,F2,,Fm1), where m m mmm is the number of coefficients in the filter.
(d) Apply the complex filter F ( x ) F ( x ) F(x)F(x)F(x) to the input data component P ( x , ω ) P ( x , ω ) P(x,omega)P(x, \omega)P(x,ω).
(e) Repeat steps (c) and (d) for all frequency components within the specified bandwidth, combine the results, and transpose to trace format. (f) Inverse Fourier transform to obtain the filtered stacked section.
In practice, the prediction filter is designed using a group of stacked traces rather than the entire stacked section itself. The filter length m m mmm usually is chosen between 7-21 points, and the typical length n n nnn of the input complex vector P P P\mathbf{P}P is set to ten times the filter length. Starting at one end of the stacked section, say from the left-hand side, the filter is applied to output one predicted sample at ( m + 1 ) ( m + 1 ) (m+1)(m+1)(m+1) st trace for each frequency component. The design gate is then moved one trace to the right by dropping the first trace within the design window on the left and picking up the next trace on the right. The design gate is slid from one end of the section to the other one trace at a time. The prediction filter may be designed and applied in two opposite directions, and the outputs from the two applications may be averaged.

Field Data Examples

Although f x f x f-xf-xfx deconvolution usually is applied to stacked data, it also may be applied to moveoutcorrected common-offset sections or CMP gathers. Figure 6.5-1 shows a CMP-stacked section before and after f x f x f-xf-xfx deconvolution. Both the input and output sections have been displayed using the same display gain. Note the significant reduction of the noise and enhancement of the coherent signal in the section.
A way to assess the effectiveness of noise attenuation is by examining the f k f k f-kf-kfk spectrum of the data before and after f x f x f-xf-xfx deconvolution as shown in Figure 6.5-2. The f k f k f-kf-kfk spectrum of the input section shows that the bandwidth of the data is approximately 10 70 10 70 10-7010-701070 H z H z Hz\mathrm{Hz}Hz. It also shows the presence of random noise in the stacked section which maps over a rectangular area in the f k f k f-kf-kfk plane. Specifically, band-limited random noise contains energy at all wavenumbers for all frequencies within the passband. After f x f x f-xf-xfx deconvolution, note that the energy in the f k f k f-kf-kfk spectrum is limited to the region of coherent signal in the vicinity of the frequency axis.
If a time-variant scaling is applied to the output of f x f x f-xf-xfx deconvolution, the residual noise in the data is boosted. Figure 6.5-3 shows the stacked section as in Figure 6.5-1 after f x f x f-xf-xfx deconvolution and AGC scaling. Compare the sections in Figures 6.5 1 b 6.5 1 b 6.5-1b6.5-1 \mathrm{~b}6.51 b and 6.5 3 b 6.5 3 b 6.5-3b6.5-3 \mathrm{~b}6.53 b and note that A G C A G C AGCA G CAGC has scaled up the random noise. Nevertheless, by comparing sections in Figures 6.5 3 a , b 6.5 3 a , b 6.5-3a,b6.5-3 \mathrm{a}, \mathrm{b}6.53a,b, note that the relative signal-to-noise ratio of the data has increased after f x f x f-xf-xfx deconvolution.
(text continues on p. 976)
FIG. 6.5-1. A CMP-stacked section (a) before, and (b) after f x f x f-xf-xfx deconvolution.
FIG. 6.5-2. The f k f k f-kf-kfk spectra of the stacked section as in Figure 6.5-1 9a) before, and (b) after f x f x f-xf-xfx deconvolution.
FIG. 6.5-3. (a) The CMP-stacked section as in Figure 6.5-1a, and (b) after f x f x f-xf-xfx deconvolution and AGC scaling.
FIG. 6.5-4. A portion of a CMP-stacked section (a) before, and (b) after f x f x f-xf-xfx deconvolution with no addback, (c) the difference between (a) and (b),
FIG. 6.5-5. A portion of a CMP-stacked section (same as in Figure 6.5-4a) (a) before, and (b) after f x f x f-xf-xfx deconvolution with 20 percent add-back, (c) the difference between (a) and (b).
FIG. 6.5-6. A portion of a CMP-stacled section (same as in Figure 6.5-4a) (a) before, and (b) after f x f x f-xf-xfx deconvolution with 40 percent add-back, (c) the difference between (a) and (b).
FIG. 6.5-7. A portion of a CMP-stacked section (same as in Figure 6.5-4a) (a) before, and (b) after f x f x f-xf-xfx deconvolution with 80 percent add-back, (c) the difference between (a) and (b).
a
FIG. 6.5-8. A CMP-stacked section (a) before, and (b) after f x f x f-xf-xfx deconvolution.
FIG. 6.5-9. A CMP-stacked section (a) before, and (b) after f x f x f-xf-xfx deconvolution.
FIG. 6.E-1. Linear events in the p-gather are mapped onto ponts in the x t x t x-tx-txt domain (see Exercise 6-2).
We now test f x f x f-xf-xfx deconvolution for noise attenuation in case of a CMP stack that contains nearhorizontal reflections as shown in Figure 6.5-4a. The section after f x f x f-xf-xfx deconvolution is shown in Figure 6.5 4 b 6.5 4 b 6.5-4b6.5-4 \mathrm{~b}6.54 b, and the difference between the input (Figure 6.5-4a) and the output (Figure 6.5-4b) is shown in Figure 6.5-4c. The difference section represents the error in the prediction process, and as such, it contains the noise uncorrelated from trace to trace. All three sections in Figure 6.5-4 are shown with the same display gain.
Note in the shallow portion of the filtered section in Figure 6.5 4 b 6.5 4 b 6.5-4b6.5-4 \mathrm{~b}6.54 b g.bove 1 s 1 s 1s1 \mathrm{~s}1 s the zipper effect of the coherent linear noise which has remained in the data after stacking. The spatial prediction filter predicts coherent signal which includes primary and multiple reflections, diffractions, and coherent linear noise. Therefore, it should not be surprising to observe a pronounced coherent linear noise trend in the data after f x f x f-xf-xfx deconvolution
To circumvent the smeared appearance of the data after f x f x f-xf-xfx deconvolution, sometimes a portion of the difference section is added back to the output. Figures 6.5 5 , 6.5 6 6.5 5 , 6.5 6 6.5-5,6.5-66.5-5,6.5-66.55,6.56 and 6.5 7 6.5 7 6.5-76.5-76.57 show the results of 20,40 , and 80 percent add-back. As the percent add-back is increased, the texture of the output from f x f x f-xf-xfx deconvolution resembles that of the input section more closely. In practice, typical add-back walue varies between 0 40 0 40 0-400-40040 percent.
Now consider a stacked data set with moderate structural complexity as shown in Figure 6.5-8. Note that a significant portion of the randorn noise has been attenueted by f x f x f-xf-xfx deconvolution, while diffractions at fault locations and reflections heve been preserved.
Finally, Figure 6.5 9 6.5 9 6.5-96.5-96.59 shows a stacked section with a complex structure. Following f x f x f-xf-xfx deconvolution, coherent signal - reflections and diffractions, has largely been preserved. Hence, f x f x f-xf-xfx deconvolution for noise attenuation is a robust process even in the presence of a complex pattern of coherent signal as in Figure 6.59. The epplication of f x f x f-xf-xfx deconvolution to land data from areas with complex structures such as those associated with overthrust tectonics can improve the stack quality significantly. Also, land data from areas with near-surface complexity that causes poor penetration of the source energy inta the subsurface can benefit from application of f x f x f-xf-xfx deconvalution.

EXERCISES

Exercise 6-1. Prove that a hyperbola in the offset domain ( x , t ) ( x , t ) (x,t)(x, t)(x,t) maps onta an ellipse in the slant-stack domain ( τ , p ) ( τ , p ) (tau,p)(\tau, p)(τ,p).
Exercise 6-2. Refer to Figure 6.E-1. What would the t x t x t-xt-xtx domains look like?
Exercise 6-3. Consider constructing the slantstack gather from offset data that consists of a reflection hyperbola. Does equal increment in p p ppp, the ray parameter, cause undersampling or oversampling of the steep dips? Of the gentle dips? What happens when an equal increment in 1 / p 1 / p 1//p1 / p1/p is used? What happens when an equal increment in θ θ theta\thetaθ is used, where θ θ theta\thetaθ is related to p p ppp by p = sin θ / v p = sin θ / v p=sin theta//vp=\sin \theta / vp=sinθ/v ?
Exercise 6-4. Identify event E E EEE in Figure 6.2-1.
Exercise 6-5. What procedure does CMP stacking correspond to in the f k f k f-kf-kfk domain?

Appendix F
MULTICHANNEL FILTERING TECHNIQUES FOR NOISE AND MULTIPLE ATTENUATION

F. 1 Analysis of Guided Waves

Marine data often are contaminated by guided waves that travel horizontally within the water layer or in the layers beneath the water layer. These waves exhibit characteristics that depend on water depth and on the geometry and material properties of the substrata. Modeling these pressure waves traveling within the water layer can lead to a better understanding of certain aspects of the field data and sometimes may even result in inferences about the strata below the water layer.
The well-known normal mode theory provides a way to laterally extrapolate acoustic and elastic waves (Pekeris, 1948; Press and Ewing, 1950). In this section, a normal mode procedure is applied to model shot profiles recorded over a water layer on top of a homogeneous elastic half space. Raypatbs corresponding to multiple reflections, direct arrivals, refracted arrival, and its multiples are included in the normal mode theory.
The seismic waveguide effect of a surface layer is well known. Wave propagation in a surface layer, in particular guided waves, can be described by using the normal mode theory (Pekeris, 1948). Pekeris' model consists of a liquid layer over an acoustic (liquid) half space. More general models, which consist of a liquid layer on top of an elastic half space, were investigated by Press and Ewing (1950). The most complete summary of work in the field in the classic work by Ewing et al. (1957).
Guided waves are dispersive. This means each frequency component travels at a different speed; namely, the horizontal phase velocity. The dispersive character of guided waves is most pronounced in shallow water environments (less than 100 m 100 m 100m100 \mathrm{~m}100 m ). Depending on various waterbottom conditions, such as a mud layer with variable thickness or a hard bottom, the character of these waves may vary from shot to shot (Figure 6.0-3). They also can cuuse linear noise on stacked data (Figure 6.2-8a) and are easily confused with the linear noise that is associated with side scatterers (Figure 6.0-4).
McMechan and Yedin (1981) proposed a way to obtain phase velocity information from field data. Their approach is based on a wavefield transformation. The shot record first is transformed into the slant-stack domain. Fourier transforming (in time) each trace of the slant-stack gather then yields phase velocity as a function of frequency. This two-step process is demonstrated with the field data example in Figure F-1a. Line C C C C CC^(')C C^{\prime}CC refers to the critical angle of propagation with a large reflection energy. To the right of this line is the supercritical propagation. The slant-stack gather is shown in Figure F-1b, and its 1-D amplitude spectrum is shown in Figure F-1c. Note that the horizontal axis in the slant-stack domain is the ray parameter, that is, the inverse of the horizontal phase velocity. Therefore, in Figure F-1c, we see the variation of the horizontal phase velocity as a function of frequency. Each curve corresponds to a particular normal mode propagating in the water layer. The phase velocities of the normal mode components asymptotically approach that of the water velocity v w v w v_(w)v_{w}vw at the high-frequency end of the spectrum.
Consider the recording geometry depicted in Figure F-2 with a source and a receiver cable, and subsurface model that consists of a water layer on top of an elastic half space. The source is at a certain depth below the water surface, so the two raypaths - primary and ghost, must be considered.
FIG. F-1, (a) A shot gather containing the strong reflected and refracted multiples associated with hard water-bottom conditions. Here, C C = C C = CC^(')=C C^{\prime}=CC= critical-angle energy. (b) The slant-stack gather derived from this shot gather. (c) The ω p ω p omega-p\omega-pωp gather derived from the τ p τ p tau-p\tau-pτp gather in panel (b). The inverse of p p ppp is the horizontal phase velocity. This figure demonstrates the dispersive nature of guided waves; that is, phase velocity is a function of frequency for all propagating normal mode components. These modes are represented by the curved trajectories on panel (c).
The normal mode theory of Ewing et al. (1957) provides an analytic expression for phase velocity as a function of frequency (the so-called characteristic equation or dispersion relation) for a given surface-layer madel. The characteristic equation for the geometry in Figure F-2 is given by
tan ( k x H r 1 ) = ρ 2 β 2 4 r 1 ρ 1 c 4 r 2 [ 4 r 2 s 2 ( 1 + s 2 2 ) 2 ] tan k x H r 1 = ρ 2 β 2 4 r 1 ρ 1 c 4 r 2 4 r 2 s 2 1 + s 2 2 2 tan(k_(x)Hr_(1))=(rho_(2)beta_(2)^(4)r_(1))/(rho_(1)c^(4)r_(2))[4r_(2)s_(2)-(1+s_(2)^(2))^(2)]\tan \left(k_{x} H r_{1}\right)=\frac{\rho_{2} \beta_{2}^{4} r_{1}}{\rho_{1} c^{4} r_{2}}\left[4 r_{2} s_{2}-\left(1+s_{2}^{2}\right)^{2}\right]tan(kxHr1)=ρ2β24r1ρ1c4r2[4r2s2(1+s22)2]
where k z k z k_(z)k_{z}kz is the horizantal wavenumber, which is equal to p ω p ω p_(omega)p_{\omega}pω via equation (6-7), H H HHH is water depth, ρ 1 ρ 1 rho_(1)\rho_{1}ρ1 and ρ 2 ρ 2 rho_(2)\rho_{2}ρ2 are the water and substratum densities, respectively, β 2 β 2 beta_(2)\beta_{2}β2 is the S S SSS-wave velocity of the substratum, and c c ccc is the phase velocity of the guided waves in the water layer. Finally, the normalized variables are
r 1 = c 2 α 1 2 1 r 2 = c 2 α 2 2 1 s 2 = c 2 β 2 2 1 r 1 = c 2 α 1 2 1 r 2 = c 2 α 2 2 1 s 2 = c 2 β 2 2 1 {:[r_(1)=sqrt((c^(2))/(alpha_(1)^(2))-1)],[r_(2)=sqrt((c^(2))/(alpha_(2)^(2))-1)],[s_(2)=sqrt((c^(2))/(beta_(2)^(2))-1)]:}\begin{aligned} & r_{1}=\sqrt{\frac{c^{2}}{\alpha_{1}^{2}}-1} \\ & r_{2}=\sqrt{\frac{c^{2}}{\alpha_{2}^{2}}-1} \\ & s_{2}=\sqrt{\frac{c^{2}}{\beta_{2}^{2}}-1} \end{aligned}r1=c2α121r2=c2α221s2=c2β221
FIG, F-2. The geometry for normal-mode modeling of the guided waves illustrated in Figure F-3. Here, S = S = S=S=S= the source, R = R = R=R=R= receivers, h s = h s = h_(s)=h_{s}=hs= source depth, and h r = h r = h_(r)=h_{r}=hr= receiver depth.
where α 1 α 1 alpha_(1)\alpha_{1}α1 is the P P PPP-wave velacity in the water layer and α 2 α 2 alpha_(2)\alpha_{2}α2 is the P P PPP-weve velocity in the substratum. Because of the periodic nature of the tangent, equation ( F 1 F 1 F-1F-1F1 ) has a multiple-valued function on the left side and a single-valued function on the right side. To explicitly state the ambiguity, equation ( F 1 F 1 F-1\mathrm{F}-1F1 ) can be rewritten as
k x H r 1 + n π = tan 1 B k x H r 1 + n π = tan 1 B k_(x)Hr_(1)+n pi=tan^(-1)Bk_{x} H r_{1}+n \pi=\tan ^{-1} BkxHr1+nπ=tan1B
where B B BBB is the right-hand side of equation (F-1), and the integer n = 0 , 1 , 2 , n = 0 , 1 , 2 , n=0,1,2,dotsn=0,1,2, \ldotsn=0,1,2,, defines the mode number. By carefully examining equations (F-1) and (F-3), note that phase velocity c c ccc is a function of frequency ω ω omega\omegaω; hence, guided waves are dispersive. Equation (F-3) yields real values of k x k x k_(x)k_{\mathrm{x}}kx for α 1 c α 2 α 1 c α 2 alpha_(1) <= c <= alpha_(2)\alpha_{1} \leq c \leq \alpha_{2}α1cα2. (Here, we assume thet α 1 < β 2 < α 2 α 1 < β 2 < α 2 alpha_(1) < beta_(2) < alpha_(2)\alpha_{1}<\beta_{2}<\alpha_{2}α1<β2<α2.) Table F-1 gives a summary of the phase-velocity regions and types of rays associated with each region. Note that we get a wide range of wave types propagating each with a certain phase velocity or a range of phase velocities.
Only in the supercritical region, α 1 < c < β 2 α 1 < c < β 2 alpha_(1) < c < beta_(2)\alpha_{1}<c<\beta_{2}α1<c<β2, are waves totally trapped within the water layer. These waves often form the major contribution to normel-mode propagation at longer offsets as in the field date example in Figure F-1a, where the supercritical region is to the right of line C C C C CC^(')C C^{\prime}CC. In the subcritical region, energy leaks into the substratum (thus, the name leaky modes). The contribution of this region to energy arriving at longer offsets is relatively weak.
The recorded pressure wavefield for the supercritical region at various receiver locations (Figure F-2) is given by
P ( x , z = h r , t ) = 4 n d ω { ω 2 A ( ω ) sin ( k x r 1 h g ) sin ( k x r 1 h r ) exp [ i ω ( t x / c ) ] } , ( F 4 ) P x , z = h r , t = 4 n d ω ω 2 A ( ω ) sin k x r 1 h g sin k x r 1 h r exp [ i ω ( t x / c ) ] , ( F 4 ) P(x,z=h_(r),t)=4sum_(n)int d omega{omega^(2)A(omega)sin(k_(x)r_(1)h_(g))sin(k_(x)r_(1)h_(r))exp[i omega(t-x//c)]},quad(F-4)P\left(x, z=h_{r}, t\right)=4 \sum_{n} \int d \omega\left\{\omega^{2} A(\omega) \sin \left(k_{x} r_{1} h_{g}\right) \sin \left(k_{x} r_{1} h_{r}\right) \exp [i \omega(t-x / c)]\right\}, \quad(F-4)P(x,z=hr,t)=4ndω{ω2A(ω)sin(kxr1hg)sin(kxr1hr)exp[iω(tx/c)]},(F4)
where A ( ω ) A ( ω ) A(omega)A(\omega)A(ω) is the amplitude spectrum of the source. Yilmaz (1981) modified this expression to account for the ghost effect. Note that reciprocity is satisfied here - the product of the sinusoidal factors that modulate the source spectrum A ( ω ) A ( ω ) A(omega)A(\omega)A(ω) is unchanged if h r h r h_(r)h_{r}hr and h s h s h_(s)h_{s}hs are interchanged.
Table F-1. Regions of phase velocity and assaciated ray types.
Phase Velocity Ray Type
α 1 < c < α 2 α 1 < c < α 2 alpha_(1) < c < alpha_(2)\alpha_{1}<c<\alpha_{2}α1<c<α2 supercritical P P PPP-waves
β 1 < c < α 2 β 1 < c < α 2 beta_(1) < c < alpha_(2)\beta_{1}<c<\alpha_{2}β1<c<α2 (wide-angle reflections)
supercritical, partially
c > α 2 c > α 2 c > alpha_(2)c>\alpha_{2}c>α2 reflected P P PPP-waves
c = β 2 c = β 2 c=beta_(2)c=\beta_{2}c=β2 subcritical P P PPP-waves
c = α 2 c = α 2 c=alpha_(2)c=\alpha_{2}c=α2 critically refracted S S SSS-wave
critically refracted P P PPP-wave
Phase Velocity Ray Type alpha_(1) < c < alpha_(2) supercritical P-waves beta_(1) < c < alpha_(2) (wide-angle reflections) supercritical, partially c > alpha_(2) reflected P-waves c=beta_(2) subcritical P-waves c=alpha_(2) critically refracted S-wave critically refracted P-wave| Phase Velocity | Ray Type | | :--- | :--- | | $\alpha_{1}<c<\alpha_{2}$ | supercritical $P$-waves | | $\beta_{1}<c<\alpha_{2}$ | (wide-angle reflections) | | | supercritical, partially | | $c>\alpha_{2}$ | reflected $P$-waves | | $c=\beta_{2}$ | subcritical $P$-waves | | $c=\alpha_{2}$ | critically refracted $S$-wave | | | critically refracted $P$-wave |
FIG. F-3. Superposition of all modes in water layers of different thicknesses. The depth model is shown in Figure F-2. Ghost effects are included in the modeling. Refer to the text for description of the labeled events.
We now consider modeling of normel modes using equation (F-4), including the ghost effect, for a range of water depths. The model parameters are: α 1 = 1500 m / s , β 2 = 2 α 1 , α 2 = 1.6 β 2 α 1 = 1500 m / s , β 2 = 2 α 1 , α 2 = 1.6 β 2 alpha_(1)=1500m//s,beta_(2)=2alpha_(1),alpha_(2)=1.6beta_(2)\alpha_{1}=1500 \mathrm{~m} / \mathrm{s}, \beta_{2}=2 \alpha_{1}, \alpha_{2}=1.6 \beta_{2}α1=1500 m/s,β2=2α1,α2=1.6β2, and ρ 2 / ρ 1 = 2.2 ρ 2 / ρ 1 = 2.2 rho_(2)//rho_(1)=2.2\rho_{2} / \rho_{1}=2.2ρ2/ρ1=2.2. All the experimental results represent impulse responses of guided waves that is, A ( ω ) = 1 A ( ω ) = 1 A(omega)=1A(\omega)=1A(ω)=1 in equation (F-4). Guided waves in Figure F-3 manifest themselves with a complex interfering wave pattern at shallow water, then gradually separate into simple waterbottom multiples at increasing water depths. The dispersive character of the guided waves is prominent, especially for shallow water depths. In Figure F-3, the guided waves are simulated in the supercritical region. The elastic substratum, which is equivalent to the hard water-bottom case, supports the early refraction energy RP, its multiple RM, and the reflected water-bottom multiples M1, M2, and M3. The acoustic substratum ( β 2 = 0 β 2 = 0 beta_(2)=0\beta_{2}=0β2=0, equivalent to the soft water-bottom case), yields only the reflected water-battom multiples. Acoustic behavior of the substratum implies that no P P PPP-to- S S SSS canversion occurs. The phase velocity curves in Figure F 4 F 4 F-4\mathrm{F}-4F4 verify the existence of a number of propagating modes for each case. Note the cable truncation effect (CT).

F. 2 Wavefield Extrapolation in the τ p τ p tau-p\tau-pτp Domain

In Section 6.3, we discussed slant-stack transfornation of a wavefield from midpoint-offset to midpoint-ray-parameter coordinates. This transformation is done by applying linear moveout and summing over the offset range for each value of the ray-paramater. From the results in Section D.1, the double square-root operator can be specialized for migration before stack in midpoint-ray-parameter coordinates (Ottolini, 1982). To derive the extrapolation equation in the slant-stack domain, we start with the relationships between the transform-domain variables:
p = sin θ v p = sin θ v p=(sin theta)/(v)p=\frac{\sin \theta}{v}p=sinθv

Phase Veloclty ( k m / s ) k m / s ) km//s)\mathbf{k m} / \mathrm{s})km/s)

FIG. F-4. Phase velocity as a function of frequency for the cases shown in Figure F-3. Here, CT denotes the cable truncation artifact.
and
v k h 2 ω = sin θ v k h 2 ω = sin θ (vk_(h))/(2omega)=sin theta\frac{v k_{h}}{2 \omega}=\sin \thetavkh2ω=sinθ
where k h k h k_(h)k_{h}kh is the offset wavenumber, ω ω omega\omegaω is the temporal frequency, p p ppp is the ray parameter, v v vvv is the propagation velocity, and θ θ theta\thetaθ is the angle of propagation measured from the vertical. The normalized offset wavenumber H H HHH is defined as (Section D.1)
H = v k h 2 ω H = v k h 2 ω H=(vk_(h))/(2omega)H=\frac{v k_{h}}{2 \omega}H=vkh2ω
Combining the relationships given by equations ( F 5 a , b F 5 a , b F-5a,b\mathrm{F}-5 \mathrm{a}, \mathrm{b}F5a,b ) with the definition given by equation (F-5c), we get
H = p v H = p v H=pvH=p vH=pv
We rewrite the double square-root equation from Section D. 1
DSR ( Y , H ) = 1 ( Y + H ) 2 + 1 ( Y H ) 2 , ( F 7 ) DSR ( Y , H ) = 1 ( Y + H ) 2 + 1 ( Y H ) 2 , ( F 7 ) DSR(Y,H)=sqrt(1-(Y+H)^(2))+sqrt(1-(Y-H)^(2)),quad(F-7)\operatorname{DSR}(Y, H)=\sqrt{1-(Y+H)^{2}}+\sqrt{1-(Y-H)^{2}}, \quad(F-7)DSR(Y,H)=1(Y+H)2+1(YH)2,(F7)
and substitute the definition of H H HHH in terms of p p ppp from equation (F-6) to get
D S R ( Y , p v ) = 1 ( Y + p v ) 2 + 1 ( Y ¯ p v ) 2 D S R ( Y , p v ) = 1 ( Y + p v ) 2 + 1 ( Y ¯ p v ) 2 DSR(Y,pv)=sqrt(1-(Y+pv)^(2))+sqrt(1-( bar(Y)-pv)^(2))D S R(Y, p v)=\sqrt{1-(Y+p v)^{2}}+\sqrt{1-(\bar{Y}-p v)^{2}}DSR(Y,pv)=1(Y+pv)2+1(Y¯pv)2
Ottolini (1982) used this operator for migration before stack in midpoint-ray-parameter coordjnates. The procedure is described in Figure F-5.
Clayton and McMechan (1981) adapted equation (F-8) to zero-dip case which is equivalent to setting Y = 0 Y = 0 Y=0Y=0Y=0 :
DSR ( Y = 0 , H = p v ) = 2 1 p 2 v 2 DSR ( Y = 0 , H = p v ) = 2 1 p 2 v 2 DSR(Y=0,H=pv)=2sqrt(1-p^(2)v^(2))\operatorname{DSR}(Y=0, H=p v)=2 \sqrt{1-p^{2} v^{2}}DSR(Y=0,H=pv)=21p2v2
They then used this operator to downward continue refracted waves on CMP or shot gathers The objective of inversion of a refraction profile is to estimate a velocity profile in depth, v ( z ) v ( z ) v(z)v(z)v(z). The procedure is outlined in Figure F-6. The final step yields a profile, P ( p , z ) P ( p , z ) P(p,z)P(p, z)P(p,z), of horizontal phase velocity 1 / p 1 / p 1//p1 / p1/p as a function of depth z z zzz. Two issues must be kept in mind. First, the procedure is based on a layered earth assumption. Second, the procedure requires knowledge of the medium velocity to extrapolate the wavefield in depth. To get around this second problem, the process must be iterated until the phase velocity profile converges to the velocity function used in the extrapolation. It usually takes up to three iterations to achieve convergence.
FIG. F-5. Flowchart for migratıon before stack in mudpoint-ray-parameter coordinates.

F. 3 Mathematical Foundation of the Discrete Radon Transform

The forward Radon transform u ( r , τ ) u ( r , τ ) u(r,tau)u(r, \tau)u(r,τ) of a 2-D continuous function d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t) is given by the integral expression (Beylkin, 1987)
u ( r , τ ) = d [ h , t = τ + ϕ ( r , h ) ] d h u ( r , τ ) = d [ h , t = τ + ϕ ( r , h ) ] d h u(r,tau)=int_(-oo)^(oo)d[h,t=tau+phi(r,h)]dhu(r, \tau)=\int_{-\infty}^{\infty} d[h, t=\tau+\phi(r, h)] d hu(r,τ)=d[h,t=τ+ϕ(r,h)]dh
where h h hhh and t t ttt are the input variables, and r r rrr and τ τ tau\tauτ are the transform variables. The integration is along trajectories expressed as linear functions of traveltimes t t ttt and τ τ tau\tauτ.
The inverse Radon transform given by the integral expression
d ( h , t ) = ρ ( τ ) u [ r , τ = t ϕ ( τ , h ) ] d r ( F 10 b ) d ( h , t ) = ρ ( τ ) u [ r , τ = t ϕ ( τ , h ) ] d r ( F 10 b ) d(h,t)=int_(-oo)^(oo)rho(tau)**u[r,tau=t-phi(tau,h)]dr quad(F-10 b)d(h, t)=\int_{-\infty}^{\infty} \rho(\tau) * u[r, \tau=t-\phi(\tau, h)] d r \quad(F-10 b)d(h,t)=ρ(τ)u[r,τ=tϕ(τ,h)]dr(F10b)
incorporates convolution of u ( r , τ ) u ( r , τ ) u(r,tau)u(r, \tau)u(r,τ) with the rho filter ρ ( τ ) ρ ( τ ) rho(tau)\rho(\tau)ρ(τ) prior to integration. For the 2-D data type d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t), the Fourier transform of the rho filter is of the form ω exp ( i π / 4 ) ω exp ( i π / 4 ) sqrtomegaexp(i pi//4)\sqrt{\omega} \exp (i \pi / 4)ωexp(iπ/4).
In practice, of course, we do not deal with continuous functions; instead, we have discretely sampled data in time and space. So we need to replace the integrals with discrete summations in equations ( F 10 a , b ) ( F 10 a , b ) (F-10a,b)(\mathrm{F}-10 \mathrm{a}, \mathrm{b})(F10a,b). We can use the least-squares technique to compute the discrete
FIG. F-6. Processing flow for inversion of refraction profiles.
Radon transform (Beylkin, 1987) and account for the effects of discrete sampling and finite cable length. We shall consider three different forms of the function ϕ ( r , h ) ϕ ( r , h ) phi(r,h)\phi(r, h)ϕ(r,h) in equation (F-10a) and, accotdingly, define discrete hyperbolic (Thorson and Claerbout, 1985; Yilmaz, 1989; Foster and Mosher, 1992), parabolic (Hampson, 1986), and linear (Thorson and Claerbout, 1985) Radon transforms.
First, we shall discuss the discrete hyperbolic Radon transform. The transform variable r r rrr of the function ϕ ( r , h ) ϕ ( r , h ) phi(r,h)\phi(r, h)ϕ(r,h) in equation ( F 10 a ) F 10 a ) F-10 a)F-10 a)F10a) represents stacking velocity v v vvv. The discrete transformation of the CMP data from the offset domain to the velocity domain is achieved by hyperbolic moveout correction and summing over offset
u ( v , τ ) = h d ( h , t = τ 2 + 4 h 2 / v 2 ) u ( v , τ ) = h d h , t = τ 2 + 4 h 2 / v 2 u(v,tau)=sum_(h)d(h,t=sqrt(tau^(2)+4h^(2)//v^(2)))u(v, \tau)=\sum_{h} d\left(h, t=\sqrt{\tau^{2}+4 h^{2} / v^{2}}\right)u(v,τ)=hd(h,t=τ2+4h2/v2)
where t t ttt is the two-way traveltime, τ τ tau\tauτ is the two-way zero-offset time, and t t ttt is the half-offset. The inverse transform from the velocity domain back to the offset domain is achieved by inverse hyperbolic moveout correction and summing over velocity
d ( h , t ) = v u ( v , τ = t 2 4 h 2 / v 2 ) d ( h , t ) = v u v , τ = t 2 4 h 2 / v 2 d^(')(h,t)=sum_(v)u(v,tau=sqrt(t^(2)-4h^(2)//v^(2)))d^{\prime}(h, t)=\sum_{v} u\left(v, \tau=\sqrt{t^{2}-4 h^{2} / v^{2}}\right)d(h,t)=vu(v,τ=t24h2/v2)
The relationship between ( h , t ) ( h , t ) (h,t)(h, t)(h,t) and ( v , τ ) ( v , τ ) (v,tau)(v, \tau)(v,τ) coordinates is given by the hyperbolic moveout equation:
t 2 = τ 2 + 4 h 2 v 2 t 2 = τ 2 + 4 h 2 v 2 t^(2)=tau^(2)+(4h^(2))/(v^(2))t^{2}=\tau^{2}+\frac{4 h^{2}}{v^{2}}t2=τ2+4h2v2
To comply with the linear form of the Radon transform defined by equation (F-11a), apply stretching in the time direction by setting t = t 2 t = t 2 t^(')=t^(2)t^{\prime}=t^{2}t=t2 and τ = τ 2 τ = τ 2 tau^(')=tau^(2)\tau^{\prime}=\tau^{2}τ=τ2. Equation (F-12a) then takes the form
t = τ + 4 h 2 v 2 t = τ + 4 h 2 v 2 t^(')=tau^(')+(4h^(2))/(v^(2))t^{\prime}=\tau^{\prime}+\frac{4 h^{2}}{v^{2}}t=τ+4h2v2
Also in the stretched coordinates, equations (F-11a,b) take the forms
u ( v , τ ) = h d ( h , t = τ + 4 h 2 / v 2 ) u v , τ = h d h , t = τ + 4 h 2 / v 2 u(v,tau^('))=sum_(h)d(h,t^(')=tau^(')+4h^(2)//v^(2))u\left(v, \tau^{\prime}\right)=\sum_{h} d\left(h, t^{\prime}=\tau^{\prime}+4 h^{2} / v^{2}\right)u(v,τ)=hd(h,t=τ+4h2/v2)
and
d ( h , t ) = v u ( v , τ = t 4 h 2 / v 2 ) d h , t = v u v , τ = t 4 h 2 / v 2 d^(')(h,t^('))=sum_(v)u(v,tau^(')=t^(')-4h^(2)//v^(2))d^{\prime}\left(h, t^{\prime}\right)=\sum_{v} u\left(v, \tau^{\prime}=t^{\prime}-4 h^{2} / v^{2}\right)d(h,t)=vu(v,τ=t4h2/v2)
Now, consider equation ( F 13 b F 13 b F-13b\mathrm{F}-13 \mathrm{~b}F13 b ) in matrix notation:
d = L u . d = L u . d^(')=Lu.\mathbf{d}^{\prime}=\mathbf{L} \mathbf{u} .d=Lu.
The matrix operator L L L\mathrm{L}L maps each point in u : u ( v , τ ) u : u v , τ u:u(v,tau^('))\mathbf{u}: u\left(v, \tau^{\prime}\right)u:u(v,τ) onto a parabola in d : d ( h , t ) d : d h , t d^('):d^(')(h,t^('))\mathbf{d}^{\prime}: d^{\prime}\left(h, t^{\prime}\right)d:d(h,t), the modeled CMP gather in the stretched coordinates.
The objective is to estimate a u : u ( v , τ ) u : u v , τ u:u(v,tau^('))u: u\left(v, \tau^{\prime}\right)u:u(v,τ) such that the difference e : ( h , t ) e : h , t e:(h,t^('))\mathbf{e}:\left(h, t^{\prime}\right)e:(h,t) between the actual CMP gather d : d ( h , t ) d : d h , t d:d(h,t^('))\mathbf{d}: d\left(h, t^{\prime}\right)d:d(h,t) and the modeled CMP gather d : d ( h , t ) d : d h , t d^('):d^(')(h,t^('))\mathbf{d}^{\prime}: d^{\prime}\left(h, t^{\prime}\right)d:d(h,t) is minimum in the least-squares sense. Using the matrix notation and equation (F-14), e e eee is defined as
e = d L u e = d L u e=d-Lu\mathrm{e}=\mathbf{d}-\mathrm{L} \mathbf{u}e=dLu
To distinguish from the conventional velocity-stack gather defined by equation (F-11a) with amplitude smearing, we shall refer to u u uuu in equation ( F 14 ) F 14 ) F-14)F-14)F14) as the Radon transform of d d ddd in the stretched coordinates. By the Radon transform, parabolas in the offset domain ( h , t ) h , t (h,t^('))\left(h, t^{\prime}\right)(h,t) with the stretched coordinate t t t^(')t^{\prime}t (or, equivalently, hyperbolas in the offset domain h , t h , t h,th, th,t ) with the unstretched coordinate t t ttt are represented by points in the velocity domain ( v , τ ) ( v , τ ) (v,tau)(v, \tau)(v,τ).
Following Lines and Treitel (1984), the least-squares solution for equation (F-14) is determined, first, by expressing the cumulative squared error S S SSS as
S = e T e S = e T e S=e^(T)eS=\mathrm{e}^{\mathbf{T}} \mathrm{e}S=eTe
where T T T\mathbf{T}T is for transpose. By substituting for e from equation ( F 15 F 15 F-15F-15F15 ), we get
S = ( d L u ) T ( d L u ) S = ( d L u ) T ( d L u ) S=(d-Lu)^(T)(d-Lu)S=(\mathbf{d}-\mathbf{L u})^{\mathbf{T}}(\mathbf{d}-\mathbf{L} \mathbf{u})S=(dLu)T(dLu)
Minimization of S S SSS with respect to u yields the desired least-squares solution:
u = ( L T L ) 1 L T d u = L T L 1 L T d u=(L^(T)L)^(-1)L^(T)d\mathbf{u}=\left(\mathbf{L}^{\mathbf{T}} \mathbf{L}\right)^{-\mathbf{1}} \mathbf{L}^{\mathbf{T}} \mathrm{d}u=(LTL)1LTd
where T T T\mathbf{T}T denotes transpose of the matrix L L LLL, and ( L T L ) 1 L T L T L 1 L T (L^(T)L)^(-1)L^(T)\left(L^{T} \mathbf{L}\right)^{-\mathbf{1}} \mathbf{L}^{\mathbf{T}}(LTL)1LT is the least-squares (also called generalized) inverse of L L L\mathbf{L}L.
In equation ( F 17 F 17 F-17F-17F17 ) d d ddd is a column vector containing all the data points from the actual CMP gather in the stretched coordinates. Its length is n h n t n h n t n_(h)n_(t)n_{h} n_{t}nhnt, where n h n h n_(h)n_{h}nh is the number of offsets and n t n t n_(t)n_{t}nt is the number of time samples in t t t^(')t^{\prime}t. Also, u u u\mathbf{u}u is a column vector containing all the points from the velocity stack-gather; its length is n v π τ n v π τ n_(v)pi_(tau)n_{v} \pi_{\tau}nvπτ, where n v n v n_(v)n_{v}nv is the number of velocities and n τ n τ n_(tau)n_{\tau}nτ is the number of time samples in τ τ tau^(')\tau^{\prime}τ. The elements of the matrix operator L L L\mathbf{L}L are delta functions in the velocity domain; its dimensions are n h n t × n t n τ n h n t × n t n τ n_(h)n_(t)xxn_(t)n_(tau)n_{h} n_{t} \times n_{t} n_{\tau}nhnt×ntnτ. For a typical field data set, n h = 60 , n t = 1000 n h = 60 , n t = 1000 n_(h)=60,n_(t)=1000n_{h}=60, n_{t}=1000nh=60,nt=1000, n v = 60 n v = 60 n_(v)=60n_{v}=60nv=60 and n τ = 1000 n τ = 1000 n_(tau)=1000n_{\tau}=1000nτ=1000; this implies an L matrix of dimension 60000 × 60000 60000 × 60000 60000 xx6000060000 \times 6000060000×60000.
The minimum error e e e\mathbf{e}e of equation F 15 F 15 F-15\mathrm{F}-15F15 associated with the least-squares solution u u u\mathbf{u}u of equation (F-17) should be interpreted as being the CMP gather that contains only the nonhyperbolic events, such as random or linear noise, that may be present in the original CMP gather d. The velocity-stack gather u u uuu obtained from equation (F-17) is one form of the discrete Radon transform of d (Beylkin, 1987).
Direct solution for u u uuu of cquation (F-17) requircs computing the inverse of the matrix L T L L T L L^(T)LL^{T} \mathbf{L}LTL which may have dimensions of 60000 × 60000 60000 × 60000 60000 xx6000060000 \times 6000060000×60000 for a typical field data set. Inverting such a large matrix is quite impractical. To circumvent solving a problem that involves a very large matrix L L L\mathbf{L}L, Fourier transform the CMP gather d ( h , t ) d h , t d(h,t^('))d\left(h, t^{\prime}\right)d(h,t) in the direction of the stretch variable t t t^(')t^{\prime}t. Correspondingly, apply Fourier transform to equation (F-13b) with respect to t t t^(')t^{\prime}t given by
d ( h , ω ) = v u ( v , ω ) exp ( i ω 4 h 2 / v 2 ) d h , ω = v u v , ω exp i ω 4 h 2 / v 2 d^(')(h,omega^('))=sum_(v)u(v,omega^('))exp(-iomega^(')4h^(2)//v^(2))d^{\prime}\left(h, \omega^{\prime}\right)=\sum_{v} u\left(v, \omega^{\prime}\right) \exp \left(-i \omega^{\prime} 4 h^{2} / v^{2}\right)d(h,ω)=vu(v,ω)exp(iω4h2/v2)
where ω ω omega^(')\omega^{\prime}ω is the Fourier dual of t t t^(')t^{\prime}t. For each ω ω omega^(')\omega^{\prime}ω component of d ( h , ω ) d h , ω d^(')(h,omega^('))d^{\prime}\left(h, \omega^{\prime}\right)d(h,ω) and u ( v , ω ) u v , ω u(v,omega^('))u\left(v, \omega^{\prime}\right)u(v,ω), equation (F-18) can be written in the matrix form of equation (F-15), where L L L\mathbf{L}L now is a complex matrix of the form
L = ( e w ω 4 h 1 2 / v 1 2 e 3 ω 4 h 1 2 / v 2 2 e z ω 4 h 1 2 / v n 2 e i ω 4 h 2 2 / v 1 2 e τ ω 4 h 2 2 / v 2 2 e z ω 4 h 2 2 / v n 2 e i ω 4 h m 2 / v 1 2 e w ω 4 h m 2 / v 2 2 e i ω 4 h m 2 / v η 2 ) L = e w ω 4 h 1 2 / v 1 2 e 3 ω 4 h 1 2 / v 2 2 e z ω 4 h 1 2 / v n 2 e i ω 4 h 2 2 / v 1 2 e τ ω 4 h 2 2 / v 2 2 e z ω 4 h 2 2 / v n 2 e i ω 4 h m 2 / v 1 2 e w ω 4 h m 2 / v 2 2 e i ω 4 h m 2 / v η 2 L=([e^(-womega^(')4h_(1)^(2)//v_(1)^(2)),e^(-3omega^(')4h_(1)^(2)//v_(2)^(2)),cdots,e^(-zomega^(')4h_(1)^(2)//v_(n)^(2))],[e^(-iomega^(')4h_(2)^(2)//v_(1)^(2)),e^(-tauomega^(')4h_(2)^(2)//v_(2)^(2)),cdots,e^(-zomega^(')4h_(2)^(2)//v_(n)^(2))],[vdots,vdots,ddots,vdots],[e^(-iomega^(')4h_(m)^(2)//v_(1)^(2)),e^(-womega^(')4h_(m)^(2)//v_(2)^(2)),cdots,e^(-iomega^(')4h_(m)^(2)//v_(eta)^(2))])\mathbf{L}=\left(\begin{array}{cccc} e^{-w \omega^{\prime} 4 h_{1}^{2} / v_{1}^{2}} & e^{-3 \omega^{\prime} 4 h_{1}^{2} / v_{2}^{2}} & \cdots & e^{-z \omega^{\prime} 4 h_{1}^{2} / v_{n}^{2}} \\ e^{-i \omega^{\prime} 4 h_{2}^{2} / v_{1}^{2}} & e^{-\tau \omega^{\prime} 4 h_{2}^{2} / v_{2}^{2}} & \cdots & e^{-z \omega^{\prime} 4 h_{2}^{2} / v_{n}^{2}} \\ \vdots & \vdots & \ddots & \vdots \\ e^{-i \omega^{\prime} 4 h_{m}^{2} / v_{1}^{2}} & e^{-w \omega^{\prime} 4 h_{m}^{2} / v_{2}^{2}} & \cdots & e^{-i \omega^{\prime} 4 h_{m}^{2} / v_{\eta}^{2}} \end{array}\right)L=(ewω4h12/v12e3ω4h12/v22ezω4h12/vn2eiω4h22/v12eτω4h22/v22ezω4h22/vn2eiω4hm2/v12ewω4hm2/v22eiω4hm2/vη2)
with dimensions m × n = n h × n v m × n = n h × n v m xx n=n_(h)xxn_(v)m \times n=n_{h} \times n_{v}m×n=nh×nv, where n h n h n_(h)n_{h}nh is the number of offsets n v n v n_(v)n_{v}nv is the number of velocities, and d d d^(')\mathbf{d}^{\prime}d and u u u\mathbf{u}u are complex vectors of lengths n h n h n_(h)n_{h}nh and n v n v n_(v)n_{v}nv, respectively. Note that the elements of the L matrix depend on the geometry of the input CMP gather and the range of velocities used in constructing the velocity-stack gather.
We now restate our objective in solving for u u u\mathbf{u}u of the matrix equation ( F 14 F 14 F-14F-14F14 ) within the context of the Fourier transform domain: For each ω ω omega^(')\omega^{\prime}ω, estimate the complex vector u : u ( v , ω ) u : u v , ω u:u(v,omega^('))\mathbf{u}: u\left(v, \omega^{\prime}\right)u:u(v,ω) such that the difference e : e ( v , w ) e : e v , w e:e(v,w^('))e: e\left(v, w^{\prime}\right)e:e(v,w) between the complex vector of the actual CMP gather d : d ( h , ω ) d : d h , ω d:d(h,omega^('))\mathbf{d}: d\left(h, \omega^{\prime}\right)d:d(h,ω) and that of the modeled CMP gather d t : d ( h , ω ) d t : d h , ω d^(t):d^(')(h,omega^('))\mathbf{d}^{t}: d^{\prime}\left(h, \omega^{\prime}\right)dt:d(h,ω) is minimum in the least-squares sense.
As for equation (F-17), follow the steps involving equations (F-14) through (F-16) to derive the least-squares solution in the Fourier transform domain as
u = ( L T L ) 1 L T d u = L T L 1 L T d u=(L^(T**)L)^(-1)L^(T**)d\mathbf{u}=\left(\mathbf{L}^{\mathbf{T} *} \mathbf{L}\right)^{-\mathbf{1}} \mathbf{L}^{\mathbf{T} *} \mathbf{d}u=(LTL)1LTd
where the asterisk denotes complex conjugate.
Equation (F-20) gives the unconstrained least-squares solution for u u u\mathbf{u}u. To avoid singularities or near singularities in the matrix L T L L T L L^(T**)L\mathbf{L}^{\mathbf{T} *} \mathrm{~L}LT L, the solution is constrained by incorporating a damping
factor β β beta\betaβ (also called the Lagrange multıplier) into equation (F-20) (Lines and Treitel, 1984):
u = ( L T L + β I ) 1 L T d u = L T L + β I 1 L T d u=(L^(T**)L+betaI)^(-1)L^(T**)d\mathbf{u}=\left(\mathbf{L}^{\mathbf{T} *} \mathbf{L}+\beta \mathbf{I}\right)^{-\mathbf{1}} \mathbf{L}^{\mathbf{T} *} \mathbf{d}u=(LTL+βI)1LTd
Because of the near-singular character of the complex matrix L L LLL, especially for small values of ω ω omega^(')\omega^{\prime}ω, the solution given by equation (F-21) is best reformulated in terms of the singular-value decomposition (SVD) of the matrix L (Press et al., 1986). This procedure factors L L L\mathbf{L}L into a product of three matrices:
L = U Λ V T L = U Λ V T L=ULambdaV^(T**)\mathbf{L}=\mathbf{U} \boldsymbol{\Lambda} \mathbf{V}^{\mathbf{T} *}L=UΛVT
By using this factorized form of the matrix L L LLL, the constrained solution given by equation ( F 21 F 21 F-21F-21F21 ) takes the form
u = V [ ( Λ 2 + β I ) 1 Λ ] U T d u = V Λ 2 + β I 1 Λ U T d u=V[(Lambda^(2)+betaI)^(-1)Lambda]U^(T**)d\mathbf{u}=\mathbf{V}\left[\left(\boldsymbol{\Lambda}^{2}+\beta \mathbf{I}\right)^{-\mathbf{1}} \mathbf{\Lambda}\right] \mathbf{U}^{\mathrm{T} *} \mathbf{d}u=V[(Λ2+βI)1Λ]UTd
where
( Λ 2 + β I ) 1 Λ = ( Γ 1 0 0 0 Γ 2 0 0 0 Γ t 2 ) Λ 2 + β I 1 Λ = Γ 1 0 0 0 Γ 2 0 0 0 Γ t 2 (Lambda^(2)+betaI)^(-1)Lambda=([Gamma_(1),0,dots,0],[0,Gamma_(2),dots,0],[vdots,vdots,ddots,vdots],[0,0,dots,Gamma_(t_(2))])\left(\mathbf{\Lambda}^{\mathbf{2}}+\beta \mathbf{I}\right)^{-\mathbf{1}} \boldsymbol{\Lambda}=\left(\begin{array}{cccc} \Gamma_{1} & 0 & \ldots & 0 \\ 0 & \Gamma_{2} & \ldots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \ldots & \Gamma_{\mathrm{t}_{2}} \end{array}\right)(Λ2+βI)1Λ=(Γ1000Γ2000Γt2)
and Γ 4 = λ t / ( λ s 2 + β ) Γ 4 = λ t / λ s 2 + β Gamma_(4)=lambda_(t)//(lambda_(s)^(2)+beta)\Gamma_{4}=\lambda_{t} /\left(\lambda_{s}^{2}+\beta\right)Γ4=λt/(λs2+β), with λ 2 λ 2 lambda_(2)\lambda_{2}λ2 as the positive square roots of the eigenvalues λ t 2 λ t 2 lambda_(t)^(2)\lambda_{t}^{2}λt2 of L T L L T L L^(T)LL^{T} LLTL. Recall that the damping factor β β beta\betaβ is a scalar that prevents the solution (equation F-23) from becoming unstable.
We now summarize the method for computing the Radon transform represented by a velocity-stack gather:
(1) Start with a CMP gather d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t) and apply the t 2 t 2 t^(2)t^{2}t2-strctching, d ( h , t = t 2 ) d h , t = t 2 d(h,t^(')=t^(2))d\left(h, t^{\prime}=t^{2}\right)d(h,t=t2).
(2) Fourier transform in the t t t^(')t^{\prime}t direction, d ( h , ω ) d h , ω d(h,omega^('))d\left(h, \omega^{\prime}\right)d(h,ω).
(3) For a specific value of ω ω omega^(')\omega^{\prime}ω :
(a) Set up the L L L\mathbf{L}L matrix (equation F-19) based on the geometry of the CMP gather.
(b) Set up the d d d\mathbf{d}d vector by transposing the data set d ( h , ω ) d h , ω d(h,omega^('))d\left(h, \omega^{\prime}\right)d(h,ω).
(c) Apply singular-value decomposition to L L L\mathbf{L}L equation (F-22), and compute U , A U , A U,AU, \boldsymbol{A}U,A and V T V T V^(T**)\mathrm{V}^{\mathrm{T} *}VT, hence U T U T U^(T**)\mathrm{U}^{\mathbf{T *}}UT and V V V\mathrm{V}V.
(d) Specify a value for the damping factor β β beta\betaβ and set up the diagonal matrix of equation (F-24).
(e) Finally, solve for u u u\mathbf{u}u (equation F F F\mathbf{F}F-23).
(f) Repeat (3) for all ω ω omega^(')\omega^{\prime}ω values and accumulate the results in u ( v , ω ) u v , ω u(v,omega^('))u\left(v, \omega^{\prime}\right)u(v,ω).
(4) Inverse Fourier transform to get u ( v , τ ) u v , τ u(v,tau^('))u\left(v, \tau^{\prime}\right)u(v,τ).
(5) Undo the t 2 t 2 t^(2)t^{2}t2-stretching to get u ( v , τ ) u ( v , τ ) u(v,tau)u(v, \tau)u(v,τ); this is the desired result, namely the velocity-stack gather with reduced amplitude smearing, which is a special form of the discrete Radon transform of d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t)
(6) The inverse mapping back to the offset domain to get the modeled CMP gather is done using equation ( F 11 b F 11 b F-11b\mathrm{F}-11 \mathrm{~b}F11 b ).
An important practical question is the sampling along the velocity axis in the transform domain. Specifically, in equation (F-19), one may consider sampling in terms of Δ v Δ v Delta v\Delta vΔv or 1 / Δ v 2 1 / Δ v 2 1//Deltav^(2)1 / \Delta v^{2}1/Δv2. This will affect the quality of the velocity stack gather and the reconstructed gather. When 1 / Δ v 2 1 / Δ v 2 1//Deltav^(2)1 / \Delta v^{2}1/Δv2 sampling is used, the structure of the L L L\mathrm{L}L matrix in equation (F-19) becomes Toeplitz (Kostov, 1990). Hence, one can use Levinson recursion to solve equation (F-20) and thus obtain the Radon transform u u uuu.
Figure F-7 shows a comparison of the performance of the various solutions to equation (F-20). The input is a synthetic CMP gather with band-limited noise. The velocity-stack gather was computed using the SVD approach described here with Δ v Δ v Delta v\Delta vΔv and 1 / Δ v 2 1 / Δ v 2 1//Deltav^(2)1 / \Delta v^{2}1/Δv2 sampling criteria
FIG. F-7. Solutions to equation (F-20) using SVD and Toeplitz procedures with two different sampling criteria Δ v Δ v Delta v\Delta vΔv and 1 / Δ v 2 1 / Δ v 2 1//Deltav^(2)1 / \Delta v^{2}1/Δv2. (a) A synthetic CMP gather as in Figure 64 2 c 64 2 c 64-2c64-2 c642c with band-limited noise; (b), (c) and (d) the velocity-stack gathers using three combinations of sampling and procedure as indicated on top of each panel, and (e), (f) and (g) reconstructed gathers from (b), (c) and (d), respectively.
and the Toeplitz solution with the 1 / Δ v 2 1 / Δ v 2 1//Deltav^(2)1 / \Delta v^{2}1/Δv2 sampling criterion. Figure F-7 also shows the reconstructed gathers using equation (F-11b). Results indicate that the SVD approach with the Δ v Δ v Delta v\Delta vΔv sampling criterion best preserves the amplitudes at all offsets. The 1 / Δ v 2 1 / Δ v 2 1//Deltav^(2)1 / \Delta v^{2}1/Δv2 sampling causes loss of amplitudes at near offsets.
We now set up the least-squares problem to perform the discrete parabolic Radon transform (Hampson, 1986, 1987). As an alternative to stretching in the time direction as defined by equation (F-12b) to comply with the linear form of the Radon transform (equation F-1la), consider the application of normal moveout correction to input CMP data (equation F-12a) using a velocity function v n v n v_(n)v_{n}vn :
t n = t 2 4 h 2 v n 2 t n = t 2 4 h 2 v n 2 t_(n)=sqrt(t^(2)-(4h^(2))/(v_(n)^(2)))t_{n}=\sqrt{t^{2}-\frac{4 h^{2}}{v_{n}^{2}}}tn=t24h2vn2
such that hyperbolic events in the original gather d ( h , t ) d ( h , t ) d(h,t)d(h, t)d(h,t) can be approximately represented by parabolic events with the traveltime equation
t n = τ + q h 2 t n = τ + q h 2 t_(n)=tau+qh^(2)t_{n}=\tau+q h^{2}tn=τ+qh2
where t n t n t_(n)t_{n}tn is the time after NMO corection, v n v n v_(n)v_{n}vn is the hyperbolic moveout correction velocity function, τ τ tau\tauτ is the two-way zero-ofset time, and q q qqq is the parameter that defines the curvature of the parabolic trajectory described by equation ( F 26 F 26 F-26\mathbf{F}-26F26 ).
In the coordinates of the NMO-corrected gather d ( h , t n ) d h , t n d(h,t_(n))d\left(h, t_{n}\right)d(h,tn), equations (F-11a, b) take the forms
u ( g , τ ) = h d ( h , t n = τ + q h 2 ) u ( g , τ ) = h d h , t n = τ + q h 2 u(g,tau)=sum_(h)d(h,t_(n)=tau+qh^(2))u(g, \tau)=\sum_{h} d\left(h, t_{n}=\tau+q h^{2}\right)u(g,τ)=hd(h,tn=τ+qh2)
and
d ( h , t n ) = q u ( q , τ = t n q h 2 ) d h , t n = q u q , τ = t n q h 2 d^(')(h,t_(n))=sum_(q)u(q,tau=t_(n)-qh^(2))d^{\prime}\left(h, t_{n}\right)=\sum_{q} u\left(q, \tau=t_{n}-q h^{2}\right)d(h,tn)=qu(q,τ=tnqh2)
We want to find an estimate of u u u\mathbf{u}u such that when inverse transformed, the difference between the modeled moveout-corrected CMP gather d ( h 1 , t n ) d h 1 , t n d^(')(h_(1),t_(n))d^{\prime}\left(h_{1}, t_{n}\right)d(h1,tn) and the original moveout-corrected CMP gather d ( h , t n ) d h , t n d(h,t_(n))d\left(h, t_{n}\right)d(h,tn), which is the desired output, is minimum in the least-squares sense.
A practical estimation of u u uuu based on the least-squares scheme can be achieved, again, by first Fourier transforming equation (F-26b) as
d ( h , ω n ) = q u ( q , ω n ) exp ( w n g h 2 ) d h , ω n = q u q , ω n exp w n g h 2 d^(')(h,omega_(n))=sum_(q)u(q,omega_(n))exp(-w_(n)gh^(2))d^{\prime}\left(h, \omega_{n}\right)=\sum_{q} u\left(q, \omega_{n}\right) \exp \left(-w_{n} g h^{2}\right)d(h,ωn)=qu(q,ωn)exp(wngh2)
where ω n ω n omega_(n)\omega_{n}ωn is the Fourier dual of t n t n t_(n)t_{n}tn. For each ω n ω n omega_(n)\omega_{n}ωn component of d ( h , ω n ) d h , ω n d^(')(h,omega_(n))d^{\prime}\left(h, \omega_{n}\right)d(h,ωn) and u ( q , ω n ) u q , ω n u(q,omega_(n))u\left(q, \omega_{n}\right)u(q,ωn), equation (F-28) can be written in the matrix form of equation (F-14), where L L L\mathbf{L}L is a complex matrix of the form:
L = ( e ω n q 1 h 1 2 e ω r q 2 h 1 2 e ω n q n h 1 2 e 2 ω n q 2 h 2 2 e ı ω n q 2 h 2 2 e ω n q n h 2 2 e ı ω 4 q 1 h m 2 e ı ω n q 2 h t n 2 e τ ω n ψ n h m n 2 ) L = e ω n q 1 h 1 2 e ω r q 2 h 1 2 e ω n q n h 1 2 e 2 ω n q 2 h 2 2 e ı ω n q 2 h 2 2 e ω n q n h 2 2 e ı ω 4 q 1 h m 2 e ı ω n q 2 h t n 2 e τ ω n ψ n h m n 2 L=([e^(-℧omega_(n)q_(1)h_(1)^(2)),e^(-℧omega_(r)q_(2)h_(1)^(2)),dots,e^(-omega_(n)q_(n)h_(1)^(2))],[e^(-2omega_(n)q_(2)h_(2)^(2)),e^(-ıomega_(n)q_(2)h_(2)^(2)),cdots,e^(-omega_(n)q_(n)h_(2)^(2))],[vdots,vdots,ddots,vdots],[e^(-ıomega_(4)q_(1)h_(m)^(2)),e^(-ıomega_(n)q_(2)h_(tn)^(2)),cdots,e^(-tauomega_(n)psi_(n)h_(mn)^(2))])\mathrm{L}=\left(\begin{array}{cccc} e^{-\mho \omega_{n} q_{1} h_{1}^{2}} & e^{-\mho \omega_{r} q_{2} h_{1}^{2}} & \ldots & e^{-\omega_{n} q_{n} h_{1}^{2}} \\ e^{-2 \omega_{n} q_{2} h_{2}^{2}} & e^{-\imath \omega_{n} q_{2} h_{2}^{2}} & \cdots & e^{-\omega_{n} q_{n} h_{2}^{2}} \\ \vdots & \vdots & \ddots & \vdots \\ e^{-\imath \omega_{4} q_{1} h_{m}^{2}} & e^{-\imath \omega_{n} q_{2} h_{t n}^{2}} & \cdots & e^{-\tau \omega_{n} \psi_{n} h_{m n}^{2}} \end{array}\right)L=(eωnq1h12eωrq2h12eωnqnh12e2ωnq2h22eıωnq2h22eωnqnh22eıω4q1hm2eıωnq2htn2eτωnψnhmn2)
with dimensions m × n = n h × n q m × n = n h × n q m xx n=n_(h)xxn_(q)m \times n=n_{h} \times n_{q}m×n=nh×nq, where n h n h n_(h)n_{h}nh is the number of offsets, and n q n q n_(q)n_{q}nq is the number of q q qqq parameters for which the Radon transform u ( q , τ ) u ( q , τ ) u(q,tau)u(q, \tau)u(q,τ) is to be estimated. As for the hyperbolic Radon transform (equation F-19), note that the elements of the L L LLL matrix depend only on the geometry of the input CMP gather.
Aside from the L L L\mathbf{L}L matrix, for each frequency component ω n ω n omega_(n)\omega_{n}ωn, define the vectors for the input gather d : d ( h , t ) d : d ( h , t ) d:d(h,t)\mathbf{d}: d(h, t)d:d(h,t), the unknown transform u : u ( q , τ ) u : u ( q , τ ) u:u(q,tau)\mathbf{u}: u(q, \tau)u:u(q,τ), and the modeled CMP gather d : d ( h , t ) d : d ( h , t ) d^('):d^(')(h,t)\mathrm{d}^{\prime}: d^{\prime}(h, t)d:d(h,t), As for equation ( F 18 F 18 F-18F-18F18 ), for each frequency component ω n ω n omega_(n)\omega_{n}ωn, equation ( F 28 ) F 28 {:F-28)\left.F-28\right)F28) is written in the matrix form of equation (F-14), where L L LLL is the complex matrix given by equation (F-29). Using this new form of the L L LLL matrix, follow the same procedure starting with equation (F-20) to obtain the solution expressed by equation (F-23).
Finally, we set up the least-squares problem to perform the discrete linear Radon transform. The transform variable r r rrr of the function ϕ ( r , h ) ϕ ( r , h ) phi(r,h)\phi(r, h)ϕ(r,h) in equation (F-11a) represents the ray parameter p p ppp. The relationship between ( h , t ) ( h , t ) (h,t)(h, t)(h,t) and ( p , τ ) ( p , τ ) (p,tau)(p, \tau)(p,τ) coordinates is given by the parabolic moveout equation
t = τ + 2 p h t = τ + 2 p h t=tau+2pht=\tau+2 p ht=τ+2ph
The transformation of the CMP data from the offset domain to the ray-parameter domain is achieved by applying linear moveout correction and summing over offset
u ( p , τ ) = h d ( h , t = τ + 2 p h ) u ( p , τ ) = h d ( h , t = τ + 2 p h ) u(p,tau)=sum_(h)d(h,t=tau+2ph)u(p, \tau)=\sum_{h} d(h, t=\tau+2 p h)u(p,τ)=hd(h,t=τ+2ph)
where t t ttt is the two-way traveltime, τ τ tau\tauτ is the intercept time at p = 0 p = 0 p=0p=0p=0, and h h hhh is the half-ofset. The inverse transform from the ray-parameter domain back to the offset domain is achieved by inverse linear moveout correction and summing over velocity
d ( h , t ) = p u ( v , τ = t 2 p h ) d ( h , t ) = p u ( v , τ = t 2 p h ) d^(')(h,t)=sum_(p)u(v,tau=t-2ph)d^{\prime}(h, t)=\sum_{p} u(v, \tau=t-2 p h)d(h,t)=pu(v,τ=t2ph)
We want to estimate u : u ( p , τ ) u : u ( p , τ ) u:u(p,tau)\mathbf{u}: u(p, \tau)u:u(p,τ) such that when inverse transformed back to the offset domain, the difference between the modeled CMP gather d : d ( h , t ) d : d ( h , t ) d^('):d^(')(h,t)\mathbf{d}^{\prime}: d^{\prime}(h, t)d:d(h,t) and the original CMP gather d : d ( h , t ) d : d ( h , t ) d:d(h,t)\mathbf{d}: d(h, t)d:d(h,t) is minimum in the least-squares sense.
A practical estimation of u u u\mathbf{u}u based on the least-squares scheme can be achieved, once again, by first Fourier transforming equation (F-31b) as
d ( h , ω ) = p u ( p , ω ) exp ( i ω 2 p h ) d ( h , ω ) = p u ( p , ω ) exp ( i ω 2 p h ) d^(')(h,omega)=sum_(p)u(p,omega)exp(-i omega2ph)d^{\prime}(h, \omega)=\sum_{p} u(p, \omega) \exp (-i \omega 2 p h)d(h,ω)=pu(p,ω)exp(iω2ph)
For each ω ω omega\omegaω component of d ( h , ω ) d ( h , ω ) d^(')(h,omega)d^{\prime}(h, \omega)d(h,ω) and u ( p , ω ) u ( p , ω ) u(p,omega)u(p, \omega)u(p,ω), equation (F-32) can be written in the matrix form of equation ( F 14 F 14 F-14F-14F14 ), where L L LLL is a complex matrix of the form
L = ( e v ω 2 p 1 h t e ω ω 2 p 2 h 1 e v ω 2 p 1 h 1 e v ω 2 p 1 h 2 e ω 22 p 2 h 2 e ω ω 2 p 2 h 2 e ı ω 2 p 1 h m e τ ω 2 p 2 h m e i ω 2 p n h m ) L = e v ω 2 p 1 h t e ω ω 2 p 2 h 1 e v ω 2 p 1 h 1 e v ω 2 p 1 h 2 e ω 22 p 2 h 2 e ω ω 2 p 2 h 2 e ı ω 2 p 1 h m e τ ω 2 p 2 h m e i ω 2 p n h m L=([e^(-v omega2p_(1)h_(t)),e^(-omega omega2p_(2)h_(1)),cdots,e^(-v omega2p_(1)h_(1))],[e^(-v omega2p_(1)h_(2)),e^(-omega22p_(2)h_(2)),cdots,e^(-omega omega2p_(2)h_(2))],[vdots,vdots,ddots,vdots],[e^(-ıomega2p_(1)h_(m)),e^(-tau omega2p_(2)h_(m)),cdots,e^(-i omega2p_(n)h_(m))])\mathbf{L}=\left(\begin{array}{cccc} e^{-v \omega 2 p_{1} h_{t}} & e^{-\omega \omega 2 p_{2} h_{1}} & \cdots & e^{-v \omega 2 p_{1} h_{1}} \\ e^{-v \omega 2 p_{1} h_{2}} & e^{-\omega 22 p_{2} h_{2}} & \cdots & e^{-\omega \omega 2 p_{2} h_{2}} \\ \vdots & \vdots & \ddots & \vdots \\ e^{-\imath \omega 2 p_{1} h_{m}} & e^{-\tau \omega 2 p_{2} h_{m}} & \cdots & e^{-i \omega 2 p_{n} h_{m}} \end{array}\right)L=(evω2p1hteωω2p2h1evω2p1h1evω2p1h2eω22p2h2eωω2p2h2eıω2p1hmeτω2p2hmeiω2pnhm)
with dimensions m × n = n h × n p m × n = n h × n p m xx n=n_(h)xxn_(p)m \times n=n_{h} \times n_{p}m×n=nh×np, where n h n h n_(h)n_{h}nh is the number of offsets, and n p n p n_(p)n_{p}np is the number of ray parameters p p ppp for which the Radon transform u ( p , τ ) u ( p , τ ) u(p,tau)u(p, \tau)u(p,τ) is to be estimated. As for the hyperbolic and parabolic cases, the elements of the L L L\mathbf{L}L matrix depend only on the geometry of the input CMP gather.
Aside from the L L L\mathbf{L}L matrix, for each frequency component ω ω omega\omegaω, define the vectors for the input gather d : d ( h , t ) d : d ( h , t ) d:d(h,t)\mathbf{d}: d(h, t)d:d(h,t), the unknown transform u : u ( p , τ ) u : u ( p , τ ) u:u(p,tau)\mathbf{u}: u(p, \tau)u:u(p,τ), and the modeled CMP gather d : d ( h , t ) d : d ( h , t ) d^('):d^(')(h,t)\mathbf{d}^{\prime}: d^{\prime}(h, t)d:d(h,t). As for the hyperbolic and parabolic cases, for each frequency component w w www, equation ( F 32 F 32 F-32\mathrm{F}-32F32 ) is written in the matrix form of equation ( F F FFF-14), where L L L\mathbf{L}L is the complex matrix given by cquation (F-33). Using this new form of the L L LLL matrix, follow the same procedure starting with equation (F-20) to obtain the solution expressed by equation (F-23).
Figure F-8 shows a CMP gather and the modeled CMP gathers computed by inverse transforming the velocity-stack and slant-stack gathers that were themselves estimated using the respective discrete Radon transforms. The reconstruction based on the velocity-stack gather restores that component of the original gather associated with the hyperbolic events. The reconstruction based on the slant-stack transformation, when implemented as a special form of the discrete Radon transform, restores virtually all of the data characteristics of the original gather.
There exists an affinity between slant-stack transformation (Section 6.3) and the discrete linear Radon transform discussed here. To compute the slant-stack gather, recall from Section (6.3) that we applied linear moveout to input data and summed over the offset axis (equation 6-5). That operation is equivalent to applying the L T L T L^(T**)\mathrm{L}^{\mathbf{T *}}LT matrix on the input vector d d ddd in equation (F-23). We then applied the rho filter to compensate for the attenuation of high frequencies
a
b
c
FIG. F-8. (a) A CMP gather; (b) reconstructed CMP gather by way of velocity-stack transformation; (c) reconstructed CMP gather by way of slant-stack transformation. Both velocity-stack and slant-stack transforms are special forms of the discrete Radon transform.
during the summation over the offset axis. Applying the rho filter is to some extent equivalent to applying the additional matrix operator ( L T L ) 1 L T L 1 (L^(T**)L)^(-1)\left(\mathbf{L}^{\mathbf{T} *} \mathbf{L}\right)^{-\mathbf{1}}(LTL)1 of equation (F-20). Actually this 2-D operator does more than what the 1-D rho filter does it accounts for the discrete sampling along the spatial axis and the finite cable length. Nevertheless, in practice, it turns out that just applying the rho filter in lieu of applying this computationally more involved operator yields a reasonably accurate slant-stack gather.

F. 4 Free-Surface Multiple Attenuation

Refer to the raypath configurations for the various types of multiples depicted in Figure 6.0-18. Mast significant multiples involve one or more bounces from the free surface. Figure 6.0-18a shows the first- and second-order water-bottom multiples, and Figure 6.0 18 b 6.0 18 b 6.0-18b6.0-18 \mathrm{~b}6.018 b shows the firstand second-order free-surface multiples associated with a deeper reflector. Figure 6.0-18c shows the peg-leg multiples associated with a primary reflection and intrabed multiple reflection, and Figure 6.0-18d shows the first- and second-order intrabed multiple reflections. Finally, Figure 6.0-18e shows the first- and second-order interbed multiple reflections.
(a)
(b)
FIG. F-9. (a) Marine recording geometry, (b) Noah's geometry, S S SSS is the vertically downgoing source wavefield, X X XXX is the recorded upcoming wavefield with and Y Y YYY is the wavefield without free-surface multiples. All wavefields are assumed to be plane waves. (Adapted from Riley and Claerbout, 1976.)
Shown in Figure 6.0-18 are but a limited subset of a countless group of multiples that are normally present in recorded marine data. Rather than attempting to attenuate all multiples, it makes sense to develop a technique aimed at attenuating the most significant set of multiples those associated with the free surface. Riley and Clierbout (1976) developed an elegant theory for free-surface multiple attenuation applicable to 1-D seismograms. They also extended their ideas to 2-D recorded data to attenuate diffracted multiples. The free-surface multiple attenuation theory by Riley and Claerbout (1976) was reworked and widely publicized later by Kennett (1979), Verschuur (1991), Verschuur et al. (1992), Carvalho et al. (1991), Dragoset and McKay (1993), Verschuur and Berkhout (1994), and Berkhout and Verschuur (1995). Applications to field data were reported by Dragoset and McKay (1993), Verschuur et al. (1995), Kelamis and Verschuur (1996), and Dragoset and Jericevic (1998). Here, we shall develop the theory of freesurface multiple attenuation based on the work by Riley and Clacrbout (1976), then review the work by Verschuur et al. (1992).
Consider the 1-D earth model in Figure F-9a and recording using a source represented by a vertically downward traveling plane wave W W WWW. If the free surface were removed from the earth model (Figure F-9b), then the associated multiples would also be removed from the recorded 1-D seismogram. The hypothetical recording geometry that facilitates removal of the free surface is called Noah's geometry by Riley and Claerbout (1976), and the technique to remove the freesufface multiples based on Noah's geometry is called Noah's deconvolution. Note that in Noah's geometry the recording cable now is being towed by a submarine rather than a surface vessel since the water level has risen as a result of the flood.
Whether you record with Noah's geometry (Figure F-9b) or the actual geometry at the same datum level (Figure F-9a), the earth's response E ( z ) E ( z ) E(z)E(z)E(z) to the same source S ( z ) S ( z ) S(z)S(z)S(z) defined in the z z zzz-transform domain should be the same. The earth's response E ( z ) E ( z ) E(z)E(z)E(z) can be described by the ratio of the upcoming waves U ( z ) U ( z ) U(z)U(z)U(z) to the downgoing waves D ( z ) D ( z ) D(z)D(z)D(z) :
E ( z ) = U ( z ) D ( z ) E ( z ) = U ( z ) D ( z ) E(z)=(U(z))/(D(z))E(z)=\frac{U(z)}{D(z)}E(z)=U(z)D(z)
From Figure (F-9a), the upcoming wave is U ( z ) = X ( z ) U ( z ) = X ( z ) U(z)=-X(z)U(z)=-X(z)U(z)=X(z), the recorded seismogram, and the downgoing wave is D ( z ) = S ( z ) + X ( z ) D ( z ) = S ( z ) + X ( z ) D(z)=S(z)+X(z)D(z)=S(z)+X(z)D(z)=S(z)+X(z). Here, we assume that the reflection coefficient of the free surface is -1 . From Figure F-9b, the upcoming wave is U ( z ) = Y ( z ) U ( z ) = Y ( z ) U(z)=-Y(z)U(z)=-Y(z)U(z)=Y(z), the seismogram that
is free of surface multiples, and the downgoing wave is D ( z ) = S ( z ) D ( z ) = S ( z ) D(z)=S(z)D(z)=S(z)D(z)=S(z). Hence, the earth's responsc E ( z ) E ( z ) E(z)E(z)E(z) defined by equation (F-34a) for the geometry of Figure F-9a is
E ( z ) = X ( z ) S ( z ) + X ( z ) E ( z ) = X ( z ) S ( z ) + X ( z ) E(z)=-(X(z))/(S(z)+X(z))E(z)=-\frac{X(z)}{S(z)+X(z)}E(z)=X(z)S(z)+X(z)
and for the geometry of Figure (F-9b) is
E ( z ) = Y ( z ) S ( z ) E ( z ) = Y ( z ) S ( z ) E(z)=-(Y(z))/(S(z))E(z)=-\frac{Y(z)}{S(z)}E(z)=Y(z)S(z)
Combine equations ( F 34 b , c ) F 34 b , c ) F-34b,c)\mathrm{F}-34 \mathrm{~b}, \mathrm{c})F34 b,c) to obtain
Y ( z ) S ( z ) = X ( z ) S ( z } + X ( z ) Y ( z ) S ( z ) = X ( z ) S ( z } + X ( z ) (Y(z))/(S(z))=(X(z))/(S(z}+X(z))\frac{Y(z)}{S(z)}=\frac{X(z)}{S(z\}+X(z)}Y(z)S(z)=X(z)S(z}+X(z)
Assume that the source waveform is minimum phase (Section 2.2) and define its inverse F ( z ) = S 1 ( z ) F ( z ) = S 1 ( z ) F(z)=S^(-1)(z)F(z)=S^{-1}(z)F(z)=S1(z). Then, solve equation (F-35) for the seismogram Y ( z ) Y ( z ) Y(z)Y(z)Y(z) free of surface multiples as
Y ( z ) = X ( z ) 1 + F ( z ) X ( z ) Y ( z ) = X ( z ) 1 + F ( z ) X ( z ) Y(z)=(X(z))/(1+F(z)X(z))Y(z)=\frac{X(z)}{1+F(z) X(z)}Y(z)=X(z)1+F(z)X(z)
Equation (F-38) is the besis for Noah's deconvolution described by Riley and Claerbout (1976). A practical perspective on the use of equation (F-36) is gained by the series expansion of the right-hand side:
Y ( z ) = X ( z ) [ 1 F ( z ) X ( z ) + F 2 ( z ) X 2 ( z ) ] Y ( z ) = X ( z ) 1 F ( z ) X ( z ) + F 2 ( z ) X 2 ( z ) Y(z)=X(z)[1-F(z)X(z)+F^(2)(z)X^(2)(z)-cdots]Y(z)=X(z)\left[1-F(z) X(z)+F^{2}(z) X^{2}(z)-\cdots\right]Y(z)=X(z)[1F(z)X(z)+F2(z)X2(z)]
where it is assumed that F ( z ) X ( z ) 1 F ( z ) X ( z ) 1 F(z)X(z)≪1F(z) X(z) \ll 1F(z)X(z)1.
Equation ( F 37 ) ( F 37 ) (F-37)(F-37)(F37) can be put into the convolutional form
y ( t ) = x ( t ) x ( t ) [ f ( t ) x ( t ) ] + x ( t ) [ f ( t ) x ( t ) ] [ f ( t ) x ( t ) ] . y ( t ) = x ( t ) x ( t ) [ f ( t ) x ( t ) ] + x ( t ) [ f ( t ) x ( t ) ] [ f ( t ) x ( t ) ] . y(t)=x(t)-x(t)**[f(t)**x(t)]+x(t)**[f(t)**x(t)]**[f(t)**x(t)]-cdots.y(t)=x(t)-x(t) *[f(t) * x(t)]+x(t) *[f(t) * x(t)] *[f(t) * x(t)]-\cdots .y(t)=x(t)x(t)[f(t)x(t)]+x(t)[f(t)x(t)][f(t)x(t)].
An iterative scheme to estimate the seismogram y ( t ) y ( t ) y(t)y(t)y(t) free of surface multiples can be devised based on equation (F-38). First, write the following recursive relation:
y t + 1 ( t ) = x ( t ) x ( t ) [ f ( t ) y i ( t ) ] , i = 0 , 1 , 2 , y t + 1 ( t ) = x ( t ) x ( t ) f ( t ) y i ( t ) , i = 0 , 1 , 2 , y_(t+1)(t)=x(t)-x(t)**[f(t)**y_(i)(t)],quad i=0,1,2,dotsy_{t+1}(t)=x(t)-x(t) *\left[f(t) * y_{i}(t)\right], \quad i=0,1,2, \ldotsyt+1(t)=x(t)x(t)[f(t)yi(t)],i=0,1,2,
where y 0 ( t ) = x ( t ) y 0 ( t ) = x ( t ) y_(0)(t)=x(t)y_{0}(t)=x(t)y0(t)=x(t).
The recursive relation described by equation ( F 39 F 39 F-39\mathrm{F}-39F39 ) yields the truncated form of the series on the right-hand side of equation (F-38). To see this, set i = 0 i = 0 i=0i=0i=0 in equation (F-39):
y 1 ( t ) = x ( t ) x ( t ) [ f ( t ) x ( t ) ] , ( F 40 a ) y 1 ( t ) = x ( t ) x ( t ) [ f ( t ) x ( t ) ] , ( F 40 a ) y_(1)(t)=x(t)-x(t)**[f(t)**x(t)],quad(F-40 a)y_{1}(t)=x(t)-x(t) *[f(t) * x(t)], \quad(F-40 a)y1(t)=x(t)x(t)[f(t)x(t)],(F40a)
which corresponds to the first two terms of the series in cquation (F-39). Next, set i = 1 i = 1 i=1i=1i=1 in equation (F-39) and substitute equation (F-40a) for y 1 y 1 y_(1)y_{1}y1 to get
y 2 ( t ) = x ( t ) x ( t ) [ f ( t ) x ( t ) ] + x ( t ) [ f ( t ) x ( t ) ] [ ( f ( t ) x ( t ) ] , y 2 ( t ) = x ( t ) x ( t ) [ f ( t ) x ( t ) ] + x ( t ) [ f ( t ) x ( t ) ] [ ( f ( t ) x ( t ) ] , y_(2)(t)=x(t)-x(t)**[f(t)**x(t)]+x(t)**[f(t)**x(t)]**[(f(t)**x(t)],y_{2}(t)=x(t)-x(t) *[f(t) * x(t)]+x(t) *[f(t) * x(t)] *[(f(t) * x(t)],y2(t)=x(t)x(t)[f(t)x(t)]+x(t)[f(t)x(t)][(f(t)x(t)],
which corresponds to the first three terms in equation (F-38).
Thus, by recursive application of equation (F-39) for a specified number of iterations, an estimate of the seismogram y ( t ) U i + 1 ( t ) y ( t ) U i + 1 ( t ) y(t)~~U_(i+1)(t)y(t) \approx U_{i+1}(t)y(t)Ui+1(t) that is free of most of the surface-related multiples can be obtained. Specifically, equation (F*39) states that the output y l + 1 ( t ) y l + 1 ( t ) y_(l+1)(t)y_{l+1}(t)yl+1(t) of the next iteration is the difference between the input trace x ( t ) x ( t ) x(t)x(t)x(t) and the input trace convolved with the inverse of the source wavelet f ( t ) f ( t ) f(t)f(t)f(t) convolved with the output of the previous iteration y 2 ( t ) y 2 ( t ) y_(2)(t)y_{2}(t)y2(t). The number of iterations in practice often is no more than three.
While the recursive scheme described here based on the work by Riley and Claerbout (1976) is designed for a zero-offset seismogram x ( t ) x ( t ) x(t)x(t)x(t) associated with a 1-D earth model, the theory has been extended to handle nonzero-offet data associated with a 2-D earth model by the same authors, and subsequently by Verschuur (1991), Verschuur and Berkhout (1994), and Dragoset and McKay (1993). In fact, the recursive relation given by equation (F-39), with a group of shot records as input, is the same as the update formula given by Verschuur and Berkhout (1994).
To attenuate fre-surface multiples caused by reflectors with complex geometry, in theory, you need all of the shot records along the seismic line as one single input to equation ( F 39 F 39 F-39\mathrm{F}-39F39 ) (Dragoset and McKay, 1993). In practice, however, assumptions are made about the subsurface complexity to be able to use individual CMP gathers as input (Kelamis and Verschuur, 1996). Also, assuming that spiking deconvolution has been applied to the input CMP gather prior to free-surface multiple attenuation, the inverse of the source wavelet f ( t ) f ( t ) f(t)f(t)f(t) in cquation (F-39) may be set to a unit spike at t = 0 t = 0 t=0t=0t=0. Then, it follows that
P t + 1 ( h , t ) = P 0 ( h , t ) P 0 ( h , t ) P 2 ( h , t ) , P t + 1 ( h , t ) = P 0 ( h , t ) P 0 ( h , t ) P 2 ( h , t ) , P_(t+1)(h,t)=P_(0)(h,t)-P_(0)(h,t)**P_(2)(h,t),P_{\mathrm{t}+1}(h, t)=P_{0}(h, t)-P_{0}(h, t) * P_{2}(h, t),Pt+1(h,t)=P0(h,t)P0(h,t)P2(h,t),
where P 0 ( h , t ) P 0 ( h , t ) P_(0)(h,t)P_{0}(h, t)P0(h,t) is the input CMP gather and P t ( h , t ) P t ( h , t ) P_(t)(h,t)P_{t}(h, t)Pt(h,t) is the gather after fresurface multiple attenuation, and h h hhh and t t ttt are the offset and time variables, respectively.
The recursion described by equation (F-41) requires 2-D convolution of the input gather P 0 ( h , t ) P 0 ( h , t ) P_(0)(h,t)P_{0}(h, t)P0(h,t) with the result of the previous iteration P 1 ( h , t ) P 1 ( h , t ) P_(1)(h,t)P_{1}(h, t)P1(h,t). For computational efficiency, the recursion can be performed in the space-frequency ( h ω ) ( h ω ) (h-omega)(h-\omega)(hω) domain
P ı + 1 ( h , ω ) = P 0 ( h , ω ) P 0 ( h , ω ) P 4 ( h , ω ) P ı + 1 ( h , ω ) = P 0 ( h , ω ) P 0 ( h , ω ) P 4 ( h , ω ) P_(ı+1)(h,omega)=P_(0)(h,omega)-P_(0)(h,omega)P_(4)(h,omega)P_{\imath+1}(h, \omega)=P_{0}(h, \omega)-P_{0}(h, \omega) P_{4}(h, \omega)Pı+1(h,ω)=P0(h,ω)P0(h,ω)P4(h,ω)
where P 0 ( h , ω ) P 0 ( h , ω ) P_(0)(h,omega)P_{0}(h, \omega)P0(h,ω) is the input CMP gather and P t ( h , ω ) P t ( h , ω ) P_(t)(h,omega)P_{t}(h, \omega)Pt(h,ω) is the gather after free-surface multiple attenuation, both in the h ω h ω h-omegah-\omegahω domain.
In practice, there are two issues that hinder the effectiveness of the free-surface multiple attenuation technique discussed here. First is the problem of an accurate estimate of the source wavelet s ( t ) s ( t ) s(t)s(t)s(t). Actually, it is the inverse of the source wavelet f ( t ) f ( t ) f(t)f(t)f(t) that is needed in the recursive relation described by equation (F-39). Deterministically, the source wavelet may be assumed equivalent to the recorded far-field signature (Section 2.5). Statistically, it may be assumed to be the minimum-phase inverse of the spiking deconvolution operator (Section 2.2). It is this latter viewpoint that is often taken in practice. As such, the input to the recursive estimate of the surface-related multiples in equation (F-41) is the CMP gather with spiking deconvolution.
The second issue is the missing near offsets. Attenuation of free-surface multiples using the recursive relation of equation (F-41) involves predicting multiples from the primaries. The free-surface multiples generated by a primary reflection that occurs within the near-offset range that is not recorded then are not attenuated. In fact, the problem of missing near-offset data has the most significant detrimental impact on the ability of the technique to attenuate all possible surface-related multiples (Dragoset and Jericevic, 1998). The Radon transform provides a theoretically appealing way to estimate the unrecorded near offsets (Section 6.4).
Figure F-10 shows a field data example of free-surface multiple attenuation. The frec-surface multiples in the shot record (Figure F-10a) include the water-bottom multiples and the peg-leg multiples associated with the top-salt and base-salt reflections. The same record after freesurface multiple attenuation (Figure F-10b) exhibits some residual of these multiples, primarily because of the practical issues discussed above. The free-surface multiples hesivily contaminate the subsalt refections (Figure F-10c). After multiple attenuation, the subsalt region is largely free of surface-related multiples.

F. 5 Water-Bottom Multiple Attenuation

A subset of surface-related multiples is water-bottom multiples. Based on the work by Morley (1982), Wiggins (1988) formulated a technique to attenuate water-bottom multiples associated with a complex water-bottom geometry. As for the free-surface multiple attenuation technique, this method also predicts multiples from the primaries contained in the recorded data within the cable length. To develop the conceptual basis, here, we shall review the technique for the special case of fat water bottom.
Refer to the raypath configuration in Figure F-11. Assume a horizontally layered earth model and treat a CMP gather a single wavefield equivalent to a shot record. The downgoing wavefield D ( h , z W , ω ) D h , z W , ω D(h,z_(W),omega)D\left(h, z_{W}, \omega\right)D(h,zW,ω) at the water bottom is given by
D ( h , z W , ω ) = P 0 ( h , z R , ω ) exp [ i k z ( z W + z R ) ] D h , z W , ω = P 0 h , z R , ω exp i k z z W + z R D(h,z_(W),omega)=P_(0)(h,z_(R),omega)exp[ik_(z)(z_(W)+z_(R))]D\left(h, z_{W}, \omega\right)=P_{0}\left(h, z_{R}, \omega\right) \exp \left[i k_{z}\left(z_{W}+z_{R}\right)\right]D(h,zW,ω)=P0(h,zR,ω)exp[ikz(zW+zR)]
a
b
C C C\mathbf{C}C
d
FIG. F-10. (a) A shot record with strong water-bottom multiples, (b) the saue record after waterbottom multiple attenuation, (c) a portion of the stacked section associated with the data ss in (a) that exhibits surface-related multiples, (d) a portion of the stacked section associated with the data as in (b) after free-surfice multiple attenuation. (Dragoset and McKay, 1993.)
FIG. F-11. Raypath geometry associated with up- and downgoing waves at the water bottorn.
where P 0 ( h , z R , ω ) P 0 h , z R , ω P_(0)(h,z_(R),omega)P_{0}\left(h, z_{R}, \omega\right)P0(h,zR,ω) is the CMP gather that represents the recorded wavefield at the receiver depth z R , h z R , h z_(R),hz_{R}, hzR,h is the offset variable, z W z W z_(W)z_{W}zW is the water depth, ω ω omega\omegaω is the temporal frequency and k z k z k_(z)k_{z}kz is the vertical wavenumber. The upcoming wavefield U ( h , z w , ω ) U h , z w , ω U(h,z_(w),omega)U\left(h, z_{w}, \omega\right)U(h,zw,ω) at the water bottom is given by
U ( h , z W , ω ) = P 0 ( h , z R , ω ) exp [ i k z ( z W z R ) ] U h , z W , ω = P 0 h , z R , ω exp i k z z W z R U(h,z_(W),omega)=P_(0)(h,z_(R),omega)exp[-ik_(z)(z_(W)-z_(R))]U\left(h, z_{W}, \omega\right)=P_{0}\left(h, z_{R}, \omega\right) \exp \left[-i k_{z}\left(z_{W}-z_{R}\right)\right]U(h,zW,ω)=P0(h,zR,ω)exp[ikz(zWzR)]
In equations ( F 43 F 43 F-43\mathrm{F}-43F43 ) and ( F 44 F 44 F-44\mathrm{F}-44F44 ), the sign convention defined in Section D. 1 for wavefield extrapolation is used.
The CMP gather P p ( h , z W , ω ) P p h , z W , ω P_(p)(h,z_(W),omega)P_{p}\left(h, z_{W}, \omega\right)Pp(h,zW,ω) free of water-bottom multiples defined at the water bottom is given by (Wiggins, 1988)
P p ( h , z W , ω ) = U ( h , z W , ω ) r W ( ω ) D ( h , z W , ω ) P p h , z W , ω = U h , z W , ω r W ( ω ) D h , z W , ω P_(p)(h,z_(W),omega)=U(h,z_(W),omega)-r_(W)(omega)D(h,z_(W),omega)P_{p}\left(h, z_{W}, \omega\right)=U\left(h, z_{W}, \omega\right)-r_{W}(\omega) D\left(h, z_{W}, \omega\right)Pp(h,zW,ω)=U(h,zW,ω)rW(ω)D(h,zW,ω)
where r w ( ω ) r w ( ω ) r_(w)(omega)r_{w}(\omega)rw(ω) is the water-bottom reflectivity.
Substitute equations (F-43) and (F-44) into equation (F-45) and simplify to get
P p ( h , z W , ω ) = P 0 ( h , z R , ω ) { exp [ i k z ( z W z R ) ] r W ( ω ) exp [ i k z ( z W + z R ) ] } P p h , z W , ω = P 0 h , z R , ω exp i k z z W z R r W ( ω ) exp i k z z W + z R P_(p)(h,z_(W),omega)=P_(0)(h,z_(R),omega){exp[-ik_(z)(z_(W)-z_(R))]-r_(W)(omega)exp[ik_(z)(z_(W)+z_(R))]}P_{p}\left(h, z_{W}, \omega\right)=P_{0}\left(h, z_{R}, \omega\right)\left\{\exp \left[-i k_{z}\left(z_{W}-z_{R}\right)\right]-r_{W}(\omega) \exp \left[i k_{z}\left(z_{W}+z_{R}\right)\right]\right\}Pp(h,zW,ω)=P0(h,zR,ω){exp[ikz(zWzR)]rW(ω)exp[ikz(zW+zR)]}
The CMP gather P p ( h , z R , ω ) P p h , z R , ω P_(p)(h,z_(R),omega)P_{p}\left(h, z_{R}, \omega\right)Pp(h,zR,ω) free of water-bottom multiples defined at the receiver depth is computed by extrapolating the CMP gather P p ( h , z W , ω ) P p h , z W , ω P_(p)(h,z_(W),omega)P_{p}\left(h, z_{W}, \omega\right)Pp(h,zW,ω) defined at the water bottom:
P p ( h , z R , ω ) = P p ( h , z W , ω ) exp [ i k x ( z W z R ) ] P p h , z R , ω = P p h , z W , ω exp i k x z W z R P_(p)(h,z_(R),omega)=P_(p)(h,z_(W),omega)exp[ik_(x)(z_(W)-z_(R))]P_{p}\left(h, z_{R}, \omega\right)=P_{p}\left(h, z_{W}, \omega\right) \exp \left[i k_{x}\left(z_{W}-z_{R}\right)\right]Pp(h,zR,ω)=Pp(h,zW,ω)exp[ikx(zWzR)]
Now substitute equation (F-46) into (F-47) and simplify to get
P p ( h , z R , ω ) = P 0 ( h , z R , ω ) [ 1 r W ( ω ) exp ( i k z 2 z w ) ] . P p h , z R , ω = P 0 h , z R , ω 1 r W ( ω ) exp i k z 2 z w . P_(p)(h,z_(R),omega)=P_(0)(h,z_(R),omega)[1-r_(W)(omega)exp(ik_(z)2zw)].P_{p}\left(h, z_{R}, \omega\right)=P_{0}\left(h, z_{R}, \omega\right)\left[1-r_{W}(\omega) \exp \left(i k_{z} 2 z w\right)\right] .Pp(h,zR,ω)=P0(h,zR,ω)[1rW(ω)exp(ikz2zw)].
Finally, rewrite this equation as
P p ( h , ω ) = P 0 ( h , ω ) r W ( ω ) P 0 ( h , ω ) exp ( i k z 2 z W ) , P p ( h , ω ) = P 0 ( h , ω ) r W ( ω ) P 0 ( h , ω ) exp i k z 2 z W , P_(p)(h,omega)=P_(0)(h,omega)-r_(W)(omega)P_(0)(h,omega)exp(ik_(z)2z_(W)),P_{p}(h, \omega)=P_{0}(h, \omega)-r_{W}(\omega) P_{0}(h, \omega) \exp \left(i k_{z} 2 z_{W}\right),Pp(h,ω)=P0(h,ω)rW(ω)P0(h,ω)exp(ikz2zW),
where z R z R z_(R)z_{R}zR has been omitted for simplicity. Equation ( F 49 ) F 49 {:F-49)\left.\mathrm{F}-49\right)F49) states that the gather P p ( h , ω ) P p ( h , ω ) P_(p)(h,omega)P_{p}(h, \omega)Pp(h,ω) with water-bottom multiple attenuation is computed by taking the difference of the input gather P 0 ( h , ω ) P 0 ( h , ω ) P_(0)(h,omega)P_{0}(h, \omega)P0(h,ω) and the input gather scaled by the water-bottom reflectivity r w ( ω ) r w ( ω ) r_(w)(omega)r_{w}(\omega)rw(ω) and upward extrapolated by a depth interval twice the water depth z W z W z_(W)z_{W}zW.
Equation (F-49) applies to data for which CMP assumptions are acceptable. For complex water-bottom multiples, the horizontal layer assumption no longer holds and therefore input data must be the entire set of shot records along the seismic line (Wiggins, 1988). As for freesurface multiple attenuation, however, computational efficiency in practice usually mandates use of individual CMP gathers in equation ( F 49 F 49 F-49\mathrm{F}-49F49 ).
In practice, there are several limitations of the water-bottom multiple attenuation technique discussed here. First is the problem of an accurate estimate of the water-bottom reflectivity
r W ( ω ) r W ( ω ) r_(W)(omega)r_{W}(\omega)rW(ω) that is needed in equation (F-49). While attempts have been made to obtain an accurate and stable estimate of the water-bottom reflectivity (Wiggins, 1988), the problem remains as a major obstacle to the success of the technique in practice.
Additional issues arise in relation to spatial aliasing of the CMP data and missing nearofiset data. As for the free-surface multiple attenuation, these problems may be circumvented by trace interpolation and extrapolation to zero offset using the Radon transform.
Perhaps the most serious limitation of the technique is the computational requirements to handle complex water-bottom geometry. In that case, the prediction and subtraction of multiples cannot be performed by the use of equation (F-49) based on phase-shift extrapolation. Instead, equation (F-45) needs to be employed wherein wave extrapolation has to be performed using the Kirchhoff integral to handle the irregular water-bottom geometry (Section 8.1). The waterbottom geometry itself can be determined by migrating the stacked section using the constantvelocity Stolt migration (Section 4.1) and converting the picked time horizon associated with the water-bottom reflection to depth as for the layer replacement (Section 8.1).
Figure F-12 shows a field data example of atfenuation of complex water-bottom multiples (Wiggins, 1988). The shot record in Figure F-12a exhibits strong multiples associated with a dipping water bottom. After the application of the technique based on equation (F-49), waterbottom multiples have been largely attenuated as shown in Figure F-12b. The stacked section shown in Figure F-12c associated with the shot record as in Figure F-12a contains complex waterbottom multiples. Any remaining multiples after multiple attenuation (Figure F-12d) may be attributed to the limitations in an accurate estimate of the water-bottom reflectivity and the adverse effect of the missing near-offset data.

F. 6 Spatial Prediction Filter

Consider a CMP-stacked data set P ( x , t ) P ( x , t ) P(x,t)P(x, t)P(x,t), where x x xxx is the CMP axis and t t ttt is the two-way zerooffset time axis. Apply Fourier transform in the t t ttt direction to decompose this 2-D data set to its frequency components P ( x , ω ) P ( x , ω ) P(x,omega)P(x, \omega)P(x,ω). For exch frequency component, define a complex vector P : P ( x , ω ) P : P ( x , ω ) P:P(x,omega)\mathbf{P}: P(x, \omega)P:P(x,ω) in the x x xxx direction.
We want to design a comples Wiener prediction filter F : F ( x ) F : F ( x ) F:F(x)\mathbf{F}: F(x)F:F(x), such that, when applied to the input data vector P : P ( x , ω ) P : P ( x , ω ) P:P(x,omega)P: P(x, \omega)P:P(x,ω), it yields an estimate of the input vector D : P ( x + α , ω ) D : P ( x + α , ω ) D:P(x+alpha,omega)D: P(x+\alpha, \omega)D:P(x+α,ω), at x + α x + α x+alphax+\alphax+α, where D D D\mathrm{D}D is the desired output vector and α α alpha\alphaα is the prediction lag. For the specifie problem of attenuating random noise uncorrelated from trace to trace, we shall consider the unit prediction lag α = 1 lag α = 1 lag alpha=1\operatorname{lag} \alpha=1lagα=1. The output of the spatial prediction filtering is the predictable component of the input data vector that can be treated as the coherent signal, and the error in the prediction process is the random noise contained in the input data (Canales, 1984).
The prediction filtering is expressed by the following convolutional relation:
Y ( x ) = P ( x , ω ) F ( x ) Y ( x ) = P ( x , ω ) F ( x ) Y(x)=P(x,omega)**F(x)Y(x)=P(x, \omega) * F(x)Y(x)=P(x,ω)F(x)
where Y ( x ) Y ( x ) Y(x)Y(x)Y(x) represents the actual output from prediction filtering. We want to compute a complex prediction filter F ( x ) F ( x ) F(x)F(x)F(x) such that the difference E ( x ) E ( x ) E(x)E(x)E(x) between the actual output Y ( x ) Y ( x ) Y(x)Y(x)Y(x) and the desired output D ( x ) D ( x ) D(x)D(x)D(x) is minimum in the least-squares sense. Consider the discrete form of equatjon (F-50), with F ( x ) F ( x ) F(x)F(x)F(x) represented by the m m mmm-length complex vector F : ( F 0 , F 1 , F 2 , , F m 1 ) F : F 0 , F 1 , F 2 , , F m 1 F:(F_(0),F_(1),F_(2),dots,F_(m-1))\mathbf{F}:\left(F_{0}, F_{1}, F_{2}, \ldots, F_{m-1}\right)F:(F0,F1,F2,,Fm1), P ( x , ω ) P ( x , ω ) P(x,omega)P(x, \omega)P(x,ω) represented by the n n nnn-length complex vector P : ( P 0 , P 1 , P 2 , , P n 1 ) P : P 0 , P 1 , P 2 , , P n 1 P:(P_(0),P_(1),P_(2),dots,P_(n-1))\mathbf{P}:\left(P_{0}, P_{1}, P_{2}, \ldots, P_{n-1}\right)P:(P0,P1,P2,,Pn1), and Y ( x ) Y ( x ) Y(x)Y(x)Y(x) represented by the ( m + n 1 ) ( m + n 1 ) (m+n-1)(m+n-1)(m+n1)-length complex vector Y : ( Y 0 , Y 1 , Y 2 , , Y m + n 1 ) Y : Y 0 , Y 1 , Y 2 , , Y m + n 1 Y:(Y_(0),Y_(1),Y_(2),dots,Y_(m+n-1))\mathbf{Y}:\left(Y_{0}, Y_{1}, Y_{2}, \ldots, Y_{m+n-1}\right)Y:(Y0,Y1,Y2,,Ym+n1). Equation ( F 50 ) ( F 50 ) (F-50)(F-50)(F50) can then be expressed in the following matrix form:
FIG. F-12. (a) A shot record with strong water-botlom multiples, (b) the same record after waterbottom multiple attenuation, (c) a portion of the stacked section associnted with the data as in (a) that exhibits complex water-bottom multiples, (d) a portion of the stacked section associated with the data as in (b) after water-bottom multiple attenuation. (Wiggins, 1988.)
( Y 0 Y 1 Y 2 Y m + n 1 ) = ( P 0 0 0 P 1 P 0 0 P 2 P 1 P 0 P 2 P 1 P 0 P m 1 P 2 P 1 0 P m 1 P 2 P m 1 0 0 P m 1 ) ( F 0 F 1 F 2 F n 1 ) Y 0 Y 1 Y 2 Y m + n 1 = P 0 0 0 P 1 P 0 0 P 2 P 1 P 0 P 2 P 1 P 0 P m 1 P 2 P 1 0 P m 1 P 2 P m 1 0 0 P m 1 F 0 F 1 F 2 F n 1 ([Y_(0)],[Y_(1)],[Y_(2)],[vdots],[Y_(m+n-1)])=([P_(0),0,cdots,0],[P_(1),P_(0),cdots,0],[P_(2),P_(1),P_(0),vdots],[vdots,P_(2),P_(1),P_(0)],[P_(m-1),vdots,P_(2),P_(1)],[0,P_(m-1),vdots,P_(2)],[vdots,cdots,P_(m-1),vdots],[0,0,cdots,P_(m-1)])([F_(0)],[F_(1)],[F_(2)],[vdots],[F_(n-1)])\left(\begin{array}{c} Y_{0} \\ Y_{1} \\ Y_{2} \\ \vdots \\ Y_{m+n-1} \end{array}\right)=\left(\begin{array}{cccc} P_{0} & 0 & \cdots & 0 \\ P_{1} & P_{0} & \cdots & 0 \\ P_{2} & P_{1} & P_{0} & \vdots \\ \vdots & P_{2} & P_{1} & P_{0} \\ P_{m-1} & \vdots & P_{2} & P_{1} \\ 0 & P_{m-1} & \vdots & P_{2} \\ \vdots & \cdots & P_{m-1} & \vdots \\ 0 & 0 & \cdots & P_{m-1} \end{array}\right)\left(\begin{array}{c} F_{0} \\ F_{1} \\ F_{2} \\ \vdots \\ F_{n-1} \end{array}\right)(Y0Y1Y2Ym+n1)=(P000P1P00P2P1P0P2P1P0Pm1P2P10Pm1P2Pm100Pm1)(F0F1F2Fn1)
This is the equation for complete transient convolution. Define the ( m + n 1 ) × ( m + n 1 ) ( m + n 1 ) × ( m + n 1 ) (m+n-1)xx(m+n-1)(m+n-1) \times(m+n-1)(m+n1)×(m+n1) coefficient matrix on the right-hand side by L. Equation (F-51) takes the compact form
Y = L F Y = L F Y=LF\mathbf{Y}=\mathbf{L F}Y=LF
The error vector E : ( E 0 , E 1 , E 2 , , E m + n 1 ) E : E 0 , E 1 , E 2 , , E m + n 1 E:(E_(0),E_(1),E_(2),dots,E_(m+n-1))\mathbf{E}:\left(E_{0}, E_{1}, E_{2}, \ldots, E_{m+n-1}\right)E:(E0,E1,E2,,Em+n1) is defined as the difference betwoen the desired output D : ( D 0 , D 1 , D 2 , , D m + r 1 ) D : D 0 , D 1 , D 2 , , D m + r 1 D:(D_(0),D_(1),D_(2),dots,D_(m+r-1))\mathbf{D}:\left(D_{0}, D_{1}, D_{2}, \ldots, D_{m+r-1}\right)D:(D0,D1,D2,,Dm+r1) and the actual output Y : ( Y 0 , Y 1 , Y 2 , , Y m + n 1 ) Y : Y 0 , Y 1 , Y 2 , , Y m + n 1 Y:(Y_(0),Y_(1),Y_(2),dots,Y_(m+n-1))\mathbf{Y}:\left(Y_{0}, Y_{1}, Y_{2}, \ldots, Y_{m+n-1}\right)Y:(Y0,Y1,Y2,,Ym+n1) :
E = D Y E = D Y E=D-Y\mathbf{E}=\mathbf{D}-\mathbf{Y}E=DY
By substituting equation (F-52) into equation (F-53), we obtain
E = D L F E = D L F E=D-LF\mathbf{E}=\mathrm{D}-\mathrm{L} \mathbf{F}E=DLF
The energy of the error vector is
S = E T E S = E T E S=E^(T**)ES=\mathbf{E}^{\mathbf{T} *} \mathbf{E}S=ETE
where T T TTT denotes matrix transpose and * denotes complex conjugate. Now, substitution of equation ( F 54 F 54 F-54F-54F54 ) into the definition defined by equation ( F 55 F 55 F-55F-55F55 ) yields:
S = ( D L F ) T ( D L F ) S = ( D L F ) T ( D L F ) S=(D-LF)^(T**)(D-LF)S=(\mathbf{D}-\mathbf{L F})^{\mathbf{T} *}(\mathbf{D}-\mathbf{L F})S=(DLF)T(DLF)
Expand the right-hand side:
S = D T D F T L T D D T L F + F T L T L F . S = D T D F T L T D D T L F + F T L T L F . S=D^(T**)D-F^(T**)L^(T**)D-D^(T**)LF+F^(T**)L^(T**)LF.S=\mathrm{D}^{\mathbf{T} *} \mathbf{D}-\mathbf{F}^{\mathbf{T} *} \mathbf{L}^{\mathbf{T} *} \mathbf{D}-\mathbf{D}^{\mathbf{T} *} \mathbf{L} \mathbf{F}+\mathbf{F}^{\mathbf{T} *} \mathbf{L}^{\mathbf{T} *} \mathbf{L} \mathbf{F} .S=DTDFTLTDDTLF+FTLTLF.
We want to estimate a prediction filter vector F F F\mathbf{F}F such that the quantity S S SSS is minimum. This condition leads to setting the derivative of S S SSS with respect to F F F\mathbf{F}F to zero. Differentiate both sides of equation (F-57) with respect to F F F\mathbf{F}F and observe the requirement for least-squares minimization that S / F = 0 S / F = 0 del S//delF=0\partial S / \partial \mathbf{F}=0S/F=0
D T L + F T L T L = 0 D T L + F T L T L = 0 -D^(T**)L+F^(T**)L^(T**)L=0-\mathrm{D}^{\mathbf{T} *} \mathbf{L}+\mathbf{F}^{\mathbf{T} *} \mathbf{L}^{\mathbf{T} *} \mathbf{L}=\mathbf{0}DTL+FTLTL=0
Apply matrix transpose and rearrange the terms:
( L T L ) T F = L T D L T L T F = L T D (L^(T**)(L))^(T**)F=L^(T**)D\left(\mathrm{L}^{\mathbf{T} *} \mathrm{~L}\right)^{\mathbf{T} *} \mathbf{F}=\mathbf{L}^{\mathbf{T} *} \mathbf{D}(LT L)TF=LTD
Now define
G = L T D G = L T D G=L^(T**D)\mathrm{G}=\mathrm{L}^{\mathbf{T} * \mathrm{D}}G=LTD
and
R = L T L 1 R = L T L 1 R=L^(T**)L_(1)\mathbf{R}=\mathbf{L}^{\mathbf{T} *} \mathbf{L}_{1}R=LTL1
which yields the relation
R T = R . R T = R R^(T**)=R". "\mathbf{R}^{\mathbf{T} *}=\mathbf{R} \text {. }RT=R
thus making R R R\mathbf{R}R a Hermitian matrix of the size ( m + n 1 ) × ( m + n 1 ) ( m + n 1 ) × ( m + n 1 ) (m+n-1)xx(m+n-1)(m+n-1) \times(m+n-1)(m+n1)×(m+n1).
Use the relations given by equations ( F 60 a , b , c ) F 60 a , b , c ) F-60 a,b,c)F-60 a, b, c)F60a,b,c), to rewrite equation ( F 58 F 58 F-58F-58F58 ) in the form
R F = G R F = G RF=G\mathbf{R F}=\mathbf{G}RF=G
which can be rewritten by using equations ( F 60 a , b F 60 a , b F-60a,b\mathrm{F}-60 \mathrm{a}, \mathrm{b}F60a,b ) as follows:
F = ( L T L ) 1 L T D F = L T L 1 L T D F=(L^(T**)L)^(-1)L^(T**)D\mathbf{F}=\left(\mathbf{L}^{\mathbf{T} *} \mathbf{L}\right)^{-1} \mathbf{L}^{\mathbf{T} *} \mathbf{D}F=(LTL)1LTD
This solution is of the same form as the generalized linear inverse form of the discrete Radon transform represented by equation (F-20). As for the latter application, singular-value decomposition technique based on equation (F-23) can be used to solve for the complex Wiener filter coefficients F : ( F 0 , F 1 , F 2 , , F m 1 ) F : F 0 , F 1 , F 2 , , F m 1 F:(F_(0),F_(1),F_(2),dots,F_(m-1))\mathbf{F}:\left(F_{0}, F_{1}, F_{2}, \ldots, F_{m-1}\right)F:(F0,F1,F2,,Fm1).
An efficient recursive algorithm to solve for the complex Wiener prediction filter coefficients F in equation ( F 61 F 61 F-61F-61F61 ) is described by Treitel (1974). The technique makes use of the Hermitian property (equation F-60c) of the autocorrelation matrix R. Write this matrix in terms of its real R T R T R_(T)\mathbf{R}_{T}RT and imaginary R r R r R_(r)\mathbf{R}_{r}Rr components as
R = R τ + ı R ı R = R τ + ı R ı R=R_(tau)+ıR_(ı)\mathbf{R}=\mathbf{R}_{\tau}+\imath \mathbf{R}_{\imath}R=Rτ+ıRı
Similarly, write the complex Wiener filter F F F\mathbf{F}F and the crosscorrelation matrix G G G\mathbf{G}G in the same form:
F = F r + ı F ı F = F r + ı F ı F=F_(r)+ıF_(ı)\mathbf{F}=\mathbf{F}_{r}+\imath \mathbf{F}_{\imath}F=Fr+ıFı
and
G = G r + i G 2 G = G r + i G 2 G=G_(r)+iG_(2)\mathbf{G}=\mathbf{G}_{r}+i \mathbf{G}_{2}G=Gr+iG2
Substitute equations ( F 63 a , b , c F 63 a , b , c F-63 a,b,cF-63 a, b, cF63a,b,c ) into equation (F-61) and equate the real and imaginary parts of boths sides of the resulting expression to get
R r F r R r F s = G r R r F r R r F s = G r R_(r)F_(r)-R_(r)F_(s)=G_(r)\mathbf{R}_{r} \mathbf{F}_{r}-\mathbf{R}_{r} \mathbf{F}_{s}=\mathbf{G}_{r}RrFrRrFs=Gr
and
R 1 F r + R r F 2 = G 2 R 1 F r + R r F 2 = G 2 R_(1)F_(r)+R_(r)F_(2)=G_(2)\mathbf{R}_{1} \mathbf{F}_{r}+\mathbf{R}_{r} \mathbf{F}_{2}=\mathbf{G}_{2}R1Fr+RrF2=G2
Finally, write equations ( F 6 4 a , b ) ( F 6 4 a , b ) (F-64a,b)(\mathrm{F}-6 \mathbf{4} \mathbf{a}, \mathbf{b})(F64a,b) in matrix form:
( R r R ı R r R r ) ( F r F i ) = ( G r G i ) R r R ı R r R r F r F i = G r G i ([R_(r),-R_(ı)],[R_(r),R_(r)])([F_(r)],[F_(i)])=([G_(r)],[G_(i)])\left(\begin{array}{cc} \mathbf{R}_{r} & -\mathbf{R}_{\imath} \\ \mathbf{R}_{r} & \mathbf{R}_{r} \end{array}\right)\left(\begin{array}{l} \mathbf{F}_{r} \\ \mathbf{F}_{i} \end{array}\right)=\left(\begin{array}{l} \mathbf{G}_{r} \\ \mathbf{G}_{i} \end{array}\right)(RrRıRrRr)(FrFi)=(GrGi)
The square matrix on the left-hand side of this equation is a block Toeplitz matrix (Robinson, 1967; Robinson and Treitel, 1980). This property leads to an efficient recursive algorithm that does not require complex arithmetic to solve for the complex prediction filter coefficients F (Treitel, 1974).

REFERENCES

Alam, A. and Austin, J., 1981, Multiple attenuation using slent stacks: Tech. Rep., Western Gcophysical Company.
Alara, A. and Lasocki, L., 1981, Slant stack and applications: Presented at the 41st Ann. Eur. Assoc. Expl. Geophys. Mtg.
Al-Yahya, K., 1991, Application of the partial Karhunen-Loeve transform to suppress random noise in seismic sections: Geophys. Prosp., 39, 77-93.
Berkhout, A. J. and Verschuur, E. J., 1995, Estimation of multiple scattering by iterative inversion, Part 1: Theoretical considerations: 55th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 715-718,
Beylkin, G., 1987, Discrete Radon transform: IEEE Trans. on Acoustics, Speech and Signal Processing, AASP-35, 162-172
Canales, L., 1984, Random noise reduction: 54th Ann. Internat. Mtg., Soc. Expl. Geophys, Expanded Abstracts, 525.
Claerbout, J. F., 1978, Snell waves: Stanford Exploration Project Report No. 15, 57-72, Stanford University.
Claerbout, J. F., 1985, Imaging the earth's interior: Blackwell Scientific Publications.
Clayton, R. W. and McMechan, G., 1981, Inversion of refraction data by wave-ficid extrapolation: Geophysics, 46, 860-868.
Carvalho, P. M., Weglein, A. B. and Stolt, R. H., 1991, Examples of a nonlinear inversion method based on the T T TTT matrix of scattering theory: Application to multiple suppression: 61 st Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 1319-1322.
Diebold, J. B. and Stoffa, P. L., 1981, The traveltime equation, τ p τ p tau-p\tau-pτp mapping and inversion of common midpoint data: Geophysics, 46, 238-254.
Doicin, D. and Spitz, S., 1991, Multichannel extraction of water-bottom peg-legs pertaining to gihg-amplitude reflection: 61st Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 1439-1442.
Dragoset, W. H. and Jericevic, Z., 1998, Some remarks on surface multiple elimination: Geophysics, 63,7 T2-789.
Dragoset, W. H. and Mackay, S., 1993, Surface multiple elimination and subsalt inaging: Expl. Geophys., 24, 463-472.
Ewing, M., Jardetsky, W. S., and Press, F., 1957, Elastic waves in layered media: McGraw-Hill Book Co.
Foster, D. J. and Mosher, C. C., 1992, Suppression of multiple reflections using the Radon transform: geophysics, 5 7 5 7 57\mathbf{5 7}57, 386-395.
Gonzalez-Serrano, A., 1982, Wave-equation velocity analysis; Ph.D. thesis, Stanford University.
Hampson, D., 1986, Inverso velocity stacking for multiple elimination. J. Can. Soc. Expl. Geophys., 22, 44-55.
Hampson, D.1 1987, The discrete Radon transform: A new tool for mage enhancement and noise suppression: 57th Ann. Internat. Mtg., Soc. Expl. Geophys., Expended Abstracts, 141-143.
Hubral, P. and Krey, T., 1980, Interval velocities from seismic reflection time measurements: Soc. Expl. Geophys.
Jones, I. F. and Levy, S., 1987, Slgnal-to-noise ratio enhancement in multichannel seismic data via the Karhunen-Loeve transform: Goophys. Prosp., 35, 12-32.
Kelamis, P. G. and Mitchell, A. R., 1989, Slent-stack processing: First Break, 7, 43-54.
Kelamis, P. G. and Verschuur, D. J., 1996, Multiple elimination strategies for land data: Eur. Assoc. Expl. Geophys. Mtg., Extended Abstracts.
Kennett, B. L. N., 1979, The suppression of surface multiples on sersmic records: Geophys. Prosp., 28, 584-600.
Kostov, C., 1990, Toeplitz structure in slant-stack inversion: 60th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 1618-1621.
Levin, F, K. and Shah, P. M., 1977, Peg-leg multiples and dipping reflectors: Geophysics, 42, 957 981 957 981 957-981957-981957981.
Lines, L. R. and Treitel, S., 1984, Tutorial: A review of least-squares inversion and its application to geophysicel problems: Geophys. Prosp., 32, 159-186.
McMechan, G. and Yedlin, M., 1981, Analysis of dispersive waves by wavefield transformation: Geophysics, 46, 869-879.
Morley, L., 1982, Predictive techniques for marine multiple suppression: Ph. D. dissertation, Stanford Univ.
Ottolini, R., 1982, Migration of seismic data in angle-mdpoint coordinates: Ph.D. thesis, Stanford Universty.
Pekeris, C. L., 1948, Theory of propagation of explosive sounds in shallow watcr: Geol. Soc. Am. Mem, 27.
Preas, F. and Ewing, M., 1950, Propagation of explosive sound in a liquid layer overlying a semiinfinite elastic solid: Geophysics, 15, 111-148.
Press, W. H., Flannery, B. P., Teukplsky, S. A. and Vetterling, W. T., 1986, Numcrical Recipes: The Art of Scientific Computing: Cambridge University Press.
Riley, D. C. and J, F. Claerbout 1976, 2-D multiple reflections: Geophysics, 41, 592-620.
Robinson, E. A., 1967, Multıcharmel time series analysis with digital computer programs: HoldenDay.
Robinson, E. A. and Treitel, S., 1980, Geophysical signal analysis: Prentice-Hall, Inc.
Ryu, J. V., 2980, Decomposition of seismic gathers into velocity components by a space-time filter: Presented at the 50th Ann. Internat. Mtg. Soc. Expl. Geophys.
Schultz, P. S. and Glaerbout, J. F., 1978, Velocity estimation by wavefront synthesis: Geophysics, 43, 691-712.
Sengbush, R.L., 1983, Seismic exploration methods: Internat. Human Res. Dev. Corp., Boston.
Sherwood, J. W. C. and Poe, P. H., 1972, Constant-velocity stack and wavelet processing: Geophysics, 37 , 769 787 37 , 769 787 37,769-78737,769-78737,769787.
Taner, M. T., 1977, Simplen - plane-wave stacking: Presented at the 37th Ann. Eur. Assoc. Explor. Geophys. Mtg.
Taner, M. T., 1980, Long-period sea-floor multiples and their attenuation: Geophys. Prosp., 28, 30 48 30 48 30-4830-483048.
Thorson, J., 1978, Reconstruction of slant stacks: Stanford Exploration Project Report No. 14, 83-91, Stanford University.
Thorson, J. R. and Claerbout, J. F., 1985, Velocity-stack and slant-stack stochastic inversion: Geophysice, 50, 2727-2741.
Treitel, S., 1974, The complex Wiener filter: Geophysics, 39, 169-173.
Treitel, S., Gutowski, P. R., and Wagner, D. E., 1982, Plane-wave decomposition of seismograms: Geophysics, 47, 1375-1401.
Ulrych, T. J., Freire, S. L. and Siston, P., 1988, Eigenimage processing of seismic sections: 58th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abetracts, 1261-1265.
Verschuur, D. J., 1991, Surface-related multiple elimination, an inversion approach: P h P h Ph\mathrm{Ph}Ph. D. thesis, Delft Univ. of Tech.
Verschuur, D. J. and Berkhout, A. J., 1994, Multiple technology, part 1: Estimation of multiple reflections: 64th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 1493-1496
Verschuur, D. J., Berkhout A. J., and Kelamis, P. G., 1995, Estimation of multiple scattering by iterative inversion - part II: examples of marine and land data: 65th Ann. Internat. Mtg., Soc. Expl. Geophys., Expanded Abstracts, 1470-1473.
Verschuur, D. J., Berkhout, A. J, and Wapenaar, C. P. A., 1992, Adaptive surface-related multiple elimination: Geophysics, 57, 1166-1177.
White, R. E., 1984, Signal and noise estimation from seismic reflection data using spectral coherence methods: Proc. IEEE, 72, 1340-1356
Wiggins, J. W., 1988, Attenuation of complex water-bottom multiple by wave equation-based prediction and subtraction: Geophysics, 53, 1527-1539.
Yilmaz, O., 1981, Modeling guided waves in an irregular water layer: Presented at the 5lst Ann. Internat. Mtg. Soc. Expl. Geophys.
Yilmaz, O., 1989, Velocity-stack processing: Geophys. Prosp., 37, 357-382.

INDEX

Abnormal moveout:
associated with turning waves, 686
Acoustic mpedance: 1808
estrmation, 1863
processing sequence to stimate, 1865
thre-dumengional (3-D), 1872
volume, 1901
Air wave, 81
Aki-Richards equation for AVO, 1816, 2019
Aljes irequency, 3 ] ] ]]]
Amplitude spectrum
two-dmensional, 55,1541
one-dmensional, 26, 153
of a wavelet, 29
Amplitude variation with offset (AVO): 1807, 1814 equations for, 1816,1832
for anisotropic meduum, 1998
Amsotropic dip-moveout (DMO) correction, 1968
Ansotrope meration, 1980
Anostropic velocity analysis, 1965
Anisotropy: 1961
and AVO response, 1998
shear-wave splitting, 1999
elliptical, 1965
weak, 1965
Antualsaging:
in 3-D prestack depth migration, 1333
נn 3-D DMO correction, 1049
Aperture in migration: 502
effect of random nose on, 508
Asymptotic conversion point (ACP), 1946
Asymptotic ray solution, ] 348 ] 348 ]348] 348]348
Autocorrelation
and multiple refiections, 209,884
frequency-domain description of, 4 t 4 t 4t4 \mathrm{t}4t
computation of 40
and Wiener filter, 179
Automatic gan control (AGC), 81
AVO (amplitude variation wth offset), 1814
analysis, 1851
attributes, 1854
crosplots, 1858
equations for, 1816,1832
gradient, 1820
intercept, 1820
interpretation, 1862 inversion, 1827, 2020
processing sequence in relation to, 1839
three-dimensional (3-D), 1863
A verage velocity, 432
Azmuth dependence of moveout velocities, 1036
Azimuth moveout (AMO). 1047
correction for, 1340
Band-pass filtering, 42
Band-reject filtering, 42
Bandwidth-
and filter length, 46
and vertical resolution, 46
Binning of 3-D data; 1019
Birefringence, 1999
Body waves, 1795, 2008
Bortfeld equation for AVO, 1816
Bulk modulus, 1795, 2011
Cable feathering, 1019
Cable nosse, 81,840
Calibration to well tops, 1426
Cascaded migration, 525
Causal wavelet, 176
Cheops' pyramud, 726
Chebychev recursion, 1083, 1201
CMP fold, 93
CMP sorting, 93
CMP stack.
and zero-offeet section, 467
CMP stacking
as & principle procts, 4 , 26 , 91 4 , 26 , 91 4,26,914,26,914,26,91
effect of charge type, 6
effect of deomgraphic restrictions, 7
effect of near-surface, 6
Coherency inversion 1354, 1369, 1667
appied to 3 D 3 D 3-D3-D3D seismic data, 1665
ray tracing in, 1443
velocaty resolution in, 1404
Coherent linear noise. 838
and D M O D M O DMO\mathrm{DMO}DMO correction, 716
and slant-stack transformation, 924
dyp filtering of, 905
in the f k f k f-kf-kfk domain, 65,838
Common-conversion-point (CCP): 1933, 1946 binning 1933
Common-midpoint (CMP) gather, 93
Common-mudpoint (CMP) stack, 93
Common-offset section. 93 in relation to DMO correction, 669
Common-offet migration, 728,777
Common-refiection-point gathers 670, 774
and mugration velocity analysis, 788
from 3-D prestack migration, 1121
Common-refiection-point stack, 769
Common-refiection-surface stack, 769
Common-receiver gathers 93
from prestack depth migration, 1285, 1297
Common-shot gather, 93
Complex overburden structures, 1214
Complex Wiener filter, 995
Compressional ( P P PPP ) waves, 1795
Compressional-wave velocity:
and confining pressure, 272
and depth of burial, 273
and lithology 273
in dry and saturated rocks, 272
Confictung dips:
and dy-moveout (DMO) correction, 655
associated with fault-plane refections, 657
associated with salt-fiank reflections, 65 % 65 % 65%65 \%65%
Conjugate gradient method for deconvolution, 1529
Constant phase shift
and change in wavelet shape, 34
Constant time shtit
and linear phasc shift, 34
Constant-velocity migration, 776
Constant-velocity st &ckın: 290
by Radon transform, 954
Constrained inversion, 1526
Converted waves, 1915
Convolution, 38
conmutativity in, 39
mechanics of, 39
Comvolutional model, 162
in the frequency domain, 170
and random nose, 207
in the time doman, 167
equation for, 168
surface-consistent, 169
Correlation.
as a tume-domain process, 39
of yibrosens data, 41
Coupling of geophones in 4-C recording, 1922
Critical angle of refraction, 377,445
Crosscorrelation:
frequency-doman descruption of, 41
computation of, 40
and Wiener filter, 179
Crossdip, 1029
Gros-equalization in 4-D selsmic, 1912
Crossline direction in 3-D surveys, 1002
Crossline migration, 1129
Crosslune smearing, 1020
Crossplotting in AVO analysis, 1858
Cycles per secand ( H z ) , 26 ( H z ) , 26 (Hz),26(\mathrm{Hz}), 26(Hz),26
Cycles per unt diatance.
(wavenumber), 48
Data modeling: 10,1355
by generalized linear imversion (GLI), 1525
Deconvolution
and random riolse, 207
as a principle process, 4, 26, 91, 159
conjugate-gradient method for, 1529
deterministic, 170, 172, 181
frequency-domain, 233
generalized lmear inverse formalism of, 1626
in the r r rrr - p p ppp domain, 932
poststack, 222
predictive, 185
prestack, 213
signature, 217
spiking, 180,189
surface-congistent, 262
time-varient, 227
types of, 189
reverse of convolution, 167
statistical, 170,181
Yibroseis, 219
Deep sesmic sounding, 3
Demultiplexing, 91
Depth estimation:
from refracted arrivals, 444
Depth migration: 464, 1224
applied to 3-D poststack dat,n, 1904
applied to 3-D prestack data, 1321
applied to 2-D poststack data, 1238
applied to 2-D prestack data, 1249
of zero-offget dats, 1245
versus time migration, 1244
Depth step suze: 646
in 15-degree finte-difference migration, 520
in frequency-space migration, 537
in frequency-wavenumber migration, 566
in phase-shift migration, 566
Depth structure maps, 142 5 ¯ 142 5 ¯ 142 bar(5)142 \overline{5}1425¯
Deregowski loop (iterative residual moveout analysts), 1462
Determinstic deconvolution, 170, 172, 181
Differencing schemes, 488
Diffraction 482 , 1795 , 2012 482 , 1795 , 2012 482,1795,2012482,1795,2012482,1795,2012
response in laterally varying media, 1223
Diffraction hyperboln, 482
in the f f fff - k k kkk domain, 498
Diffraction term, 490,640
Diffraction surnmation, 484
Diving wrves, 1524
DMO ellipee, 681,826
Dup filtering.
in slent-stack domain, 931
of coherent linear no1se. 905
time-variant, 931
Dup-lune shooting, 1027
Dip-moveout (DMO) correction: 655,820
and coherent linear noise, 716
and fault-plane reflections, 693
and multiple reflections, 705
and reflection-point dispersal, 670
and residual statics corrections 718
and salt-flank reflections, 692
and stacking velocitues, 657
and trace interpolation, 718
and velocity analysis, 662, 677
antsotropic, 1968
appled to 3-D selsmic data, 1009, 1046, 1050, 1720
as part of sequence for prestack time migration, 728
as prestack partial migration, 670
constant-velocity, 674
effect of velocity errors on, 681
frequency-wavenumber method of, 672,821
integral method of, 679
log-atretch method of, 677,823
of diffractions, 674
of dipping events, 676
of PS data, 1959
principles of, 668
processing sequence for, 692
varable-velocity, 684
Dip-moverut operator. 671 , 730 , 826 671 , 730 , 826 671,730,826671,730,826671,730,826
for P P PPP-to-S converted data, 1963
Dipping events:
and slant-stack transformation, 924
DMO correction of, 676
mgration of, 47
NMO for, 285
in t x t x t-xt-xtx and f k f k f-kf-kfk domains, 5 ?
Discrete Radon traneform, 943
Dispersion:
of guided waves, 838
Dispersion relation, 489,629
Diving wave, 371
Dix converkion, 1354 , 1365 , 1534 , 1742 1354 , 1365 , 1534 , 1742 1354,1365,1534,17421354,1365,1534,17421354,1365,1534,1742
Dix equation, 312 , 1365 , 1539 312 , 1365 , 1539 312,1365,1539312,1365,1539312,1365,1539
Double-square-root equation, 632
Downgoing waves: 628
and free-surface multiple attenuation, 990
Downward continuation: 486, 630
of shots and recervers in wave-equation datumng, 1234
t t ttt-outer scheme for, 491
z-outer scheme for, 491
Earth imagng, 1213
Earth modeling: 10, 1356
by layer-by-layer inversion, 1433, 1445, 1574
by trme-to-depth conversion, 1416 structurodependent, 1354, 1574, 1651
structure-independent, 1354, 1450, 1577, 1678
Earthquake seismology, 1
Eigenimage 891
decomposition for multiple attenustion, 893
Eikonal equation, 1325, 1346
finte-difference solution to, 1349
high-frequency limit in relation to, 1325, 1349
Elastic deformation, 1795
Elrstic modul, 1795, 2006
Elastic wave equation, 2007
Elastic wavefeld modeling, 1790
Engineering seismology, 1
Explicit schemes: 488,646
appled to 3-D poststack migration, 1082, 1200
for frequency-space migration, 493,644
stability of, 493
Exploding reflectors model, 467
Exploding refectors migration operator, 636
Exploration selsmology 1
Fur-field term, 486, 1346
Fast Fourier tranaform (FFT), 27
Field statics corrections, 375
Filtering, 41
Filter coefficients, 41
Filter length, 44
and Gibbs phenomenon, 45
Filter scans, 48
Finite-difference migration: 486
and spatial aliasing, 584, 609
applied to 3-D seismic data, 1074
depth step size in, 520
downward continuation in, 486
differencing schemes in, 488,492
steep-dip, 492
velocity errors in, 525
Firat breats, 374
f k f k f-kf-kfk domsin, 55
mapping of dipping events in, 57
mugration of dipping events in, 496
f f fff-k filtcring:
and random noise, 904
and velocity analygis, 911
of linear noise attenuation, 898, 905
f f fff-k migration, 494
of dipping events, 496
of diffaction hyperbola, 496
wraparound in, 575
f k f k f-kf-kfk multiple attenuation, 90 ? 90 ? 90?90 ?90?
f f fff-k plane, 51
f f fff-k spectrum, 55
Fluid factor, 1828
Fluid saturation, 1820
Focusing analysis, 798
Fold of coverage 93
in 3-D surveys, 1023, 1034
4-C sestruc method, 1915
4-D seismic method, 1911
Fourier transiorm
defintion of, 25
and addition, 154
and autocorrelation, 154
and convolution, 154
and differentiation, 154
and its relation to z z zzz-transform, 155
and multiplication, 154
and sceling operation, 154
and shifting operation, 154
computation of 2-D, 58
intcgral of, 153, 156
one-dimensional, 26, 153
theorems, 154
two-dimensional, 48, 156
Fourth-order moveout, 280,437
Fowler's prestack time migration, 803
noindent Fres-surfacc multiple attenuation, 989
Frequency, 26
Frequency filtering, 41
design and application of, 44
Frequency aliasing, 30
Frequency-doman deconvolution. 233
design and application of, 238
theory of, 253
Frequency-space mugration.
and spatial alsaing, 584,609
depth atep alze in, 537
dup Jimits in, 549
expluct schemes for, 493 , 549 , 644 493 , 549 , 644 493,549,644493,549,644493,549,644
implicit schemes for; 492 , 535 , 641 492 , 535 , 641 492,535,641492,535,641492,535,641
in practice, 530
velocity errors in, 544, 552
f x f x f-xf-xfx (frequency-space) deconvolution, 966, 995
f f fff - x x xxx filter, 995
f f fff-x (írequency-space) migration, 492, 530, 641, 644
Frequency-wavenumber DMO correction, 672
Frequency-wavenumber filtering.
and random noise, 904
and statics corrections, 905
of linear noise attenuation, 898,905
Frequency-wavenumber migration: 494, 649
and spetial alissing, 584, 610
depth step size in, 566
dip limits in, 559
in practice, 559
of preatack data, 776,831
phase-shift method of, 498
Stalt method of, 500
velocity errors in, 567
Frequency-wavenumber multiple attenuntion, 907
Gain: as t t ttt-squared scaling, 85
function, 84
as time-varmant scaling, 81
as rms amplitude AGC, 85
as instantaneous AGC, 87
Fresnel zone, 1803
Gapped deconvolutıon, 185
Gardner's denaity relation, 1798
Gause's divergence theorem, 1343
Generalized recuprocal method, 379
Generalized linear inversion (GLI)- 1525
applicd to reflection traveltime tomography, 1552
appled to surface-consistent deconvolution, 1530
for discrete Radon transformation, 943, 984, 1534
formalism of deconvolution, 1526
for refraction statics corrections, 448, 1532
for residual statics corrections, 444, 1531
Geometric spreading correction, 81
Gubbs phenomerion, 45
Goupulfad earth model, 167
Goodway et al inversion for AVO, 1833, 2022
Gradient (AVO attribute), 1820
Green's function, 1344
Green's theorem, 1345
Gridding, 1543
Ground roll: 69
backscattered component of, 69
Group velocity, 1963
Guided waves: 70
analysis of, 977
Half-space velucity analyase, 1415 , 1609 , 1647 1415 , 1609 , 1647 1415,1609,16471415,1609,16471415,1609,1647
Head wave: 371
in relation to erkonal equation, 1328
Hertz (cycles per second), 26
High-cut filtering, 42
High-frequency limit, 1325, 1349
Hilbert transform, 254
Hooke's law, 1795, 2007
Horizon velocity analysis, 312
Huygens' secondary source, 482
Huygens' principle 1343
spplied to anisotropic medium, 1967
Hyperbolie moveout, 274
Hyperbolic Radon transform, 943, 984
Image gathers, 1355, 1406, 1461, 1695, 1746
and multiples, 1618
model veriflcation by, 1563
residual moveout analyses of, 1462,1756
Imaging beneath.
shallow gas anomalies, 1620
volcanics, 1597
Imaging principle, 472
Image rays, 1226, 1238, 1243
map migration by, 1425, 1674
time-to-depth conversion by, 1425
Impedance contrast, 1809
Implicit schemes, 489, 646
rational approximations for, 489
for frequency-space migration, 492, 535, 641
applied to 3 D 3 D 3-D3-\mathrm{D}3D poststack migration, 1074, 1198
Impulse response. 36
of a dip-moveout operator, 681
of a migration operator, 484
of 15-degree operator, 520
of implucit schemes, 537
of phase-shift migration operator, 565
of prestack time migration operator, 730
of reverse time muration operator, 5 3 5 5 3 5 535\mathbf{5 3 5}535
of 3-D implicit schemes, 1074
Inline direction in S-D surveys, 1002
Instantajueous AGC, 87
Instantaneous attributes, 1896
Integral DMO correction, 679
Interactive velocity analysis, 311
Intercept (AVO attribute), 1820
Interpretation of seismic data, 18,1156
removal of opacity in, 1158
seed detection applied to, 1159
structural, 1161
use of 3-D visualsation in, 1156
use of time slices in, 1156
volume based, 1690
Interval velocrty estmation:
by Dix conversion, 1365, 1417
by coherency inversion, 1369
by half-space analysı, 1415
by image-gather analysis, 1406
by stacking velocity inversion, 1392
effect of near-surface layer in, 1382
Inverse filter: 171
design and application of, 172
least-squares, 173
theory of, 252
Inverse Q Q QQQ filtering, 234
theory of, 266
Inverse of the source wavelet, 172, 251
Inversion.
broad meaning, 10
for data modeling, 10
for earth modeling, 10 , 1356 , 1450 10 , 1356 , 1450 10,1356,145010,1356,145010,1356,1450
narrow meaning, 10
of selsmic data, 10
to zero-offset (IZO), 1048
Irregular water bottom: 1233
imaging benerth, 1597
Lsotropic sold 1965
elastic wrve equation for, 2008
Isotropy, 1961
Iteratuve depth migration, 1247
Karhunen-Loeve transform: 887 decomposition to elgenimages by, 891

K K KKK-filtering

to avoid spatiol alusing, 58
K L K L K-LK-LKL transform, 887
Kirchhoff integral, 1343
Kirchhoff migration, 481
amplitude and phase factors for, 485
and Huygens' secondary source, 482
and point source, 482
and spatial aliasing, 582609
aperture in, 502
maximum dip limit m, 509
of prestack drta, 788
of 3-D selsmic data, 1073
velocity errors in, 509
Kirchhof summation, 485
aperture for, 502
applied to 3-D poststack migration, 1073
applied to 3-D prestack migration, 1324
far-field term in, 485
rho filter in, 486
Klauder wavelet, 219
Kunetz seismogram, 167
Lame's constants, 1795, 2005
Laplace transform
applied to 3-D explicit schemes, 1083
Lateral resolution, 1803
Lateral velocity variations, 1222
Layer stripping (layer-by-layer earth riodeling), 1433, 1445, 1574
Layer replacement, 1226
poststack, 1230
prestack, 1231
Layer velocity esturnation.
by Dix conversion, 1365
by coherency inversion, 1369
by half-space analysis, 1415
by Imago-gather analysis, 1406
by stackung velocity inversion, 1392
effect of near-surfice layer in, 1382
Layer velocities, 1356
Least-square inverse filter, 173
Least-oquares method
for residual statics corrections, 342
for refraction statics corrections, 379
Levinson recuraion, 259
Linear moveout. 923, 938
associated with refracted arrivals, 380,450
Linear noisc, 838
Linear superposition, 38
linear uncorreiated noise attenuation, 960
L1's correction in 3-D poststack migration, 1203
L 1 L 1 L_(1)L_{1}L1-norm refraction statics, 456
L 1 L 1 L_(1)L_{1}L1-norm residual statics, 458
Log-stretch DMO correction, 677, 823
Long-wavelength statics anomalies, 370
Low-cut fitering, 42
Map mugration, 1356, 1425
Map processing, 1539
Marquardt's damping factor, 1526
Maxjmum-energy summation in 3-D prestack depth mugration, 1331
McClellan transform, 1082, 1202
Migration:
algorithms, 471, 501
and edre effects, 620
and line length, 621
and random noise, 619
and spatial alesing, 581
anisotropic, 1980
aperture in 2-D, 502
aperture in 3-D, 1010
as a principle process, 4, 26, 91, 463
boundary and intual conditions for, 490
from topography, 626
horizontal displacement in, 478
in the τ τ tau\tauτ-p doman, 982
of dippisg events, 477
of P S P S PSP SPS data, 1961
of synclines and anticljnes, 480
of 3-D seismic data, 1073
strateges, 470,1322
treatmeit of multiple reflections by, 857
velocities, 475
vertical diaplacement in, 478
Migration veloctty analysis: 775
applyed to 3 D 3 D 3-D3-\mathrm{D}3D eeismic data, 1131
by common-offset migration, 777
by Kirchhoff summation, 788
by prestack Stolt migration, 776
by wavefield extrapolation, 833
using common-reflection-point gathers, 788
Migration velocity field, 788
Mnimum delay, 178
Mimmum phase: 175
and causality, 176
Mintmum-distance summation in 3-D prestack depth migration, 1331
Minimum-time summation in 3-D prestack depth migration, 1331
Minue time in refraction theory, 378,447
Mixed phase, 178
Modeling:
elast I c I c IcI cIc wavefield, 1 T90
nonzero-offset wavefield, 1781
zero-offset traveltame, 468,1780
zero-offset wavefield, 1223,1781
Model representation and visualization: 1360
triangulation in relation to, 1362
tessellation in relation to, 1363
Model updating: 1 4 5 0 1 4 5 0 1450\mathbf{1 4 5 0}1450
appled to &-D sessmic data, 1678 by refection traveltime tomography, 1469
by residual moveout analyses of inage gathers, 1462
Model verification, 1563
Modulus of rigdity, 1795
Mudrock line, 1828
Multicable recording in 3-D marune surveys, 1018
Multicomponent recording, 1919
Multiple attenuation: 837
by f k f k f-kf-kfk filtering, 898
by K L K L K-LK-LKL transform, 887
by modeling, 897
by predictive deconvolution, 209, 874
by Radon transtorm, 953
by τ p τ p tau-p\tau-pτp deconvolution, 932
by velocity discrumination, 887
freesurface, 989
water-bottom, 992
Multiple reflections: 81 , 167 , 838 81 , 167 , 838 81,167,83881,167,83881,167,838
and autocorrelogram, 884
and DMO correction, 705
and mage gathers, 1618
and migration, 857
and velocity analysis, 861
in Radon-transform domain, 952
in slant-stack domain, 924
periodicity of, 877
types of, 856
Multiplexed data, 91
Mute compensation, 308
Muting, 285
Near-field term, 1346
NMO stretching, 283,440
Noah's deconvolution, 991
Noise attenuation, 837
by f x f x f-xf-xfx deconvolution, 966,995
Normal-incidence rays, 468 , 1238 , 1242 468 , 1238 , 1242 468,1238,1242468,1238,1242468,1238,1242
Nonhyperbolic moveout: 1232,1235
associated with anisotropy, 1966
esgociated with lateral velocity variations, 1214
asgociated with P P PPP-to-S conversion, 1956
Nonstationarity, 167, 222
Nonzero-offset traveltime equation, 725,827
Nonzero-offset wavefield modeling, 1781
Normal modes, 978
Normal moveout (NMO): 274, 630
for a dipping reflector, 285,442
for a flat reflector, 274
for a horzontaliy layered earth, 280
for anisotropic medum, 1966
for a 3-D dopping refiector, 1036
for layers with arbitrary dips, 287
function of offset, velocaty and time, 280, 288
in relation to dyp-noveout (DMO), 656
Normal-moveout correction: 279
d.p-dependent, 669
dip-mdependent, 669
Normal-moveout velocity: 274
versus stacking velocity, 288
Nyquist frequency, 29
Nyquist wqvenumber, 48
OBC (ocean-bottom cable), 1917
Obliquity factor, 485
Omega-x (frequency-apace) migration, 492
One-pass 3-D mugration, 1074, 1199
One-way wave equation, 489
noindent Opacity, 1158, 1714, 1773
Operator allasmg, 609
Operator length
in frequency filtering, 44
in predictive deconvalution, 190
Overcorrection in normal-mioveout, 280
Parabolic approxination to wrve equation, 639
Parabolic equation, 490,639
Parabolic moveout, 944
Paraboluc Radon transform, 944, 987
Parseval's theorem, 154, 178
Parsimony in processing, 124
Period, 26
Phase-lag, 26
Phase-shift migration: 498 , 629 , 649 498 , 629 , 649 498,629,649498,629,649498,629,649
and spatial aliasing, 584,610
applied to 3-D selsmic data, 1203
impulae response of, 565
depth btep suze II, 566
vclocity errors in, 567
Phase-shift-plus-correction. migration by, 1088
Phase spectrum, 153
of a wavelet, 29 .
Phase rotation, 34 and change in polarity, 35
Phase velocity, 1963
Plane-wave decomposition
and slant-stack transform, 921
and 2-D Fourier transform, 55
Plus-minus method, 377
Plus time in refraction theory, 378,447
Point diffractor: 1223
and Kirchhoff migration, 483, 1344
and downward continuation, 487
Pont source, 482
Poison's ratio. 1795, 2005
and fluid saturation, 1820
and V P / V S V P / V S V_(P)//V_(S)V_{P} / V_{S}VP/VS ratio, 2011
Polarity, 35
Poststack deconvolution, 222
Poststack depth migration, 1224
applied to 2-D seismc data, 1238, 1356
applied to 3-D seismic data, 1304
Poststack laver replacement, 1230
Poststack migration, 470
Power-line interference, 81
P P P P PPP PPP section, 1922
PS section, 1922
Prediction error filter 186, 262 design and spplication of, 189
Prediction filter 186, 260
complex 995
design and spplication of 188
for noise attenuation, 966
Prediction lag
in predictive deconvolution, 185, 193
Predictive deconvolution
by Wiener filtering, 185
in practice, 190
multiple attenuation by, 209
operator length in, 190
percent prewhitening in, 203
prodictuon lag in, 193
theory of, 260
Prestack amplitude inversion, 1827, 1851, 2019
Prestack deconvolution, 213
Prestack depth migration: 1273, 1357
shot-geophone method of, 1274
shot-profile method ot, 1280
Prestack f k f k f-kf-kfk migration, 770,831
Prestack imaging (PSI), 728
Prestack layer replacement, 1231
Prestrack migration, 470
Prestack partial migration, 670
Prestack Stolt migration, 776
Prestack time migration. 725
by Kirchhoff summation, 788
ellipse for, 828
for AVO analysts, 1848
frequency-wavenumber technique for, 831
Fowler's velocity-independent, 803
of common-offet data, 728
of fault-plane retelctions, 742
of salt-fiank refiections, 729
operator for, 731
summation technques for, 726,829
Prewhitening, 255
in deconvolution, 181, 203
Primary reflections, 70, 167
Princuple of superpasition
applied to deconvolution, 167
spplied to migration, 469
Processing of sesmic data, 4
Progranmed gain control, 85
P-to-S corversion, 1813, 1915
P P PPP (compressional) waves, 1795
P P PPP-wave impedance, 1831
P P PPP-wave refiectivity, 1816
P P PPP-wave velocity 2009
and confining pressure, 272
and depth of burial, 273
and lithology, 273
in d r y d r y dry\mathrm{dry}dry and saturated rocks, 272
Q Q QQQ fietor, 225
Quality control in processing, 122
Radial component in 4-C seismle, 1926
Radon transform: 932,982
and generalized linear inversion, 984
hyperbalic, 943, 984
multiple attenuation, 953
parabolic, 944, 987
Random nose, 81, 876
and convolutional model, 168
and f k f k f-kf-kfk filtering, 904
and mugration, 619
attemation of, 837,995
mogration aperture in the presence of, 508
Ray parameter, 922
Rnypath, 2012
Ray tracing
in coherency inverson, 14d3, 1451
in traveltime calculation for prestack depth migration, 1324
Ray velocity, 1963
Reflections, 70, 1795, 1808, 2012
Reflection coefficient. 1864
and 1 -D seismogram, 165
sertes, 165
Reflection-point disperan]. 670, 817 assocsated with transverse 15otropy, 1966 for a 3-D dipping reflector, 1047
Refiection traveltime toriography, 1469, 1545
Reflectivity;
as a tandom process, 171
serves, 167
Reflector curvature, 1813
Reflector geometries, 1356
Refractions, 375 , 1795 , 1808 , 2012 375 , 1795 , 1808 , 2012 375,1795,1808,2012375,1795,1808,2012375,1795,1808,2012
from a flat interface, 375,445
from a dipping interiace, 377,446
Refraction statics corrections: 370
apphed to 3-D data, 1036
by generalized linear inversion, 449
by generalized-reciprocal method, 379
by least-squares method, 379
by L 1 L 1 L_(1)L_{1}L1-norm minimuzation, 457
by plus-minus method, 377
by tomagraphy, 454
Refraction traveltime tomography, 453
Relative trace balancing, 90
Remez exchange algorithm, 645, 1083
Reservoit characterization, 1794
Reservoir montoring, 1794, 1913
Residual migration, 575, 651
Residual moveout unalysis of image gathers, 1462
Residual statics corrections: 324
find DMO correction, 718
and velocity analysis, 336
applied to 3-D data, 1050
by generalized linear inversion, 444
by stack-power maximization, 365
by traveltime decompos:tion, 345
processing sequence for, 381
surface consistent, 341
Residual statics estimation:
by least-squares method, 342
by L 1 L 1 L_(1)L_{1}L1-norm minimization, 458
by stack-power maximation, 344
by traveltime decomposition, 336,443
correlation window for, 361
effect of moveout errors in, 365
Gauss-Seidel method for, 343
maximum allowable sluft in, 346
Reverberations, 843
Reverse time migration, 491,530
Rho filter
in Kirchhoff summation, 486
in slant-stack transformation, 923
RMS amplitude AGC, 85
RMS velocity: 280
estimated from prestack time migration, 776 , 1131 , 1720 776 , 1131 , 1720 776,1131,1720776,1131,1720776,1131,1720
Rotation of geophone components in 4-C selsmic, 1926, 1945
Seed detection, 1159 , 1707 , 1716 1159 , 1707 , 1716 1159,1707,17161159,1707,17161159,1707,1716
Semblance: 301
in coherency inversion, 1381, 1402, 1442
Seismic ansotropy, 1961
Seismic impedance, 1808
Seismic method, 1
Seismic monitoring, 22
Seismic resolution: 1801
vertical, 1801
lateral, 1803
Seismic wavefield, 470
Seismic waves, 1795,2008
Separation versus splitung:
in 3-D nigration, 1074, 1199, 1314
Shallow seismic method, 3
Shaping filter, 183
Shear (5) waves, 1795
Shear-wave splitting (birefrungence), 1990
Shear-wave velocity.
and confining prossure, 272
in dry and satursted rocks, 272
Shifted hyperbola, 283, 437
Shift term, 498
Shortest-path summation in 3-D prestack depth migration, 1331
Short-wavelength statics anomalies, 370
Shot-geophone migration, 633,1274
Shot-profile migration, 1280
Shuey equation for AVO, 1818
Side-scattered nojse, 81, 838
Sideswipe energy, 1003
Signal.
analog versus digital, 28
analysis of, 24,27
synthesis of, 24,27
time-dependent, 27
Signature deconvolution, 217
Slant streck. 920
and plane waves, 920
multiple attenuation, 932
practucal aspects of, 924
physical aspects of, 920
transformation, 923
Small-dip approximation:
in NMO correction, 287
in migration, 490
Small-spread hyperbola, 280
Smith and Gidiow inversion for AVO, 1824, 2020
Snell wave, 922
Snell's law, 1535, 2016
Solıd model, 1431, 1718
Sonic log.
and 1-D selsmogram, 162
Source waveform, 16 '
inverse of, 172, 251
Sparse-spike reflectivity, 1872,1900
Spatral aliasing.
and 3-D DMO correction, 1049
and migration, 581,1017
defintion of, 51
of dipping everits, 64
and threshold frequency, 65
ways to avord, 56
Spatial frequency, 48
Spatial predsction filter:
apphed to random nolse attenuation, 966,995
appled to trace interpolation, 1065, 1204
Spectral decomposition, 255
Spectral whitening, 231
Spherical spreading factor, 485
Spiking deconvolution:
and munum phase, 178
by Wiener filterng, 180
as special case of predictive deconvolution, 189
theory of, 258
Stab]e filter, 178
Stable extrapolation, 493, 644
Stacking chart, 93
Stacking operator, 636
Stacking velocity:
and dop-moveout correction, 657
for a 3 D 3 D 3-D3-D3D dipping reflector, 1045
versus normal-moveout velocity, 288
Stackng velocity inversion. 1354, 1392 applied to 3-D seismic data, 1674
Stack-power maximization.
for residual statics corrections, 365
Stationary a1gnal, 167, 222
Statics corrections 325
and f f fff-k filtering, 905
Stationary phase method
to derive traveltume equations, 638
to deruve the equation for DMO ellipsc, 826
Statistical deconvolution, 170, 181
Steep-dip mugration, 535, 549, 641
Stepout, 51, 922
Stiffness matrix, 1965
Stolt migratson. 500,649
applied to prestack data, 776
three-dimensional, 1204
Stolt stretch, 501, 572, 650
Strain. 1794, 2001
compressional, 2003
extensional, 2003
normal, 2002
shear, 2004
Stratigraphic interpretation, 1171, 1744
Stres. 1794, 2001
compressional, 1794, 2001
normal, 1794, 2001
shear, 1794, 2001
tensional, 1794, 2001
tensor, 2001
Stretching caused by NMO correction, 283, 440
Stretch factor for Stolt migration, 501, 572, 650
Strika-line shooting, 1027
Structurally consistent earth modeling, 1742
Structural interpretation, 1161, 1744
Structural inversion: 1557
three-dimensional, 1626, 1651, 1674, 1703
Structure-dependent earth modeling, 1354, 1574
Structure-independent earth modeling, 1354, 1450, 1577
Subsalt itnaging, 1558, 1574, 1626, 1651
Surface-consistent
convolutional model, 169
deconvolution, 262
Surface waves, 1795, 2008
Survey design in 3-D selamic exploration, 1010
Swath recording in 3-D land surveys, 1028, 1031
S S SSS (shear) whves, 1795
S S SSS-wave impedance, 1831
S S SSS-wave reflectivity, 1816
S S SSS-wave velocity 2010
and confining pressure, 272
in dry and saturated rocks, 272
Swell noise, 838
Synthetic sessmogram 249
and convolutional model, 168
in relation to amplitude inversion, 1874
Synthetic sonic loge, 1864
r p r p r-p\boldsymbol{r}-\boldsymbol{p}rp domain 923
multiple attenuation, 932
τ p τ p tau-p\boldsymbol{\tau}-\boldsymbol{p}τp fiter, 931
Temporal frequency, 48
Tessellation in earth modeling, 1363,1631
Thn-lens term, 490, 640
Three-dimensional DMO corroction: 1009, 1046, 1050, 1720 spatial aliasing in, 1049
Three-dimensional migration: 470, 1005, 1051 velocity analysis, 1131
Three-dimensional poststack mugration 1073
by phese-shift method, 1203
by Stolt method, 1204
explicit schemes applied to, 1082,1200
implicit schemes applied to, 1074, 1198
Kirchhoff summation applied to, 1073
Li's correction applied to, 1203
phase-shift-plus-correction applied to, 1088
separation and splitting in, 1199
tume versus depth, 1304
two-pass versus one-pass, 1074
Three-dmensional poststack depth migration, 1304, 1665
implicit versus explicit, 1314
summation strategies in: 1331
traveltme calculations in, 1324
versus time migration, 1304
Three-dimensional prestack time migration: 1099, 113 ?
common-offset, 1112,1720
crossline method for, 1129
Three-dimensional prestack depth mugration: 1321 common-offset method of, 1335,1757
Kirchhoff summation applied to, 1324
migration aperture in, 1333
operator antıahasing m , 1333 m , 1333 m,1333\mathrm{m}, 1333m,1333
traveltime calculation in, 1324
Three-dimensional refraction statics corrections, 1036
Three-dimensional residual statics corrections, 1050
Threedimessional nsualization, 1156
Threshold for velocity-depth ambiguty, 1553
Tume-lapse (4-D) sejsmic, 1912
Time migration: 464,1223
of zero-offet data, 1245
versus depth migration, 1244
Time series, 20
Time slices:
before and after 3-D migration, 1056
Time structure maps, 1416
Time-to-depth conversion, 1416
by map migration, 1425
by vertical stretch, 1356
Time-variant deconvolution, 227
Time-variant dp filtenng, 931
Time-variant DMO correction, 684
Time-variant fltering, 48
Time-variant scaling, 81
Time-variant spectral whitening, 231
Toeplitz matrix 180,253
form in Radon transform, 985
form in complex Wiener filter, 998
Tomography:
generalized linear inversion (GLI) applied to, 1474
limitations in resolving velocity-depth ambiguity by, 1479
model updating by, 1469
reflection traveltime, 1469,1545
turning-ray, 1512
Trace balancing, 89
Trace editing, 92
Trace equalization, 89
Trace interpolation:
and DMO correction, 718
and spatial aliasing, 57
by spatial prediction filters, 1065, 1204
Transverse component in 4-C seismuc, 1926
Transverse sotropy (TI), 1961
Traveltime decompastion:
for residual statics corrections, 3 3 6 , 4 4 3 3 3 6 , 4 4 3 336,443\mathbf{3 3 6 , 4 4 3}336,443
Traveltime calculation in 3-D prestack depth migration: 1324
eikonal equation appled to, 1325
Fermat's principle applied to, 1331
wayefront construction applied to, 1331
Traveltime equation:
associated with double-square-root equation, 638
derivation by stationary phase approximations, 638
for 3-D nonzero-offet recording geometry, 1208
for zero-ofiset recording geometry, 638
Tringulation in earth modcling. 1362,1636
t t ttt-squared gain, 85
t 2 x 2 t 2 x 2 t^(2)-x^(2)t^{2}-x^{2}t2x2 velocity analysis, 289
Turing thickness, 1800
Turning rays, 689
Turning-ray tomography, 1512
Turning-wave reflections: 6 6 5 6 6 5 665\mathbf{6 6 5}665 processing for, 685
Turning-wave migration: 685
Two-pass 3-D migration, 1074
Unconstrained inversion, 1526
Undercorrection in normal-moveout, 280
Undersarnpling, 34
Upcoming waves: 467,628
and downward contimuation, 486,630
and free-surface multiple attenuation, 990
Velocity analys.s 288
and DMO correction, 662
and statics, 304
anisotropuc, 1965
constant-velocity stack, 290
of PS dation, 1946
of 3-D selsmic data, 1050
t 2 x 2 , 289 t 2 x 2 , 289 t^(2)-x^(2),289t^{2}-x^{2}, 289t2x2,289
using velocity spectrum, 295
Velocity field, 14
Velocity-density relatuon, 1797
Velocity-depth ambiguity 14, 1357
threshold for, 1553
Velocity-depth model, 14
Velocity errors:
and DMO correction, 681
and 15-degree finite-difference migration, 525
and frequency-space migration, 544, 552
and frequency-wavenumber mugration, 567
and Kirchhoff mugration, 509
and phase-shift mugration, 567
senstivity of image accuracy to, 1280
Velocity-independent prestack tume mgration, 803
Velocity spectrum. 292
and f k f k f-kf-kfk filtering, 911
and multiples, 887
effect of mute on, 308
effect of offet range on, 305
effect of partial stacking on, 305
effect of random noise 0 , 306 0 , 306 _(0),306{ }_{0}, 3060,306
effect of statics on, 304
measure of coherency used in, 295
factors affecting, 302
Velocity-atack gather, 938
Velocity-itack operator, 948
Velocity-stack transformation, 842
Vertical resolution. 1801
Vertucally transverse isotropy (VTI), 1965
Vertucal seismic profiling (VSP), 1907
Vertical stretch, 1356
Vibrosels correlation, 41, 219
Vibroseis deconvolution, 219
Vibroseis sweep signal, 41, 219
Volume-based interpretation, 1690
V P / V S V P / V S V_(P)//V_(S)V_{P} / V_{S}VP/VS ratio, 1799,2011
VSP (vertical sesmic profiling): 1907
acquisition geometry, 1907
processing, 1907
VSP-CDP transform, 1908
Water-bottom multuple attenuation, 992
Wave-equation datuming. 1228
applied to wavefield modeling, 1782
three-dimensional poststack, 1321
Wavefield extrapolation 628 and migration velocity analysis, 833
in the τ p τ p tau-p\tau-pτp domain, 980
Wavefield modeling, 629
Wavefront divergence: 167
and geometric spreading correction, 81
Wavelength, 1801
Wavelet.
and nonstationarity, 167
as a time-depentents signal, 34
minimum-phase, 176
realizabie and causal, 176
shape and phase spectrum, 36
Wavelet processing, 183
Wavelet shaping factor, 485
Wavefront, 2012
Wavefront constrtiction, 1331
Wavefront velocity, 1963
Wavenumber. cycles per unit distarice, 48
White noise: In deconvolution, 181
Whener filters. 179
complex, 995
equation for, 180
design and application of, 180
theory of 255
Wiener-Levison algorithm, 180
Wrapround in f k f k f-kf-kfk migration, 575
Young's modulus, 1795,2005
Zero-oftset
depth migration, 1223, 1245
section associated with a pont diffractor, 1223
time migration, 1223, 1245
traveltime modeling, 1779
traveltime section, 468,1359
in relation to DMO correction, 655
wavefield modeling, 1781
wavefield sectson, 1239,1789
Zero-offset traveltime equation 638
as special case of nonzero-sfset traveltme equation, 726
Zero phase 34
frequericy filter, 44
Zoeppritz equations, 1811, 2014
z z zzz-transform 155
of a wavelet, 172